Computer Science: An Overview |
From inside the book
Results 1-3 of 87
Page 80
Logical Operations Three popular operations within the group of logical
operations are AND, OR, and EXCLUSIVE OR. They are similar to addition and
subtraction in that each accepts two operands (or inputs) and produces a single
resuit.
Logical Operations Three popular operations within the group of logical
operations are AND, OR, and EXCLUSIVE OR. They are similar to addition and
subtraction in that each accepts two operands (or inputs) and produces a single
resuit.
Page 174
On the third morning, give the hotel the single link. On the fourth morning, retrieve
the three links held by the hotel and give the hotel the four-link piece. On the fifth
morning, give the hotel the single link. On the sixth morning, retrieve the single ...
On the third morning, give the hotel the single link. On the fourth morning, retrieve
the three links held by the hotel and give the hotel the four-link piece. On the fifth
morning, give the hotel the single link. On the sixth morning, retrieve the single ...
Page 204
A data item of type Boolean can be represented by a single bit. Examples of the
occurrence of such a data type include the result of comparisons such as “IS TAX
EQUAL TO 5?” or the use of flags as in our proposed solution to the printer ...
A data item of type Boolean can be represented by a single bit. Examples of the
occurrence of such a data type include the result of comparisons such as “IS TAX
EQUAL TO 5?” or the use of flags as in our proposed solution to the printer ...
What people are saying - Write a review
User Review - Flag as inappropriate
sa
Contents
Introduction | 5 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
activities actually addition algorithm allow appear application approach assign associated begin binary block called cell Chapter characters collection communication complete condition consider consists contains contents correct current entry database described devices discussed employee entry example execution expressed fact field Figure function given identifier implemented insertion instruction involved language linked loop machine major means memory memory cell module move node notation Note object obtained operating system original particular pattern perform pivot pointer position problem produce record refers relation represented request resource result retrieve routine sequence sequential single solution solving sort stack statement step storage stored structure subprogram success Suppose tape task technique termination tree unit write
References to this book
Bibliographic information
| Title | Computer Science: An Overview Benjamin/Cummings series in computer science Benjamin/Cummings series in structured programming Computer Science : an overview / J. Glenn Brookshear |
| Author | J. Glenn Brookshear |
| Edition | 2 |
| Publisher | Benjamin/Cummings Publishing Company, 1988 |
| Original from | the University of Michigan |
| Digitized | 17 Jan 2007 |
| ISBN | 0805309039, 9780805309034 |
| Length | 493 pages |
| Export Citation | BiBTeX EndNote RefMan |