Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 27
Page 159
... entry ) as the current entry under consideration . Since the target value ( Bill ) must precede this current entry , we are instructed to apply the module named search to the list of entries preceding David — that is , the list Alice ...
... entry ) as the current entry under consideration . Since the target value ( Bill ) must precede this current entry , we are instructed to apply the module named search to the list of entries preceding David — that is , the list Alice ...
Page 161
... 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 success . ( target value < current entry ) : search ( the ...
... 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 success . ( target value < current entry ) : search ( the ...
Page 162
... < current entry ) search ( the portion of the list preceding the List List Alice Carol ( Middle ) List a of the repetition executed as a subtask of the. Figure 4-16 ( specify the " middle " entry in the list as the current entry , and ...
... < current entry ) search ( the portion of the list preceding the List List Alice Carol ( Middle ) List a of the repetition executed as a subtask of the. Figure 4-16 ( specify the " middle " entry in the list as the current entry , and ...
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