Print This Page
Data Structures through C++
Authors:   G. Dileep Kumar, Manoj Kumar Singh

ISBN: 978-81-8487-488-4 
Publication Year:   2015
Pages:   228
Binding:   Paper Back


About the book

DATA STRUCTURES THROUGH C++ discusses concepts with implementations in a way that is easy use for both undergraduate and postgraduate students. The contents help the students design and implement data structures in C++, analyze various data structures in terms of space and time requirements, how to decide between set of data structures for specific use, and test and improve the implementation of each data structure. This book covers the necessary basics required by the reader to learn data structures in Part I. The text guides the students through the development of Abstract Data Types (ADTs) such as stacks, queues, binary search trees, AVL trees, Red-Black trees, splay trees, searching techniques, dictionaries and skip lists, pattern matching algorithms and tries using templates in Part II.


Key Features

  • Set of real time examples and hands on exercises Objective questions at the end of each chapter Ready-to-use real code for many of the data structures that are being discussed



Table of content

Preface / Acknowledgements / C++ CONCEPTS: Basic C++ Concepts / Overloading / Inheritance / Polymorphism / Exception Handling / Generic Programming / DATA STRUCTURES: Algorithms and Performance Analysis / Basic Data Structures / Priority Queues and Heaps / Sorting / Search Trees-I / Search Trees-II / Dictionaries and Skip Lists / Hashing / Pattern Matching and Tries.




Audience
Undergraduate and Postgraduate Students, Teachers and Researchers