Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 81
Page 34
... records allows the records to fit conveniently on the tracks ; for tape storage , the concern is that inter - record gaps do not dominate the tape . Thus , physical considerations play a major role in deter- mining the size of physical ...
... records allows the records to fit conveniently on the tracks ; for tape storage , the concern is that inter - record gaps do not dominate the tape . Thus , physical considerations play a major role in deter- mining the size of physical ...
Page 317
... record , called a sentinel , may be written as the last record of the file to mark the end . Of course , to avoid confusion , the fields in such a record must contain values that will never occur as data in the application . a Sorted ...
... record , called a sentinel , may be written as the last record of the file to mark the end . Of course , to avoid confusion , the fields in such a record must contain values that will never occur as data in the application . a Sorted ...
Page 321
... record ( called the current transaction record ) from the transaction file . read a record ( called the current master record ) from the old master file . while ( neither current record is the sentinel ) do ( If ( the key field of the ...
... record ( called the current transaction record ) from the transaction file . read a record ( called the current master record ) from the old master file . while ( neither current record is the sentinel ) do ( If ( the key field of the ...
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