Data Structures and Algorithms in C++

Strengthen your understanding of data structures and their algorithms for the foundation you need to successfully design, implement and maintain virtually any software system. Theoretical, yet practical, DATA STRUCUTRES AND ALGORITHMS IN C++, 4E by experienced author Adam Drosdek highlights the fundamental connection between data structures and their algorithms, giving equal weight to the practical implementation of data structures and the theoretical analysis of algorithms and their efficiency. This edition provides critical new coverage of treaps, k-d trees and k-d B-trees, generational garbage collection, and other advanced topics such as sorting methods and a new hashing technique. Abundant C++ code examples and a variety of case studies provide valuable insights into data structures implementation. DATA STRUCTURES AND ALGORITHMS IN C++ provides the balance of theory and practice to prepare readers for a variety of applications in a modern, object-oriented paradigm

Table of Contents

Ch 1 Object-Oriented Programming Using C++

Ch 2 Complexity Analysis

Ch 3 Linked Lists

Ch 4 Stacks and Queues

Ch 5 Recursion

Ch 6 Binary Trees

Ch 7 Multiway Trees

Ch 8 Graphs

Ch 9 Sorting

Ch 10 Hashing

Ch 11 Data Compression

Ch 12 Memory Management

Ch 13 String Matching

About the Author

A well respected author and dedicated instructor, Dr. Adam Drozdek serves as Associate Professor of Computer Science at Duquesne University, where he teaches courses in operating systems and computer architecture, advanced data structures and other advanced computer science courses. Dr. Drozdek has authored numerous successful books, including THE ELEMENTS OF DATA COMPRESSION. He earned his B.S. and M.A. from Wroc?aw University, his M.S. from Wright State University, and Ph.D. from Jagiellonian University.