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 83
Page 208
... problem solving , the following loosely defined problem - solving phases presented by the mathematician G. Polya in 1945 remain the basic principles on which many attempts to teach problem - solving skills are based today . Phase 1 ...
... problem solving , the following loosely defined problem - solving phases presented by the mathematician G. Polya in 1945 remain the basic principles on which many attempts to teach problem - solving skills are based today . Phase 1 ...
Page 504
... Problems In Section 11.4 we investigated the solvability of problems . In this section we are inter- ested in the question of whether a solvable problem has a practical solution . We will find that some problems that are theoretically ...
... Problems In Section 11.4 we investigated the solvability of problems . In this section we are inter- ested in the question of whether a solvable problem has a practical solution . We will find that some problems that are theoretically ...
Page 512
... problem that can be solved in polynomial time by a nondeterministic algo- rithm is called a nondeterministic polynomial problem , or an NP problem for short . It is customary to denote the class of NP problems by NP . Note that all the ...
... problem that can be solved in polynomial time by a nondeterministic algo- rithm is called a nondeterministic polynomial problem , or an NP problem for short . It is customary to denote the class of NP problems by NP . Note that all the ...
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