Computer Science: An Overview |
From inside the book
Results 1-3 of 84
Page 207
With this arrangement the value associated with a name can be varied as the
program executes by changing the bit pattern of the related memory location. The
data associated in this manner with the name is said to be variable, and the
name ...
With this arrangement the value associated with a name can be varied as the
program executes by changing the bit pattern of the related memory location. The
data associated in this manner with the name is said to be variable, and the
name ...
Page 217
That is, a value can be associated with the name of a function in a manner similar
to the association between a value and a variable name. The difference is that
the value associated with a function name is computed (according to the ...
That is, a value can be associated with the name of a function in a manner similar
to the association between a value and a variable name. The difference is that
the value associated with a function name is computed (according to the ...
Page 410
incr X; while X not 0 do; incr Z; end; would result in an infinite process since the
value associated with X will never be zero, ... will ultimately terminate with the
effect of transferring the value associated with X to the variable Z. Observe that
while ...
incr X; while X not 0 do; incr Z; end; would result in an infinite process since the
value associated with X will never be zero, ... will ultimately terminate with the
effect of transferring the value associated with X to the variable Z. Observe that
while ...
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 |