Contents 

1. Basic Concept and Introduction to Data Structure  

1. Pointers- An Introduction

2. Dynamic Memory Allocation

3. Algorithm Definition and Characteristics

4. Algorithm Analysis

5. Introduction to Data Structure

6. Abstract Data Type (ADT)

7. Introduction to Array

8. Polynomial

9. Structure

2. Searching and Sorting Techniques

1. Introduction

2. Linear Search

3. Binary Search

4. Sorting

5. Bubble Sort

6. Insertion Sort

7. Selection Sort

8. Quick Sort

9. Heap Sort

10. Merge Sort

11. Comparison of Sorting Methods

Solved Examples

3. Linked List   

1. Introduction

2. Concept of Linked Organization

3. Implementation of Linked List

4. Types of Linked Lists

5. Operations on a Singly Linked List

6. Doubly Linked List

7. Circular Linked List

4. Stack and Queue     

1. Introduction

2. Definition of a Stack

3. Primitive Operations on Stack

4. Implementation of a stack

5. Applications of Stack

6. Introduction Queue

7. Definition of a Queue

8. Operations on a Queue

9. Implementation of Queues

10. Types of Queues

11. Priority Queue

12. Doubly-Ended Queue (DEQUE)

13. Applications of Queues

Solved Examples

5. Trees   

1. Introduction

2. Tree Terminology

3. Binary Trees

4. Representation of Binary Trees

5. Operations on Binary Tree

6. Traversing a Binary Tree

7. Binary Search

8. AVL Trees

6. Graphs  

1. Graphs

2. Shortest Path Problem

3. Spanning Tree

4. Traversal of Graphs

5. Applications of Graphs