About the book
Basic Concept , Introduction to Data Structures , Need of Data Structur , What is a Data Structure ? , Types of Data Structures , Implementation of Data Structures , , Data Structure Operations , Pointers and Dynamic Memory Allocation , Pointers , Dynamic Memory Allocation , Algorithm Analysis , Space Complexity , Time Complexity , Asymptotic Notation , Abstract Data Types (ADT) Exercise , Arrays and Structures , Arrays , What is an Array ? , Definition , Terminology , Types , Searching , Linear or Sequential Search , Binary Search , Indexed Sequential Search , Polynomials , Polynominal Representation , Evaluation of Polynomial , Polynomial Addition , Structures , Internal Representation of Structure , Self-Referential Structure Exercise , Stack and Queue , Introduction to Stack , What is a Stack ? , Stack as an Abstract Data Type , Stack Terminology , Stack Representations , Static Representation , Dynamic Representation , Operations on Stack ,, Push Operation ,, Pop Operation , Applications of Stacks , Evaluation of Expressions , Evaluation of Postfix Expression , Infix to Postfix , Introduction to Queue , What is a Queue ? , Queue as an Abstract Data Type , Queue Representation , Operations on Queue , Priority Queue , Circular Queue , Applications of Queue Exercise , Linked List , Introduction , Why Study Linked List ? , What is Linked List ? , Advantages , Disadvantages , Representation , Operations on Linked Lists , Types of Linked Lists , Singly Linked List , Inserting Nodes , Deleting Nodes , Advantages , Disadvantages , Doubly Linked List (DLL) , Creation of Doubly Linked List , Deletion of Node , Insertion of Node , Circular Linked List , Singly Circular Linked List , Doubly Circular Linked List Exercise Trees , Introduction , Properties of Trees , General Trees , Tree Terminology , How to Represent a Tree ? , Types of Trees , Binary Tree , Representation of Binary Tree , Binary Tree Transversals , Binary Search Tree (BST) , Heap , AVL / Height Balanced Tree Exercise , Graphs , Introduction , What is a Graph ? , Graph Terminology , Representation of Graphs , Adjacency Matrix , Adjacency Lists , Inverse Adjancency List , Graph Operations , Breadth First Search (BFS) , Depth First Search (DFS) , Spanning Tree Exercise Hashing , Introduction , Why is Hashing ? , Issues in Hashing , Key terms Related to Hashing , Hash Table , Hash Function , Overflow Handling Exercise Sorting , Introduction to Sorting , Bubble Sort , Insertion Sort , Selection Sort , Quick Sort , Heap Sort , Merge Sort Exercise Model Question Papers University Question Papers (Oct, 2001, April 2010)
