Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 11
Page 295
... Current Pointer the value in the list's head pointer while ( Current Pointer not NIL ) do ( if ( the name pointed to by Current Pointer represents an undergraduate ) then ( print the name ) else ( insert that name in the queue called ...
... Current Pointer the value in the list's head pointer while ( Current Pointer not NIL ) do ( if ( the name pointed to by Current Pointer represents an undergraduate ) then ( print the name ) else ( insert that name in the queue called ...
Page 303
... Current Pointer still being the same as the root pointer after the search Figure 7-26 A subprogram for inserting an entry in a linked search tree *** Current Pointer is used to hold a pointer to the current position in the tree . The ...
... Current Pointer still being the same as the root pointer after the search Figure 7-26 A subprogram for inserting an entry in a linked search tree *** Current Pointer is used to hold a pointer to the current position in the tree . The ...
Page 470
... Current Pointer the value in the head pointer while ( Current Pointer not NIL and Finished false ) do = ( print the entry pointed to by Current Pointer , if ( the name just printed Last ) then ( assign Finished the value true ) assign ...
... Current Pointer the value in the head pointer while ( Current Pointer not NIL and Finished false ) do = ( print the entry pointed to by Current Pointer , if ( the name just printed Last ) then ( assign Finished the value true ) assign ...
Contents
PART | 1 |
Chapter 2 | 61 |
PART TWO The HumanMachine Interface | 95 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
activities actually algorithm Alice allow application application software ASCII assign bit patterns block bottom pointer bulk storage called Carol Chapter COBOL computer science concept consider consists contains current entry database declare search disk employee example execution Figure goal hexadecimal identified implemented input insertion sort instruction integer key field linked list machine language machine's main memory memory cells modified module move node notation operating system parity bit password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue quick sort record recursive represented request resource result retrieve routine schedule search a failure search a success search tree Section segment sequence sequential file solution solving sort algorithm stack statement step stored string subprogram syntax tape target value task technique time-sharing top pointer Turing machine two's complement