19-letter words containing dat
- accommodation paper — a bill of exchange cosigned by one party as maker, acceptor, or endorser without requiring collateral or a fee, in order to lend his or her credit reputation to the second party
- accommodation party — the guarantor who signs an accommodation bill
- accommodation train — a local train that stops at small stations along a route
- algebraic data type — (programming) (Or "sum of products type") In functional programming, new types can be defined, each of which has one or more constructors. Such a type is known as an algebraic data type. E.g. in Haskell we can define a new type, "Tree": data Tree = Empty | Leaf Int | Node Tree Tree with constructors "Empty", "Leaf" and "Node". The constructors can be used much like functions in that they can be (partially) applied to arguments of the appropriate type. For example, the Leaf constructor has the functional type Int -> Tree. A constructor application cannot be reduced (evaluated) like a function application though since it is already in normal form. Functions which operate on algebraic data types can be defined using pattern matching: depth :: Tree -> Int depth Empty = 0 depth (Leaf n) = 1 depth (Node l r) = 1 + max (depth l) (depth r) The most common algebraic data type is the list which has constructors Nil and Cons, written in Haskell using the special syntax "[]" for Nil and infix ":" for Cons. Special cases of algebraic types are product types (only one constructor) and enumeration types (many constructors with no arguments). Algebraic types are one kind of constructed type (i.e. a type formed by combining other types). An algebraic data type may also be an abstract data type (ADT) if it is exported from a module without its constructors. Objects of such a type can only be manipulated using functions defined in the same module as the type itself. In set theory the equivalent of an algebraic data type is a discriminated union - a set whose elements consist of a tag (equivalent to a constructor) and an object of a type corresponding to the tag (equivalent to the constructor arguments).
- committed data rate — (communications) (CDR) The data transfer rate that an ISP guarantees a virtual circuit will carry. The CDR is the data portion of Committed Information Rate (CIR).
- consolidated school — a public school attended by pupils from several adjoining, esp. rural, districts
- data driven machine — (language) (DDM) A dataflow language.
- data encryption key — (DEK) Used for the encryption of message text and for the computation of message integrity checks (signatures). See cryptography.
- data link switching — (networking) (DLSw) A standard for transporting IBM Systems Network Architecture (SNA) and network basic input/output system (NetBIOS) traffic over an Internet protocol network. Initially, in 1992, DLSw was proprietary to IBM. It was submitted to the IETF as RFC 1434 in 1993, later updated by RFC 1795.
- data protection act — (legal) (DPA) A UK law guaranteeing rights to individuals in relation to personal data that others hold on them. For example, under the DPA, you have the right to see what data a company holds on you.
- data terminal ready — (communications) (DTR) The wire in a full RS-232 connection that tells the Data Communication Equipment (DCE, typically a modem) that the Data Terminal Equipment (DTE, typically a computer or terminal) is ready to transmit and receive data.
- database management — the maintenance of information stored in a computer system
- datatron 200 series — (computer) A family of computers produced by Burroughs that included the Datatron 204 and Datatron 220.
- extensible database — (database) A DBMS that allows access to data from remote sources as if the remote data were part of the database.
- floating foundation — a foundation used in yielding soil, having for its footing a raft tending to displace a weight greater than that of the building.
- foundation subjects — the subjects studied as part of the National Curriculum, including the compulsory core subjects
- functional database — (database, language) A database which uses a functional language as its query language. Databases would seem to be an inappropriate application for functional languages since, a purely functional language would have to return a new copy of the entire database every time (part of) it was updated. To be practically scalable, the update mechanism must clearly be destructive rather than functional; however it is quite feasible for the query language to be purely functional so long as the database is considered as an argument. One approach to the update problem would use a monad to encapsulate database access and ensure it was single threaded. Alternative approaches have been suggested by Trinder, who suggests non-destructive updating with shared data structures, and Sutton who uses a variant of a Phil Wadler's linear type system. There are two main classes of functional database languages. The first is based upon Backus' FP language, of which FQL is probably the best known example. Adaplan is a more recent language which falls into this category. More recently, people have been working on languages which are syntactically very similar to modern functional programming languages, but which also provide all of the features of a database language, e.g. bulk data structures which can be incrementally updated, type systems which can be incrementally updated, and all data persisting in a database. Examples are PFL [Poulovassilis&Small, VLDB-91], and Machiavelli [Ohori et al, ACM SIGMOD Conference, 1998].
- future date testing — (testing) The process of setting a computer's date to a future date to test a program's (expected or unexpected) date sensitivity. Future date testing only shows the effects of dates on the computer(s) under scrutiny, it does not take into account knock-on effects of dates on other connected systems.
- go into liquidation — to close one's business by collecting assets and settling all debts
- hotel accommodation — the facilities and the quality of accommodation provided by a hotel
- novell data systems — (company) A small computer hardware company building CP/M Z80-based systems. They later went on to become Novell, Inc. and develop Novell Netware.
- oxidation potential — (in a galvanic cell) the potential of the electrode at which oxidation occurs.
- oxidation-reduction — a chemical reaction between two substances in which one substance is oxidized and the other reduced.
- relational database — an electronic database comprising multiple files of related information, usually stored in tables of rows (records) and columns (fields), and allowing a link to be established between separate files that have a matching field, as a column of invoice numbers, so that the two files can be queried simultaneously by the user.
- very large database — (database) (VLDB) A database that can use a Very Large Memory model to keep as much data as possible in physical memory. (Oracle http://oracle.com/platforms/dec/collateral/vlmwp_3.html).
On this page, we collect all 19-letter words with DAT. It’s easy to find right word with a certain length. It is the easiest way to find 19-letter word that contains DAT to use in Scrabble or Crossword puzzles.