Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 73
Page 328
... section number : 26 26 form this value to a section number as before , retrieve the records in that section , and then search the retrieved records for the one in question . Distribution Problems Our simplified explanation has thus far ...
... section number : 26 26 form this value to a section number as before , retrieve the records in that section , and then search the retrieved records for the one in question . Distribution Problems Our simplified explanation has thus far ...
Page 335
... sections rather than 61 ? 17. Why might it be advantageous to keep the list of overflow records ( from a section in a hashed file ) sorted according to key field values ? 18. If we divided the storage area for a hashed file into 41 sections ...
... sections rather than 61 ? 17. Why might it be advantageous to keep the list of overflow records ( from a section in a hashed file ) sorted according to key field values ? 18. If we divided the storage area for a hashed file into 41 sections ...
Page 476
... section of bulk storage is organized as a linked list , searching through the overflow records is essentially search- ing a sequential file . 3. The section assignments are as follows : a . 0 c . 3 e . 3 g . 3 i . 3 b . 0 d . 0 f . 3 h ...
... section of bulk storage is organized as a linked list , searching through the overflow records is essentially search- ing a sequential file . 3. The section assignments are as follows : a . 0 c . 3 e . 3 g . 3 i . 3 b . 0 d . 0 f . 3 h ...
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array assign binary bit patterns block bulk storage called Carol Chapter COBOL concept contains current entry Current Pointer data control block data flow diagram database declare search deleted diagram disk employee example execution Figure FILLED-BY FORTRAN hashed head pointer hexadecimal identify implemented input insertion sort instruction integer linked list loop machine language machine's memory main memory memory cells modified module move notation operating system password perform pivot entry problem produce program counter programming languages pseudocode Questions/Exercises queue record relation represented request result retrieve routines schedule search a failure search a success search tree sequence sequential file solution solving stack statement step storage system stored string subprogram syntax tape target value task technique terminal time-sharing translator Turing machine