Computer Science: A Modern IntroductionComputer Science: A Modern Introduction provides an introductory overview of the discipline of computer science, using the notion of algorithms as the unifying concept. |
Other editions - View all
Computer Science: A Modern Introduction L. Goldschlager,Les Goldschlager,Andrew Lister Snippet view - 1988 |
Common terms and phrases
allocated arbitrary binary bits called Chapter Church-Turing thesis compiler complex components computer science contains Control signal correct data structure described digit disk error example executed expressed Figure game tree GCD(x,y halting problem hardware high level language high level program I/O transfer inductive hypothesis infeasible initial input data integers interpreter iteration lexical analysis loop machine language machine language instruction main memory memory address memory cell merge microinstruction microprogram module move multiply NEWREC nodes NP-complete object program OLDREC operating system output parallel parse tree particular perform phase polynomial possible potential prime production program address programming language proof reader record recursive refinement represented result robot secondary storage Section sequence of characters shown in Fig simple sorting algorithm statement step stored subtree syntax syntax analysis task terminal symbols theorem tion transaction TRANSREC understand update