Data Structures

Contents

1. Introduction to Data Structures
1. Introduction
1.1 Need for Data Structures
2. Pointers and Dynamic Memory Allocation
3. Algorithm
3.1 Characteristics of an Algorithm
4. Algorithm Analysis
4.1 Space Complexity
4.2 Time Complexity
4.3 Best Case, Average Case and Worst Case
4.4 Asymptotic Notations (O, W, Q)
5. Introduction to Data Structures
5.1 Definitions
5.2 Types of Data Structures
6. Introduction to Arrays and Structures
6.1 Types of Arrays – Single and Multidimensional
6.2 Array Representation
6.3 Structures
6.4 Self Referential Structure
7. Polynomial Representation using Array
7.1 Polynomial Evaluation
7.2 Addition of Polynomials
2. Linear Data Structure
1. Introduction
2. Sorting
2.1 Bubble Sort
2.2 Insertion Sort
2.3 Merge Sort
2.4 Quick Sort
2.5 Selection Sort
2.6 Comparison of Sorting Methods
3. Searching
3. Linked List
1. Introduction to Linked List
2. Implementation of Linked List
3. Types of Linked Lists
4. Operations on a Linked List
5. Operations on Singly Linked List
6. Doubly Linked List
7. Circular Singly Linked List
8. Circular Doubly Linked List
9. Generalized Linked List
4. Stack and Queue
1. Introduction
1.1 Definition
2. Implementation
2.1 Static Implementation of Stack
2.2 Dynamic Implementation of Stack
3. Applications of Stack
4. Prefix, Infix and Postfix Expressions
4.1 Converting Infix to Prefix and Postfix form
4.2 Evaluating Prefix and Postfix
5. Simulating Recursion using Stack
5.1 String Reversal
5.2 Check Palindrome
6. Concept of Queue
7. Primitive Operations on a Queue
8. Difference between Stack and Queue
9. Linear Queue
9.1 Static Implementation
9.2 Dynamic Implementation of Linear Queue
10. Circular Queue
10.1 Implementation of Circular Queue
11. Priority Queue
12. Concept of Doubly Ended Queue
5. Tree and Graph
1. Concept and Terminologies
2. Representation of Binary Trees
3. Tree Operations
3.1 Creating a Binary Search Tree
3.2 Tree Traversals
3.3 Search
3.4 Inserting into Binary Search Tree
3.5 Deletion from Binary Search Tree
3.6 Counting Total Nodes in a Tree
3.7 Counting Leaf Nodes in a Tree
4. Applications of Trees
4.1 Heap Sort
4.2 Height Balanced Trees
5. Concept and Terminologies
6. Graph Representation
6.1 Adjacency Matrix
6.2 Adjacency List
6.3 Inverse adjacency list
6.4 Adjacency Multilist
6.5 Orthogonal List
7. Degree of Graph
8. Graph Traversals
8.1 Depth First Search
8.2 Breadth First Search
9. Applications of Graphs
9.1 AOV Network – Topological Sort
9.2 AOE Network – Critical Path Method