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
Contents | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array ASCII assign binary bit patterns block bulk storage called Carol Chapter concept consider contains current entry Current Pointer data structures data types database declare search deleted devices diagram disk employee example execution Figure goal hash head pointer hexadecimal identified implemented input insertion sort instruction integer key field linked list loop machine language machine's memory main memory memory cells modified module move notation operating system parity bit password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue record represented request result retrieve routines search tree Section sequence sequential file solution solving sort algorithm stack statement step storage system stored string subprogram Tail pointer tape target value task technique terminal Turing machine two's complement