Invitation to Computer Science: Java Version
Thomson Course Technology, 2006 - Computers - 720 pages
This new edition of Invitation to Computer Science follows the breadth-first guidelines recommended by CC2001 to teach computer science topics from the ground up. The authors begin by showing that computer science is the study of algorithms, the central theme of the book, then move up the next five levels of the hierarchy: hardware, virtual machine, software, applications, and ethics. Utilizing rich pedagogy and a consistently engaging writing style, Schneider and Gersting provide students with a solid grounding in theoretical concepts, as well as important applications of computing and information technology. A laboratory manual and accompanying software is available as an optional bundle with this text.
50 pages matching Neumann in this book
Results 1-3 of 50
What people are saying - Write a review
We haven't found any reviews in the usual places.
An Introduction to Computer Science
Algorithm Discovery and Design
16 other sections not shown
Other editions - View all
assembly language assignment statement binary search binary search algorithm binary value bits Boolean expression called Chapter character circuit column compiler computer science computer system computing agent construct contains copy database decimal decoder described developed device diagram digits efficient encoding encryption example executed FORTRAN gates hardware high-level language high-level programming language input lines integer Internet Java LABORATORY EXPERIENCE largest LOAD logic look machine language match mathematical memory cell Neumann node number of comparisons operating system output line parse tree position Print processor produce programming language pseudocode puter represent representation requires result rithm selection sort sequence sequential search algorithm server Set the value shown in Figure single solution solve sort algorithm specific step symbol tape task tion transistors truth table Turing machine variable write