Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 59
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 ; repeat read ( Name [ J ] ) ; J : = J + 1 ; until ( 1 > 8 ) or eoln ; readin end ; begin { First , get the names from the terminal . } for J : = I to ListLength do begin Names [ J ] : = Blanks ; GetName ( Names [ J ] ...
... begin J : = 1 ; repeat read ( Name [ J ] ) ; J : = J + 1 ; until ( 1 > 8 ) or eoln ; readin end ; begin { First , get the names from the terminal . } for J : = I to ListLength do begin Names [ J ] : = Blanks ; GetName ( Names [ J ] ...
Page 455
... begin ; MAIN : begin ; S ; if X not o perform unitA ; return ; end ; Consequently , we may conclude that the modified language has all the capabilities of the origina ! ' re ( where the dots represent other Bare Bones stateBones . ments ) ...
... begin ; MAIN : begin ; S ; if X not o perform unitA ; return ; end ; Consequently , we may conclude that the modified language has all the capabilities of the origina ! ' re ( where the dots represent other Bare Bones stateBones . ments ) ...
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