Contents 

1. Introduction to Data Structures

1. Concept 

2. Need for Data Structures  

3. Definitions   

4. Implementation of a Data Structure    

5. Types of Data Structures  

2. Algorithm Analysis

1. Introduction  

2. Characteristics of an Algorithm 

3. Performance Analysis

4. Asymptotic Notations      

Solved Example 

3. Linear Data Structures

1. Introduction  

2. Array as an Abstract Data Type  

3. Array Representation

4. Applications of Arrays    

5. Sorting 

Solved Example   

4. Linked List

1. Introduction to List

2. Linked List 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     

9. Generalized Linked list   

Solved Examples

5. Stacks

1. Introduction  

2. Definition    

3. Stack Representation

4. Applications of Stack     

5. Simulating Recursion using Stack

6. Queues  

1. Concept of a Queue  

2. Operations on a Queue     

3. Linear Queue  

4. Circular Queue

5. Priority Queue

6. Doubly Ended Queue  

7. Difference between Stack and Queue    

7. Trees   

1. Concept and Terminologies 

2. Applications of Trees     

3. Representation of Binary Trees

4. Tree Operations     

5. Heap Sort     

6. Height Balanced Trees

8. Graph   

1. Concept and Terminologies 

2. Graph Representation

3. Graph Traversals    

4. Applications of Graphs