Data Structures and Other Objects: A Second Course in Computer ScienceBenjamin/Cummings, 1995 - 813 pages This work sets out to provide programmers with a solid foundation in data abstraction techniques and to equip them with a variety of practical problem-solving skills. It is intended for programmers or developers making the transition from traditional paradigms to an object-oriented model. In this treatment of classic data structures, the authors demonstrate when and how to apply OO methods as a programming strategy. |
Contents
Program Design and Analysis | 1 |
Debugging a Loop | 24 |
Information Hiding with Units and Private Fields | 29 |
Copyright | |
35 other sections not shown
Common terms and phrases
2-3 search tree algorithm begin big-O big-O notation binary search tree binary tree BinaryTree boolean Chapter complete binary tree Cuckoo Clock data structure data type Delete digit dynamic array dynamic variable edge empty example expression function graph has-a hash HeadPtr heap heapsort HerePtr implementation IMPORTED ITEMS Index information hiding Init initialized input Insert integer left subtree linked list longint loop memory mergesort move NewEntry number of operations object type ordered list output parameter parentheses pitching machine pointer Postcondition Precondition has failed Print priority queue private data field private fields procedure call pseudocode PtrType quicksort random number record recursive call responsibility-driven design rocket engine root Self-Test Exercises shown in Figure simulation sorted sorting algorithm stack step stored string Target throttle Turbo Pascal type declaration type Entry unit value returned vertex vertices virtual method word write writeln('ERROR WriteVertical