Includes glossary and index.

Contents: Software engineering principles: Software design process -- Verification of software correctness -- Data design and implementation: Abstraction and built-in types -- Higher level abstraction and the C++ class type -- ADTs unsorted list: Abstract data type unsorted list -- Abstract data type sorted list comparison of algorithms -- Comparison of unsorted and sorted list ADT algorithms -- Class constructors, destructors, and overloading operators -- ADTs stack and queue -- More about generics: C++ templates -- Pointer types -- Dynamically allocated arrays -- Linked structures: Implementing a stack as a linked structure -- Implementing a queue as a linked structure -- Implementing the sorted list as a linked structure -- Implementing the sorted list as a linked structure -- Lists plus: Circular linked list -- Doubly linked lists -- Linked lists with headers and trailers copy structures -- A Specialized list ADT -- A Linked list as an array of records -- Object-oriented design: Composition and inheritance -- Programming with recursion -- Binary search tree -- Trees plus: Binary expression trees -- A nonlinked representation of binary trees -- ADT priority queue -- Graphs -- Sorting and searching algorithms: Sorting -- Searching -- Radix sort -- Appendix A: A Reserved words -- Appendix B: Operator procedence -- Appendix C: Description of selected operators -- Appendix D: C++ library routines and constants -- Appendix E: The character sets.