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 84
Page 298
... tion we investigate this claim by first introducing the rudiments of the algorithm and then taking a brief look at a declarative programming language based on it . Logical Deduction Suppose we know that either Kermit is on stage or ...
... tion we investigate this claim by first introducing the rudiments of the algorithm and then taking a brief look at a declarative programming language based on it . Logical Deduction Suppose we know that either Kermit is on stage or ...
Page 402
... tion called NEW1 . The list we are seeking is the JobTitle column within this new rela- tion . The PROJECT operation allows us to extract this column ( or columns if required ) and place the result in a new relation . We express such an ...
... tion called NEW1 . The list we are seeking is the JobTitle column within this new rela- tion . The PROJECT operation allows us to extract this column ( or columns if required ) and place the result in a new relation . We express such an ...
Page 448
... tion environment . The beginning state is called the start ( or initial ) state ; the desired state ( or states ) is called the goal state . ( In our case , a state is a con- figuration of the eight - puzzle ; the start state is the ...
... tion environment . The beginning state is called the start ( or initial ) state ; the desired state ( or states ) is called the goal state . ( In our case , a state is a con- figuration of the eight - puzzle ; the start state is 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