Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 85
Page 160
... task of searching the list Alice , Bill , and Carol . Once we complete this secondary search , we will discard the second copy of the module , report its findings to the original copy , and continue progress in the original . Thus , the ...
... task of searching the list Alice , Bill , and Carol . Once we complete this secondary search , we will discard the second copy of the module , report its findings to the original copy , and continue progress in the original . Thus , the ...
Page 163
... task , and in turn allow yet another activation to continue . In this fashion all the activations that are generated ultimately termi- nate , leaving the original task completed . Let us see how the initialization and modification ...
... task , and in turn allow yet another activation to continue . In this fashion all the activations that are generated ultimately termi- nate , leaving the original task completed . Let us see how the initialization and modification ...
Page 398
... task over and over in an atmosphere where each execution of the task is exactly the same ( or at least any variations can be handled in a straightforward manner ) . The important point is that the machine performs its task in a ...
... task over and over in an atmosphere where each execution of the task is exactly the same ( or at least any variations can be handled in a straightforward manner ) . The important point is that the machine performs its task in 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