Computer Science: An Overview |
From inside the book
Results 1-3 of 70
Page 93
Suppose a person is typing 30 words per minute at a terminal keyboard. (A word
is considered to be five characters.) If a machine executes one *26. *27. * 28.
instruction every 3 microseconds (millionths of a second), how many instructions
...
Suppose a person is typing 30 words per minute at a terminal keyboard. (A word
is considered to be five characters.) If a machine executes one *26. *27. * 28.
instruction every 3 microseconds (millionths of a second), how many instructions
...
Page 122
The trick is not to remove the competition directly by controlling the requests but
to remove it indirectly by converting nonshareable resources into shareable ones
. For example, suppose the nonshareable resource in question is a printer and a
...
The trick is not to remove the competition directly by controlling the requests but
to remove it indirectly by converting nonshareable resources into shareable ones
. For example, suppose the nonshareable resource in question is a printer and a
...
Page 266
What modules in your system must be modified because of changes in tax laws?
What if the length of the postal system's ZIP code changes? Suppose we referred
to the collection of modules that share a common data item as a module unit.
What modules in your system must be modified because of changes in tax laws?
What if the length of the postal system's ZIP code changes? Suppose we referred
to the collection of modules that share a common data item as a module unit.
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 |