19-letter words containing g, r, a, d, e, p
- accelerated program — a course of study which allows students to progress through their education more quickly than usual
- aerial top dressing — the process of spreading lime, fertilizer, etc over farmland from an aeroplane
- aggravated trespass — an offence in which a trespasser in the open air attempts to interfere with a lawful activity, such as hunting
- agitated depression — severe depression accompanied by extreme anxiety and agitation
- 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).
- angle of depression — depression (def 11).
- apres moi le deluge — after me the deluge
- asperger's syndrome — a form of autism in which the person affected has limited but obsessive interests, and has difficulty relating to other people
- auricular appendage — auricle (def 1b).
- auricular-appendage — Anatomy. the projecting outer portion of the ear; pinna. Also called auricular appendage. an ear-shaped appendage projecting from each atrium of the heart. (loosely) the atrium.
- complete quadrangle — a plane figure consisting of four points connected by six lines
- computed tomography — computerized axial tomography. Abbreviation: CT.
- dangling participle — a participle intended to modify a noun but having the wrong grammatical relationship to it as for example having left in the sentence Having left Europe for good, Peter's future seemed bleak indeed
- descriptive grammar — an approach to grammar that is concerned with reporting the usage of native speakers without reference to proposed norms of correctness or advocacy of rules based on such norms.
- digital linear tape — (storage) (DLT) A kind of magnetic tape drive originally developed by DEC and now marketed by Quantum. DLT drives implement the Digital Lempel Ziv 1 (DLZ1) compression algorithm in a combination of hardware and firmware. They use a popular chip by Stac (now hi/fn) to do the string searching. Counting, sorting and Huffman coding are done in firmware (with hardware support for the Huffman algorithm?). In April 1997 DLT drives can transfer 5 megabytes per second and can store 35 gigabytes on a single cartridge. Compression might roughly double these figures.
- display advertising — display ads taken collectively.
- electrocardiographs — Plural form of electrocardiograph.
- electrocardiography — The measurement of electrical activity in the heart and the recording of such activity as a visual trace (on paper or on an oscilloscope screen), using electrodes placed on the skin of the limbs and chest.
- free alongside ship — (of a shipment of goods) delivered to the dock without charge to the buyer, but excluding the cost of loading onto the vessel
- gedanken experiment — thought experiment.
- germander speedwell — a speedwell, Veronica chamaedrys, having blue flowers.
- get one's dander up — to become or to cause someone to become annoyed or angry
- gigabits per second — (unit) (Gbps) A unit of information transfer rate equal to one billion bits per second. Note that, while a gigabit is defined as a power of two (2^30 bits), a gigabit per second is defined as a power of ten (10^9 bits per second, which is slightly less) than 2^30).
- grade point average — a measure of scholastic attainment computed by dividing the total number of grade points received by the total number of credits or hours of course work taken.
- grievance procedure — the established series of steps to be taken in dealing with a grievance raised with an employer by an employee
- ground-plane aerial — a quarter-wave vertical dipole aerial in which the electrical image forming the other quarter-wave section is formed by reflection in a system of radially disposed metal rods or in a conductive sheet
- highways department — the department of a state, council, etc, responsible for the upkeep of roads and highways
- index expurgatorius — a list of books now included in the Index Librorum Prohibitorum, forbidden to be read except from expurgated editions.
- iterative deepening — (algorithm) A graph search algorithm that will find the shortest path with some given property, even when the graph contains cycles. When searching for a path through a graph, starting at a given initial node, where the path (or its end node) has some desired property, a depth-first search may never find a solution if it enters a cycle in the graph. Rather than avoiding cycles (i.e. never extend a path with a node it already contains), iterative deepening explores all paths up to length (or "depth") N, starting from N=0 and increasing N until a solution is found.
- kellogg-briand pact — a treaty renouncing war as an instrument of national policy and urging peaceful means for the settlement of international disputes, originally signed in 1928 by 15 nations, later joined by 49 others.
- landscape gardening — the art or trade of designing or rearranging large gardens, estates, etc.
- load-bearing printf — (programming, humour) The kind of bug present in a program which works correctly when producing debug output but fails when the debugging is turned off. The expression combines load-bearing wall and printf as used in debugging by printf.
- magnetic tape drive — (storage) (Or "tape drive") A peripheral device that reads and writes magnetic tape.
- megabits per second — (unit) (Mbps, Mb/s) Millions of bits per second. A unit of data rate. 1 Mb/s = 1,000,000 bits per second (not 1,048,576). E.g. Ethernet can carry 10 Mbps.
- nonproprietary drug — A nonproprietary drug is a generic drug that is essentially similar to a drug with a brand name.
- old english pattern — a spoon pattern having a stem curving backward at the end.
- orthopaedic surgeon — a surgeon specializing in the branch of surgery concerned with disorders of the spine and joints and the repair of deformities of these parts
- orthopaedic surgery — surgery concerned with disorders of the spine and joints and the repair of deformities of these parts
- parliament building — structure housing legislative offices
- pecuniary advantage — financial advantage that is dishonestly obtained by deception and that constitutes a criminal offence
- pedestrian crossing — place to cross road
- pen-and-ink drawing — a drawing that is done using a pen rather than a pencil
- photodisintegration — the disintegration of a nucleus, induced by its absorption of a photon.
- physical addressing — (networking) The low level addressing scheme used on Ethernet. The 48-bit destination Ethernet address in a packet is compared with the receiving node's Ethernet address. Compare IP address.
- pretty good privacy — (tool, cryptography) (PGP) A high security RSA public-key encryption application for MS-DOS, Unix, VAX/VMS, and other computers. It was written by Philip R. Zimmermann <[email protected]> of Phil's Pretty Good(tm) Software and later augmented by a cast of thousands, especially including Hal Finney, Branko Lankester, and Peter Gutmann. PGP was distributed as "guerrilla freeware". The authors don't mind if it is distributed widely, just don't ask Philip Zimmermann to send you a copy. PGP uses a public-key encryption algorithm claimed by US patent #4,405,829. The exclusive rights to this patent are held by a California company called Public Key Partners, and you may be infringing this patent if you use PGP in the USA. This is explained in the PGP User's Guide, Volume II. PGP allows people to exchange files or messages with privacy and authentication. Privacy and authentication are provided without managing the keys associated with conventional cryptographic software. No secure channels are needed to exchange keys between users, which makes PGP much easier to use. This is because PGP is based on public-key cryptography. PGP encrypts data using the International Data Encryption Algorithm with a random session key, and uses the RSA algorithm to encrypt the session key. In December 1994 Philip Zimmermann faced prosecution for "exporting" PGP out of the United States but in January 1996 the US Goverment dropped the case. A US law prohibits the export of encryption software out of the country. Zimmermann did not do this, but the US government hoped to establish the proposition that posting an encryption program on a BBS or on the Internet constitutes exporting it - in effect, stretching export control into domestic censorship. If the government had won it would have had a chilling effect on the free flow of information on the global network, as well as on everyone's privacy from government snooping.
- procedural language — (language) Any programming language in which the programmer specifies an explicit sequences of steps to follow to produce a result (an algorithm). The term should not be confused with "imperative language" - a language that specifies explicit manipulation of state. An example (non-imperative) procedural language is LOGO, which specifies sequences of steps to perform but does not have an internal state. Other procedural languages include Basic, Pascal, C, and Modula-2. Both procedural and imperative languages are in contrast to declarative languages, in which the programmer specifies neither explicit steps nor explicit state manipulation.
- programmed learning — a progressively monitored, step-by-step teaching method, employing small units of information or learning material and frequent testing, whereby the student must complete or pass one stage before moving on to the next.
- progressive judaism — Reform Judaism.
- pseudo-biographical — of or relating to a person's life: He's gathering biographical data for his book on Milton.
- sea floor spreading — a process in which new ocean floor is created as molten material from the earth's mantle rises in margins between plates or ridges and spreads out.
On this page, we collect all 19-letter words with G-R-A-D-E-P. It’s easy to find right word with a certain length. It is the easiest way to find 19-letter word that contains in G-R-A-D-E-P to use in Scrabble or Crossword puzzles