Chapter – 1 
Introduction
1.1 Meaning of Data
1.2 Data Item
1.3 Elementary Items
1.4 Meaning of Data Structure
1.5 Linear and Non-Linear Data Structure
1.6 Meaning of Algorithm in Data Structure
1.7 Algorithm Development

Chapter – 2 
Array
2.1 Definition
2.2 Representation of Array
2.3 Types of arrays
2.4 What is traversal operation in array?
2.5 Insert Operation
2.6 Delete Operation
2.7 Sorting (Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort)
2.8 Searching (Linear Search, Binary Search)

Chapter – 3
Stack
3.1 Definition and Concepts
3.2 Definition of Stack
3.3 Representation of Stack – Static
3.4 Operations of Stack
3.5 Applications of Stack
3.6 Polish Notation or Evaluation of Postfix expression
3.7 Recursion using Stack

Chapter – 4 
Queues
4.1 Introduction
4.2 Definition
4.3 Implementation / Static Representation of Queue
4.4 Operations Performed on Queue
4.5 Circular Queue
4.6 De-queue and Priority Queue
4.7 Applications of queues

Chapter – 5 
Linked List
5.1 Introduction
5.2 Representation of Linked List
5.3 Operations of Linked Lists
5.4 Types of linked lists
5.5 Singly Linked List
5.6 Doubly Linked List
5.7 Circular Linked List
5.8 Circular Doubly Linked List

Chapter – 6 
Trees and Graphs
6.1 Introduction to Tree
6.2 Binary Tree
6.3 Representing binary trees in memory
6.4 Traversing binary trees
6.5 Threaded Binary Tree
6.6 Graph : Types, representation in memory
6.7 Graph : Types in Memory
6.8 Graph : Representation in Memory