0%

Words containing p, c

5 letter words containing p, c

  • p-cad — (application)   A CAE system marketed by CADAM, an IBM company.

6 letter words containing p, c

  • p-code — (language)   The intermediate language produced by the Pascal-P compiler. P-code is the assembly language for a hypothetical stack machine, the P-machine, said to imitate the instruction set of the Burroughs 6700. The term was first used in the Wirth reference below. Byte articles on writing a Pascal Compiler in Northstar BASIC (ca Aug 1978) also used the term. P-code was initially the intermediate code generated by the P2 compiler from ETH Zurich. P-code was later used as the intermediate language in the UCSD Pascal System, and in its two main derivatives, Apple Pascal and the UCSD P-system. Variants: P2 P-code, P4 P-code, UCSD P-code, LASL P-code.

8 letter words containing p, c

  • p-celtic — the subbranch of Celtic in which the Proto-Indo-European kw -sound became a p -sound. Welsh, Breton, Cornish, and Gaulish belong to P-Celtic.
  • tip-cart — a cart with a body that can be tilted to empty it of its contents
  • up-close — intimate, close-up
  • zip-code — to provide or mark with a zip code: Zip-code all mail.

9 letter words containing p, c

  • chop-chop — with haste; quickly.
  • clip-clop — the sound made by a horse's hooves
  • clop-clop — a clattering sound of repeated clops.
  • lap-chart — a log of every lap covered by each car in a race, showing the exact position throughout
  • sharp-cut — cut so as to have a sharp edge: a tool with a sharp-cut blade.

11 letter words containing p, c

  • np-complete — (complexity)   (NPC, Nondeterministic Polynomial time complete) A set or property of computational decision problems which is a subset of NP (i.e. can be solved by a nondeterministic Turing Machine in polynomial time), with the additional property that it is also NP-hard. Thus a solution for one NP-complete problem would solve all problems in NP. Many (but not all) naturally arising problems in class NP are in fact NP-complete. There is always a polynomial-time algorithm for transforming an instance of any NP-complete problem into an instance of any other NP-complete problem. So if you could solve one you could solve any other by transforming it to the solved one. The first problem ever shown to be NP-complete was the satisfiability problem. Another example is Hamilton's problem. See also computational complexity, halting problem, Co-NP, NP-hard.

12 letter words containing p, c

On this page, we collect all words with P, C. To make easier to find the right word we have divided all 15 words to groups according to their length. So you should go to appropriate page if can’t find the word that contains P, C that you are searching. Also you can use this page in Scrabble.

Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?