xii, 876p., Figs., Tables, Gloss, Bib, Index, 25 cm.
CONTENTS:- 1. Programming Principals, Styles and Guidelines. 2. Phases of Software Engineering. 3. Arrays. 4. Multidimensional Arrays and Sparse matrices in data Structure. 5. Stacks and recursion. 6. Sophisticated Examples of Recursion. 7. Queues. 8. Problems and Expression on Polish Notation. 9. Linked List. 10. Tree Structures and Its Types. 11. Variations on Tree Structures. 12. Graphs and networks. 13. Sorting. 14. Search Strategies. 15. Data Structures and data management.
Data Structure provides a practical introduction to data structures and algorithms from the viewpoint of abstract thinking and problem solving, as well as the use of C++ .The most unique aspect of this text is the clear separation of the interface and implementation. C++ allows the programmer to write the interface and implementation separately, to place them in separate files and compile separately, and to hide the implementation details. This separation of interface and implementation is known, forcing the reader to think about the various data structures (eg., hash tables are written well before the hash stable id implemented). This book is a complete text book for data structure course in undergraduate and advanced studies.