Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 82
Page 198
... implemented as individual primitives . Instead , many concepts can be described in terms of other , less complex concepts just as ideas that cannot be expressed in a single word of English can be expressed by combining well ...
... implemented as individual primitives . Instead , many concepts can be described in terms of other , less complex concepts just as ideas that cannot be expressed in a single word of English can be expressed by combining well ...
Page 291
... implemented with a stack pointer . Your algorithm should print an error message if there is no entry on the stack to pop . S. Describe how a stack could be implemented in a high - level language in terms of a one - dimensional array . а ...
... implemented with a stack pointer . Your algorithm should print an error message if there is no entry on the stack to pop . S. Describe how a stack could be implemented in a high - level language in terms of a one - dimensional array . а ...
Page 305
... implemented as primitives in the basic language . These additional types are known as abstract data types . In general , an object having an abstract data type ( which we call an instance of the abstract data type ) is implemented as a ...
... implemented as primitives in the basic language . These additional types are known as abstract data types . In general , an object having an abstract data type ( which we call an instance of the abstract data type ) is implemented as a ...
Contents
Introduction | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
11 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 consider consists contains contents database described devices discussed employee entry example execution expressed fact field Figure function given identified implemented indicated input insertion instruction involved language linked loop machine machine's major means memory memory cells module move node notation Note object obtain operating system organization original particular pattern perform pivot pointer position problem produce record refers relation represented request result retrieve routine sequence sequential single solution solving sort stack statement step storage stored string structure subprogram Suppose tape task technique terminal translator tree unit write