0%

15-letter words containing p, o, r, n, g, a

  • desktop manager — A user interface to system services, usually icon and menu based like the Macintosh Finder, enabling the user to run application programs and use a file system without directly using the command language of the operating system.
  • draughtproofing — Present participle of draughtproof.
  • drip irrigation — a system of crop irrigation involving the controlled delivery of water directly to individual plants through a network of tubes or pipes.
  • edgar allan poeEdgar Allan, 1809–49, U.S. poet, short-story writer, and critic.
  • egyptian clover — a Mediterranean clover, Trifolium alexandrinum, grown as a forage crop and to improve the soil in the southwestern US and the Nile valley
  • encephalography — Any of various techniques for recording the structure or electrical activity of the brain.
  • english sparrow — a small Eurasian weaverbird, Passer domesticus, now established in North America and Australia. It has a brown streaked plumage with grey underparts
  • epeirogenically — in the manner of epeirogeny
  • ergatandromorph — an ant with the characteristics of both worker and male
  • export earnings — the earnings of a company or country that are generated through the export of goods or services
  • family grouping — a system, used usually in the infant school, of grouping children of various ages together, esp for project work
  • flapping router — (networking)   A router that transmits routing updates alternately advertising a destination network first via one route, then via a different route. Flapping routers are identified on more advanced protocol analysers such as the Network General (TM) Sniffer.
  • flowering maple — any of various shrubs belonging to the genus Abutilon, of the mallow family, having large, bright-colored flowers.
  • flowering plant — a plant that produces flowers, fruit, and seeds; angiosperm.
  • fore-topgallant — being a sail, yard, or rigging belonging to a fore-topgallant mast.
  • front-page news — a story printed on the first page of a newspaper
  • gaming platform — a computer system specially made for playing video games; a console: The new gaming platforms have much better graphics resolution than previous generation consoles.
  • garrison troops — troops who maintain and guard a military base or fortified place
  • general-purpose — useful in many ways; not limited in use or function: a good general-purpose dictionary.
  • geneva protocol — the agreement in 1925 to ban the use of asphyxiating, poisonous, or other gases in war. It does not ban the development or manufacture of such gases
  • glazier's point — a small, pointed piece of sheet metal, for holding a pane of glass in a sash until the putty has hardened.
  • golden eardrops — a Californian plant, Dicentra chrysantha, of the fumitory family, having bluish-green foliage and branched clusters of yellow flowers.
  • golden samphire — a Eurasian coastal plant, Inula crithmoides, with fleshy leaves and yellow flower heads: family Asteraceae (composites)
  • good and proper — thoroughly
  • grabber pointer — (operating system)   A mouse pointer sprite in the shape of a small hand that closes when a mouse button is clicked, indicating that the object on the screen under the pointer has been selected.
  • grafenberg spot — a patch of tissue in the front wall of the vagina, claimed to be erectile and highly erogenous.
  • gramophonically — in a gramophonic manner
  • grampian region — a former local government region in NE Scotland, formed in 1975 from Aberdeenshire, Kincardineshire, and most of Banffshire and Morayshire; replaced in 1996 by the council areas of Aberdeenshire, City of Aberdeen, and Moray
  • grand old party — G.O.P.
  • grandparenthood — The state of being a grandparent.
  • graph colouring — (application)   A constraint-satisfaction problem often used as a test case in research, which also turns out to be equivalent to certain real-world problems (e.g. register allocation). Given a connected graph and a fixed number of colours, the problem is to assign a colour to each node, subject to the constraint that any two connected nodes cannot be assigned the same colour. This is an example of an NP-complete problem. See also four colour map theorem.
  • graph reduction — A technique invented by Chris Wadsworth where an expression is represented as a directed graph (usually drawn as an inverted tree). Each node represents a function call and its subtrees represent the arguments to that function. Subtrees are replaced by the expansion or value of the expression they represent. This is repeated until the tree has been reduced to a value with no more function calls (a normal form). In contrast to string reduction, graph reduction has the advantage that common subexpressions are represented as pointers to a single instance of the expression which is only reduced once. It is the most commonly used technique for implementing lazy evaluation.
  • graviperception — the perception of gravity by plants
  • grecian profile — a profile distinguished by the absence of the hollow between the upper ridge of the nose and the forehead, thereby forming a straight line.
  • grey propaganda — propaganda that does not identify its source
  • group insurance — life, accident, or health insurance available to a group of persons, as the employees of a company, under a single contract, usually without regard to physical condition or age of the individuals.
  • gynandromorphic — (of an organism) Having male and female characteristics.
  • halting problem — The problem of determining in advance whether a particular program or algorithm will terminate or run forever. The halting problem is the canonical example of a provably unsolvable problem. Obviously any attempt to answer the question by actually executing the algorithm or simulating each step of its execution will only give an answer if the algorithm under consideration does terminate, otherwise the algorithm attempting to answer the question will itself run forever. Some special cases of the halting problem are partially solvable given sufficient resources. For example, if it is possible to record the complete state of the execution of the algorithm at each step and the current state is ever identical to some previous state then the algorithm is in a loop. This might require an arbitrary amount of storage however. Alternatively, if there are at most N possible different states then the algorithm can run for at most N steps without looping. A program analysis called termination analysis attempts to answer this question for limited kinds of input algorithm.
  • hardhead sponge — any of several commercial sponges, as Spongia officinalis dura, of the West Indies and Central America, having a harsh, fibrous, resilient skeleton.
  • holding pattern — a traffic pattern for aircraft at a specified location (holding point) where they are ordered to remain until permitted to land or proceed.
  • human geography — the study of the interaction between human beings and their environment in particular places and across spatial areas.
  • hunting leopard — the cheetah.
  • huntington park — a city in SW California, near Los Angeles.
  • hyperpolarizing — Present participle of hyperpolarize.
  • imperial gallon — a British gallon used in liquid and dry measurement equivalent to 1.2 U.S. gallons, or 4.54 liters.
  • interiorscaping — The design, installation, and maintenance of interiorscapes.
  • interrecord gap — the area or space separating consecutive physical records of data on an external storage medium.
  • ipod generation — members of the generation of adults born after 1970, who are less financially secure than their parents, due to student debt, high house prices, and job insecurity
  • leptosporangium — (botany) A sporangium formed from a single epidermal cell.
  • linear topology — (theory)   A linear topology on a left A-module M is a topology on M that is invariant under translations and admits a fundamental system of neighborhood of 0 that consists of submodules of M. If there is such a topology, M is said to be linearly topologized. If A is given a discrete topology, then M becomes a topological A-module with respect to a linear topology.
Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?