Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 61
Page 165
... begin moving the top pointer down the list comparing the names pointed to with the pivot entry . This time , however , we keep moving the pointer as long as the name in the list is less than or equal to the pivot entry or until the two ...
... begin moving the top pointer down the list comparing the names pointed to with the pivot entry . This time , however , we keep moving the pointer as long as the name in the list is less than or equal to the pivot entry or until the two ...
Page 227
... begin J : = 1 ; end ; repeat read ( Name [ J ] ) ; J : = J + 1 ; until ( J > 8 ) or eoln ; readin begin { First , get the names from the terminal . } for J : = 1 to ListLength do begin Names [ J ] : = Blanks ; GetName ( Names [ J ] ...
... begin J : = 1 ; end ; repeat read ( Name [ J ] ) ; J : = J + 1 ; until ( J > 8 ) or eoln ; readin begin { First , get the names from the terminal . } for J : = 1 to ListLength do begin Names [ J ] : = Blanks ; GetName ( Names [ J ] ...
Page 455
... begin ; if X not 0 perform unitA ; end ; unitA : begin ; S ; if X not 0 perform unitA ; return ; Consequently , we may conclude that the modified language has all the capabilities of the origina ! re Bones . It can also be shown that ...
... begin ; if X not 0 perform unitA ; end ; unitA : begin ; S ; if X not 0 perform unitA ; return ; Consequently , we may conclude that the modified language has all the capabilities of the origina ! re Bones . It can also be shown that ...
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