Principles of Data Structures Using C and C++
About the Book: Principles of DATA STRUCTURES using C and C++ covers all the fundamental topics to give a better understanding about the subject. The study of data structures is essential to every one who comes across with computer science. This book is written in accordance with the revised syllabu...
Uložené v:
| Hlavný autor: | |
|---|---|
| Médium: | E-kniha |
| Jazyk: | English |
| Vydavateľské údaje: |
Daryaganj
New Age International Ltd
2006
|
| Vydanie: | 1 |
| Predmet: | |
| ISBN: | 8122418589, 9788122418583 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Obsah:
- Cover -- Preface -- Acknowledgement -- Contents -- Chapter 1 Programming Methodologies -- 1.1 An Introduction to data Structure -- 1.2 Algorithm -- 1.3 Stepwise Refinement Techniques -- 1.4 Modular Programming -- 1.5 Top-Down Algorithm Design -- 1.6 Bottom-Up Algorithm Design -- 1.7 Structured Programming -- 1.8 Analysis of Algorithm -- 1.9 Time-Space Trade off -- 1.10 Big "OH" Notation -- 1.11 Limitation of Big "OH" Notation -- 1.12 Classification of Data Structure -- 1.13. Arrays -- 1.14. Vectors -- 1.15. Lists -- 1.16. Files and Records -- 1.17 Characteristics of Strings -- Self Review Questions -- Chapter 2 Memory Management -- 2.1 Memory Allocation in C -- 2.2 Dynamic Memory Allocation in C++ -- 2.3 Free Storage List -- 2.4 Garbage Collection -- 2.5 Dangling Reference -- 2.6 Reference Counters -- 2.7 Storage Compaction -- 2.8 Boundary Tag Method -- Self Review Questions -- Chapter 3 The Stack -- 3.1 Operations Performed on Stack -- 3.2 Stack Implementation -- 3.3 Stack Using Arrays -- 3.4 Applications of Stacks -- 3.5 Converting Infix to Postfix Expression -- 3.6 Evaluating Postfix Expression -- Self Review Questions -- Chapter 4 The Queues -- 4.1 Algorithm for Queue Operations -- 4.2 Other Queues -- 4.3 Circular Queue -- 4.4. Deques -- 4.5 Applications of Queue -- Self Review Questions -- Chapter 5 Linked List -- 5.1. Linked Lists -- 5.2. Representation of Linked List -- 5.3 Advantages and Disadvantages -- 5.4 Operation on Linked List -- 5.5 Types of Linked List -- 5.6 Singly Linked List -- 5.7 Stack Using Linked List -- 5.8 Queue Using Linked List -- 5.9 Queue Using Two Stacks -- 5.10 Polynomials Using Linked List -- 5.11 Doubly Linked List -- 5.12 Circular Linked List -- 5.13 Priority Queues -- Self Review Questions -- Chapter 6 Sorting Techniques -- 6.1 Complexity of Sorting Algorithms -- 6.2 Bubble Sort -- 6.3 Selection Sort
- 6.4 Insertion Sort -- 6.5 Shell Sort -- 6.6 Quick Sort -- 6.7 Merge Sort -- 6.8 Radix Sort -- 6.9. Heap -- 6.10 External Sort -- Self Review Questions -- Chapter 7 Searching and Hashing -- 7.1 Linear or Sequential Searching -- 7.2 Binary Search -- 7.3 Interpolation Search -- 7.4 Fibonacci Search -- 7.5. Hashing -- Self Review Questions -- Chapter 8 The Trees -- 8.1 Basic Terminologies -- 8.2 Binary Trees -- 8.3 Binary Tree Representation -- 8.4 Operations on Binary Tree -- 8.5 Traversing Binary Trees Recursively -- 8.6 Traversing Binary Tree Non-Recursively -- 8.7 Binary Search Trees -- 8.8 Threaded Binary Tree -- 8.9 Expression Tree -- 8.10 Decision Tree -- 8.11 Fibanocci Tree -- 8.12 Selection Trees -- 8.13 Balanced Binary Trees -- 8.14 AVL Trees -- 8.15 M-Way Search Trees -- 8.16. 2-3 Trees -- 8.17. 2-3-4 Trees -- 8.18. Red-Black Tree -- 8.19. B-Tree -- 8.20 Splay Trees -- 8.21 Digital Search Trees -- 8.21. Tries -- Self Review Questions -- Chapter 9 Graphs -- 9.1 Basic Terminologies -- 9.2 Representation of Graph -- 9.3 Operations on Graph -- 9.4 Breadth First Search -- 9.5 Depth First Search -- 9.6 Minimum Spanning Tree -- 9.7 Shortest Path -- Self Review Questions -- Bibliography -- Index