Data Structures I EssentialsREA’s Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Data Structures I includes scalar variables, arrays and records, elementary sorting, searching, linked lists, queues, and appendices of binary notation and subprogram parameter passing. |
Contents
INTRODUCTION | 1 |
SCALAR VARIABLES | 5 |
ARRAYS AND RECORDS | 14 |
ELEMENTARY SORTING | 23 |
SEARCHING | 33 |
LINKED LISTS | 46 |
STACKS | 68 |
QUEUES | 78 |
Other editions - View all
Common terms and phrases
abstract data type account number addressline algorithm arithmetic ArrayItemType available list available node BEGIN binary search bits BOOLEAN bubble sort call by value calling segment CHAPTER check pair column-major order computer memory decimal declared DelAfter deletion Dequeue diagram digits dimension dope vector doubly-linked list empty queue Enqueue example exchange field FORTRAN front given hash function hash number head node header node IF..ELSE IMPLEMENTING QUEUES indicates initially input InsAfter insertion INTEGER languages linear search linked list mantissa maxqueue memory location Modula-2 needed nodesupply nodesupply[p].next number of comparisons One's Complement operations overflow p^.info p^.next parameter Pascal pass POINTER IMPLEMENTATION pointer variable procedure q.front q.rear real number rear recursion row-major order scalar variables scheme space stack stackitem stored in memory straight selection sort subprogram subscript tail node tion two-dimension underlying data structure usually coded Value-Result Writeln('Void