An Invitation to Computer ScienceThis introductory computer science text provides a breadth-first (bottom-up as opposed to top-down) approach, first introducing the foundation of computer science and algorithms, then building on each central idea (hardware, system software and virtual machines, and languages) before finally discussing common applications, artificial intelligence, and social and legal issues. It is for CS0-the course students may take before CS1 for an overview and understanding of computer science without programming. |
From inside the book
Results 1-2 of 2
Page 55
... described in Chapter 5 of the text . Each instruction consists of two parts : a four - bit opcode that represents the operation to be performed , and a twelve - bit address field that represents the address of the operand . The sixteen ...
... described in Chapter 5 of the text . Each instruction consists of two parts : a four - bit opcode that represents the operation to be performed , and a twelve - bit address field that represents the address of the operand . The sixteen ...
Page 115
... described in section 11.4 of the text . This lab experience is based on the Mathematica package which was covered in the text . If you are using a different package , the necessary modifications should be provided by your instructor ...
... described in section 11.4 of the text . This lab experience is based on the Mathematica package which was covered in the text . If you are using a different package , the necessary modifications should be provided by your instructor ...
Other editions - View all
Invitation to Computer Science: Java Version G. Michael Schneider,Judith L. Gersting No preview available - 2004 |
Common terms and phrases
array assembly language program average Bubble Sort Chapter choose commands Compile copy operations data set define delete displays element enter execute expression Figure File menu formula function gate Gopher Information Client graph Information Client 2.0 input values Insertion Sort integer Internet Gopher Information Lab Experience lab software label LISP load loop machine code machine language marker memory move Neumann machine number of 1's number of comparisons number of copy object code opcode Open the file option output package parameters parity bit parity checker Pascal program pivot Points2 position procedure pseudocode q to Quit Quick Sort read head recursive reset button Run menu run the program scatter plot Search Animator simulator Sort Algorithm menu source program step button string sublist switch symbol table tape translation truth table Turing machine virtual machine von Neumann machine window