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 91
Page 476
... machines is more sub- tle - more fundamental - than those dealing with power struggles between different segments of society . The issues strike at the very heart of humanity's self - image . In the nineteenth century , society was ...
... machines is more sub- tle - more fundamental - than those dealing with power struggles between different segments of society . The issues strike at the very heart of humanity's self - image . In the nineteenth century , society was ...
Page 488
... both ends and is divided into cells , each of which can contain any one of a finite set of symbols . This set is called the machine's alphabet . Figure 11.2 The components of a Turing machine Control unit Luth Turing Machines.
... both ends and is divided into cells , each of which can contain any one of a finite set of symbols . This set is called the machine's alphabet . Figure 11.2 The components of a Turing machine Control unit Luth Turing Machines.
Page 489
... machine's computation , the machine must be in one of a finite number of conditions , called states . A Turing machine's computation begins in a special state called the start state and ceases when the machine reaches another special ...
... machine's computation , the machine must be in one of a finite number of conditions , called states . A Turing machine's computation begins in a special state called the start state and ceases when the machine reaches another special ...
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