Invitation to Computer Science: Java VersionThis 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. |
From inside the book
Results 1-3 of 37
Page 72
... match at position k , we must add 1 to k to begin searching for a match at the next position . This is the " sliding forward " step diagrammed earlier . The final high - level statement in Figure 2.15 that needs to be expanded is the ...
... match at position k , we must add 1 to k to begin searching for a match at the next position . This is the " sliding forward " step diagrammed earlier . The final high - level statement in Figure 2.15 that needs to be expanded is the ...
Page 112
... match each pattern character against the text characters . The process stops only after text position n - m + 1 , when the remaining text is not as long as the pattern so that there could not possibly be a match . This algo- rithm is ...
... match each pattern character against the text characters . The process stops only after text position n - m + 1 , when the remaining text is not as long as the pattern so that there could not possibly be a match . This algo- rithm is ...
Page 686
... match No Output = Sorry , but the name is not in the directory . 2. n = 7 , A = 22 , 18 , 23 , 17 , 25 , 30 , 2 ... match . End of the check for a match at position 1 of the text . Compare P1 , the " a " , to T2 , the blank . No match ...
... match No Output = Sorry , but the name is not in the directory . 2. n = 7 , A = 22 , 18 , 23 , 17 , 25 , 30 , 2 ... match . End of the check for a match at position 1 of the text . Compare P1 , the " a " , to T2 , the blank . No match ...
Contents
An Introduction to Computer Science 1 | 20 |
LEVER The Algorithmic Foundations of Computer Science | 36 |
EXERCISES | 75 |
Copyright | |
23 other sections not shown
Other editions - View all
Invitation to Computer Science: Java Version G. Michael Schneider,Judith L. Gersting No preview available - 2006 |
Common terms and phrases
assembly language assignment statement Assume binary search bits called Chapter circuit compiler computer science computer system computing agent contains decimal decoder described developed device digits efficient encoding Ethernet example executed fetch gates hardware high-level language high-level programming language integer Internet Java LABORATORY EXPERIENCE language program largest layer LOAD machine language machine language instructions memory cell memory location Neumann node op code operating system output line parse tree processor produce programming language protocol pseudocode puter represent representation result rithm selection sort sequence sequential search algorithm server Set the value shown in Figure single solve sort algorithm specific speed step symbol system software tape task tion transistors truth table Turing machine variable Von Neumann architecture Von Neumann machine write