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 46
Page 101
... string of bits and then continue down the string by successively XORing each result with the next bit in the string . How is your result related to the number of 1s appearing in the string ? b . How does this problem relate to ...
... string of bits and then continue down the string by successively XORing each result with the next bit in the string . How is your result related to the number of 1s appearing in the string ? b . How does this problem relate to ...
Page 115
... string of eight bits , produces an output string of all Os if and only if the input string is 10000001 . * 39 . What would be the result of performing a one- bit right circular shift on the following bytes represented in hexadecimal ...
... string of eight bits , produces an output string of all Os if and only if the input string is 10000001 . * 39 . What would be the result of performing a one- bit right circular shift on the following bytes represented in hexadecimal ...
Page 284
... string , since this would lead to ambiguities within the parser . A grammar that does allow two distinct parse trees for one string is said to be an ambiguous grammar . Figure 6.17 The parse tree for the string x + y x z based on the ...
... string , since this would lead to ambiguities within the parser . A grammar that does allow two distinct parse trees for one string is said to be an ambiguous grammar . Figure 6.17 The parse tree for the string x + y x z based on 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