Computer Science: An OverviewIntroduction to Computer Science Computer Science: An Overview, Ninth Edition J. Glenn Brookshear, "Marquette University" Do you want your students to gain a fundamental understanding of the field of computer science? Would you like them to be excited by the opportunities computing presents for further studies and future careers? "Computer Science: An Overview "delivers a foundational framework of what computer science is all about. Each topic is presented with a historical perspective, its current state, and its future potential, as well as ethical issues for students to consider. This balanced, realistic picture helps students see that their future success depends on a solid overview in the rapidly changing field of computer science. Features:
|
From inside the book
Results 1-3 of 21
Page 234
... insertion sort algorithm ( summarized in Figure 5.11 ) in a sim- ilar manner . Recall that this algorithm involves ... insertion sort to a list with n entries requires n - 1 comparisons . ( The second entry is compared to one entry , the ...
... insertion sort algorithm ( summarized in Figure 5.11 ) in a sim- ilar manner . Recall that this algorithm involves ... insertion sort to a list with n entries requires n - 1 comparisons . ( The second entry is compared to one entry , the ...
Page 235
... sort a list of n entries . If , for example , we use the insertion sort to sort a variety of lists of length 10 , we expect the average number of comparisons per sort to be 22.5 . The significance of these results is that the number of ...
... sort a list of n entries . If , for example , we use the insertion sort to sort a variety of lists of length 10 , we expect the average number of comparisons per sort to be 22.5 . The significance of these results is that the number of ...
Page 506
... insertion sort algorithm solves the problem . The problem of sorting , however , is known to be in O ( n lg n ) , which tells us that the insertion sort algorithm is not an optimal solution ( in the con- text of time complexity ) . An ...
... insertion sort algorithm solves the problem . The problem of sorting , however , is known to be in O ( n lg n ) , which tells us that the insertion sort algorithm is not an optimal solution ( in the con- text of time complexity ) . An ...
Contents
Introduction | 1 |
Data Manipulation | 79 |
Networking and the Internet | 147 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
activities application application software Apply the procedure approach assigned binary search binary search algorithm bit pattern browser byte called Carol Chapter client communication components computer science consider containing data type database described diagram digits disk document domain employee encoded encryption entry example executed Figure goal hexadecimal identify implemented input insertion sort instruction integer Internet linked loop machine language machine's main memory mass storage means memory cell network layer node notation object-oriented operating system output perform pointer problem procedure Search produce program counter programming languages protocol pseudocode Questions & Exercises record recursive representation represented requests result retrieve Section sequence sequential server software engineering solving sort algorithm stack statement steps stored structure Suppose TargetValue task techniques TestEntry tion transferred transport layer tree Turing Turing machine two's complement unit variable