Data structures, algorithms, and object-oriented programming /
Gregory L. Heileman.
- New York ; St.louis San francisco : McGraw-Hill, c1996.
- xii, 446 p. : ill. ; 24 cm.
- McGraw-Hill series in computer science. Fundamentals of computing and programming .
PART ONE : FUNDAMENTALS 1 Background 1.1 Abstract data types 1.2 Pueudocode 1.3 A model of computer memory Exercises Chapter notes
3 Data structure and C programs 3,1 The pre-processor 3.2 Variable and storage classes 3.3 Pointers Exercises Chapter notes etc
4 Object oriented programming and C++ 4.1 Fundamental concepts 4.2 The C++ programming and polymorphism 4.3 A extended example : Matrix ADT implementation in C++ Exercises Chapter notes
PART 11 BASIC DATA STRUCTURE 5 Lists 5.1 The list ADT 5.2 Sequential mapping 5.3 Linked lists Exercises Chapter notes
6 Stacks and Queues 6.1 The stack and queue ADTs 6.2 Stacks and expression evaluation 6.3 Stacks and recursion Exercises Chapter notes
7. Binary search trees 7.1 Definitions 7.2 Dynamic set operation 7.3 Binary search tree implementation Exercises Chapter notes