Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 50
Page 282
... block of consecutive memory cells . Assuming that each name is no longer than eight letters , we could divide this large block of cells into a collec- tion of subblocks , each containing eight cells . Into each subblock we could store a ...
... block of consecutive memory cells . Assuming that each name is no longer than eight letters , we could divide this large block of cells into a collec- tion of subblocks , each containing eight cells . Into each subblock we could store a ...
Page 293
... block of memory for the queue , start the queue at one end of the block , and let the queue migrate toward the other end of the block . When the tail of the queue reaches the end of the block , we merely start inserting additional ...
... block of memory for the queue , start the queue at one end of the block , and let the queue migrate toward the other end of the block . When the tail of the queue reaches the end of the block , we merely start inserting additional ...
Page 332
... block ( DCB ) or file control block , for each file being processed . Here all the information relating to the processing of a single file is kept in an organized manner and made available to the various routines in the operating system ...
... block ( DCB ) or file control block , for each file being processed . Here all the information relating to the processing of a single file is kept in an organized manner and made available to the various routines in the operating system ...
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