C++: Classes and Data Structures

For sophomore- to junior-level courses in Data Structures or CS-2, offered in departments of Computer Science, CIS, IT, and Business.

 

Most data structures texts are filled with so many technical details (and lack thorough explanations) that the reading becomes difficult and the course intimidating. This accessible, conversational presentation explores data structures concepts in clear language while maintaining appropriate technical rigor – and makes the course easier to teach. A basic knowledge of C++ is assumed.

 

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.