Data Structures and Algorithms in C++ / Edition 4

by Adam Drozdek

Overview

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.

Product Details

ISBN-13:	2901133608423
Publisher:	Cengage Learning
Publication date:	08/27/2012
Edition description:	New Edition
Pages:	784
Product dimensions:	7.60(w) x 9.20(h) x 1.40(d)

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.

Table of Contents

1. Object-Oriented Programming Using C++. 2. Complexity Analysis. 3. Linked Lists. 4. Stacks and Queues. 5. Recursion. 6. Binary Trees. 7. Multiway Trees. 8. Graphs. 9. Sorting. 10. Hashing. 11. Data Compression. 12. Memory Management. 13. String Matching. Appendix A: Computing BIG-O. Appendix B: Algorithms in the Standard Template Library. Appendix C: NP-Completeness.