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 29
Page 179
... input lines and 1 output line . Its function is to select exactly one of its 2 input lines and copy the binary value on that input line onto its single output line . A multiplexor chooses one spe- cific input by using an additional set of N ...
... input lines and 1 output line . Its function is to select exactly one of its 2 input lines and copy the binary value on that input line onto its single output line . A multiplexor chooses one spe- cific input by using an additional set of N ...
Page 180
... input lines and a single selector line . In Figure 4.28 if the value on the selector line is 0 , then the bottom input line to AND gate 2 is always 0 , so its output is always 0. Looking at AND gate 1 , we see that the NOT gate changes ...
... input lines and a single selector line . In Figure 4.28 if the value on the selector line is 0 , then the bottom input line to AND gate 2 is always 0 , so its output is always 0. Looking at AND gate 1 , we see that the NOT gate changes ...
Page 181
... input lines are 101 , which is a 5 , then a signal ( a binary 1 ) would be sent out by the decoder on output line 5. All other out- put lines would contain a 0 . Figure 4.29 shows the design of a 2 - to - 4 decoder circuit with two ...
... input lines are 101 , which is a 5 , then a signal ( a binary 1 ) would be sent out by the decoder on output line 5. All other out- put lines would contain a 0 . Figure 4.29 shows the design of a 2 - to - 4 decoder circuit with two ...
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