Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 22
Page 159
... target value ( Bill ) must precede this current entry , we are instructed to apply the module named search to the ... ( target value = current entry ) : declare search a success . ( target value < current entry ) : search ( the portion of ...
... target value ( Bill ) must precede this current entry , we are instructed to apply the module named search to the ... ( target value = current entry ) : declare search a success . ( target value < current entry ) : search ( the portion of ...
Page 162
... target value < current entry ) : search ( the portion of the list preceding the procedure search If ( list empty ) then ( declare search a failure ) else ( target value << current entry ) : search ( the portion of the list preceding the ...
... target value < current entry ) : search ( the portion of the list preceding the procedure search If ( list empty ) then ( declare search a failure ) else ( target value << current entry ) : search ( the portion of the list preceding the ...
Page 303
... value found in the tree's root pointer assign Found the value false while ( Found is false and Current Pointer is not NIL ) do ( select the applicable case from those listed below and perform the associated activity : target value ...
... value found in the tree's root pointer assign Found the value false while ( Found is false and Current Pointer is not NIL ) do ( select the applicable case from those listed below and perform the associated activity : target value ...
Contents
Introduction | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
activities actually addition algorithm allow appear application approach assign associated begin binary block called cell Chapter characters collection communication complete consider consists contains contents database described devices discussed employee entry example execution expressed fact field Figure function given identified implemented indicated input insertion instruction involved language linked loop machine machine's major means memory memory cells module move node notation Note object obtain operating system organization original particular pattern perform pivot pointer position problem produce record refers relation represented request result retrieve routine sequence sequential single solution solving sort stack statement step storage stored string structure subprogram Suppose tape task technique terminal translator tree unit write