Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 22
Page 284
... list Head pointer Name Pointer Name Pointer Name Pointer NIL merely by changing a single pointer . This is done by ... linked list is not quite as simple as our previous description implies , since one might want to keep track of those ...
... list Head pointer Name Pointer Name Pointer Name Pointer NIL merely by changing a single pointer . This is done by ... linked list is not quite as simple as our previous description implies , since one might want to keep track of those ...
Page 289
... linked structure similar to that discussed in Section 7-2 . This avoids the limitations of restricting the stack to a fixed - size block since it allows the entries in the stack to be ... linked list in reverse order 7 DATA STRUCTURES 289.
... linked structure similar to that discussed in Section 7-2 . This avoids the limitations of restricting the stack to a fixed - size block since it allows the entries in the stack to be ... linked list in reverse order 7 DATA STRUCTURES 289.
Page 310
... linked list in a computer's main memory . Each entry in the list consists of two cells : the first contains a letter of the alphabet ; the second contains a pointer to the next list entry . Alter the pointers so that the letter N is no ...
... linked list in a computer's main memory . Each entry in the list consists of two cells : the first contains a letter of the alphabet ; the second contains a pointer to the next list entry . Alter the pointers so that the letter N is no ...
Contents
Contents | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array ASCII assign binary bit patterns block bulk storage called Carol Chapter concept consider contains current entry Current Pointer data structures data types database declare search deleted devices diagram disk employee example execution Figure goal hash head pointer hexadecimal identified implemented input insertion sort instruction integer key field linked list loop machine language machine's memory main memory memory cells modified module move notation operating system parity bit password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue record represented request result retrieve routines search tree Section sequence sequential file solution solving sort algorithm stack statement step storage system stored string subprogram Tail pointer tape target value task technique terminal Turing machine two's complement