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 78
Page 224
... entry is in a sorted list , but this time we get our foot in the door by considering the procedure we follow when searching a dictionary . In this case we do not perform a sequential entry - by - entry or even a page - by - page ...
... entry is in a sorted list , but this time we get our foot in the door by considering the procedure we follow when searching a dictionary . In this case we do not perform a sequential entry - by - entry or even a page - by - page ...
Page 234
... entry , comparing this entry to those preceding it until the proper place for the pivot is found , and then inserting the pivot entry in this place . Since the activity of com- paring two entries dominates the algorithm , our approach ...
... entry , comparing this entry to those preceding it until the proper place for the pivot is found , and then inserting the pivot entry in this place . Since the activity of com- paring two entries dominates the algorithm , our approach ...
Page 362
... entry and a pointer . Here we store the new entry and fill in the pointer with the address of the entry in the list that should follow the new entry . Finally , we change the pointer associated with the entry that should precede the new ...
... entry and a pointer . Here we store the new entry and fill in the pointer with the address of the entry in the list that should follow the new entry . Finally , we change the pointer associated with the entry that should precede the new ...
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