C++

Dr. Jeffrey Childs holds a Bachelor’s Degree (Summa cum laude) in Computer Science from Youngstown State University, OH, and a Master’s and Ph. D. in Computer Science from Kent State University, OH.  He had conducted research in the Gaussian decomposition of images and has written and published several papers on the subject.  He has discovered the Quickstep algorithm, having a much better time complexity than the existing algorithms for Gaussian decomposition.  He has taught data structures for the past nine years.  In addition, he has researched data structures during the last three years, breaking new ground in client-based design pedagogy and memory management, as well as the design of certain data structures.  He is currently a tenured professor at Clarion University of Pennsylvania.

Chapter 1 Structs and Classes
Chapter 2 Overloaded Operators, Class Templates, and Abstraction
Chapter 3 More about Classes
Chapter 4 Pointers and Dynamic Arrays
Chapter 5 An Array Class
Chapter 6 Introduction to Object-Oriented Programming
Chapter 7 Methods for Making Data Structures
Chapter 8 Stacks and Queues
Chapter 9 Introduction to Time Complexities
Chapter 10 The Linked List as a Data Structure
Chapter 11 Hash Tables
Chapter 12 Priority Queues, Trees, and Heaps
Chapter 13 Recursion
Chapter 14 Introduction to Sorting Algorithms
Chapter 15 Other Data Structures
Appendix A How to Compile and Work with Multiple-File Programs
Index