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-3 of 28
Page 20
... data . You will now make use of the animator to explore this dependence in more depth . Using the step mode , you should now gather data from 10 executions of the algorithm . For each data set , you should copy down the data and keep up ...
... data . You will now make use of the animator to explore this dependence in more depth . Using the step mode , you should now gather data from 10 executions of the algorithm . For each data set , you should copy down the data and keep up ...
Page 21
... data set Look at the data obtained in Exercise 2. Notice that the values are recorded from a subsequence of the original data set ; i.e. , the values are taken from the original set in the same relative order as in the original set ...
... data set Look at the data obtained in Exercise 2. Notice that the values are recorded from a subsequence of the original data set ; i.e. , the values are taken from the original set in the same relative order as in the original set ...
Page 30
... data set consists of the numbers 34 52 21 14 67 59 30 18 Show the exact arrangement of the data after 3 major passes have been made by the Selection Sort algorithm , where a major pass is completed each time we come back to Step 2 ...
... data set consists of the numbers 34 52 21 14 67 59 30 18 Show the exact arrangement of the data after 3 major passes have been made by the Selection Sort algorithm , where a major pass is completed each time we come back to Step 2 ...
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