Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 11
Page 159
... search begins by selecting David ( the middle entry ) as the current entry under consideration . Since the target ... declare search a failure ) else ( specify the " middle " entry in the list as the current entry , and perform one of ...
... search begins by selecting David ( the middle entry ) as the current entry under consideration . Since the target ... declare search a failure ) else ( specify the " middle " entry in the list as the current entry , and perform one of ...
Page 161
... search If ( list empty ) then ( declare search a failure ) else ( specify the " middle " entry in the list as the current entry , and perform one of the following instructions depending on which case is satisfied : ( target value ...
... search If ( list empty ) then ( declare search a failure ) else ( specify the " middle " entry in the list as the current entry , and perform one of the following instructions depending on which case is satisfied : ( target value ...
Page 162
... ( declare search a failure ) else ( specify the " middle " entry in the list as the current entry , and perform one of the following instructions depending on which case is satisfied ( target value = current entry ) : declare search a ...
... ( declare search a failure ) else ( specify the " middle " entry in the list as the current entry , and perform one of the following instructions depending on which case is satisfied ( target value = current entry ) : declare search a ...
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