Data Structure-I

Contents

1. Introduction to Data Structures and Algorithm Analysis
1. Introduction
2. Need for Data Structures
3. Definitions
4. Types of Data Structures
5. Algorithm Analysis
5.1 Space Complexity
5.2 Time Complexity
5.3 Best Case, Average Case and Worst Case
5.4 Asymptotic Notations (O, W, Q)
2. Array as a Data Structure
1. Introduction
2. Applications of Arrays
2.1 Sequential Search
2.2 Binary Search
3. Introduction to Algorithm Design Strategies
3.1 Divide and Conquer strategy
4. Sorting
4.1 Bubble Sort
4.2 Insertion Sort
4.3 Selection Sort
4.4 Merge Sort
4.5 Quick Sort
4.6 Counting Sort
4.7 Radix Sort
5. Comparison of Sorting Methods
3. Linked List
1. List as a Data Structure
2. Static and Dynamic Implementation of Linked List
2.1 Static Implementation
2.2 Dynamic Implementation
3. Types of Linked Lists
4. Operations on a Linked List
5. Singly Linked List
6. Doubly Linked List
7. Circular List
8. Applications of Linked List
8.1 Polynomial Representation (Single variable)
8.2 Addition of Two Polynomials
9. Generalized Linked List
9.1 Application of a Generalized linked list: Multi-variable Polynomial Representation
4. Stack
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
5. Queue
1. Concept of Queue
2. Primitive Operations on a Queue
3. Types of Queues
4. Difference between Stack and Queue
5. Linear Queue
5.1 Static Implementation
5.2 Dynamic Implementation of Linear Queue
6. Circular Queue
6.1 Implementation of Circular Queue
7. Priority Queue
8. Concept of Doubly Ended Queue