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 66
Page 67
... bit , called a parity bit , to each pattern in an encoding system already available ( perhaps at the high - order end ) . In each case , we assign the value 1 or 0 to this new bit so that the entire resulting pattern has an odd number ...
... bit , called a parity bit , to each pattern in an encoding system already available ( perhaps at the high - order end ) . In each case , we assign the value 1 or 0 to this new bit so that the entire resulting pattern has an odd number ...
Page 68
... pattern is designed to contain an even number of 1s , and thus an error is signaled by the occurrence of a pattern ... bit capac- ity , in reality each has a capacity of nine bits , one bit of which is used as a parity bit . Each time an ...
... pattern is designed to contain an even number of 1s , and thus an error is signaled by the occurrence of a pattern ... bit capac- ity , in reality each has a capacity of nine bits , one bit of which is used as a parity bit . Each time an ...
Page 115
... bits of an eight - bit pattern without disturbing the other bits . b . Complement a pattern of eight bits . c . Complement the most significant bit of an eight - bit pattern without changing the other bits . d . Put a 1 in the most ...
... bits of an eight - bit pattern without disturbing the other bits . b . Complement a pattern of eight bits . c . Complement the most significant bit of an eight - bit pattern without changing the other bits . d . Put a 1 in the most ...
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