Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 87
Page 11
... called a bit ( for binary digit ) . Large numbers of these circuits are collected into the unit of the machine called the main memory . Through coding systems in which information is represented as patterns of bit values , data is ...
... called a bit ( for binary digit ) . Large numbers of these circuits are collected into the unit of the machine called the main memory . Through coding systems in which information is represented as patterns of bit values , data is ...
Page 116
... called the program's state ( or its context ) . To save the CPU's position in the current program therefore involves ... called the interrupt entry point since it is the point at which the CPU enters the software system after an ...
... called the program's state ( or its context ) . To save the CPU's position in the current program therefore involves ... called the interrupt entry point since it is the point at which the CPU enters the software system after an ...
Page 287
... called the top of the stack . The other end is sometimes called the stack's base . To reflect the fact that access to a stack is restricted to the topmost entry , we use special terminology when referring to the insertion and deletion ...
... called the top of the stack . The other end is sometimes called the stack's base . To reflect the fact that access to a stack is restricted to the topmost entry , we use special terminology when referring to the insertion and deletion ...
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