Introduction to Data Structures, Purposes of data structure
Array: Insertion, Deletion, Matrix representation of arrays, Multidimensional arrays, Pointers arrays, Record structures, Representation of records in memory; parallel arrays.
Linked List: Singly Linked Lists, Doubly Linked Lists and Circular Linked Lists. Basic Operations on Linked List (Insertion, Deletion and Traverse),
Stack: Basic Stack Operations (Push and Pop Operations), Infix, Postfix and Prefix Notation of Arithmetic Expressions, Conversions and Evaluations of Arithmetic Expressions Using Stack,
Queue: Basic Queue Operations (Insertion and Deletion), Circular Queue and Double-ended Queue, Searching – Sequential Searching, Binary Searching,
Recursion: Direct and indirect recursion, Simulation of recursion, Depth of recursion, Removal of recursion. Towers of Hanoi using recursion.
Binary Tree: Binary tree representation, Traversal of Binary Tree (Inorder, Preorder and Postorder), Application of Binary Trees. Set Representation, Counting Binary Trees,
Binary Search Tree: BST representation, Basic Operations on BS(Creation, Insertion, Deletion and Traversing),
Heap: Max and Min Heap, Operations on Heap(Insertion and Deletion), Heapsort, Priority Queue
General Tree: Representation of General Tree, Conversion Algorithm (General Tree to Binary Tree),
Balanced Tree: Basic Concepts of 2-3 Tree, 2-3-4 Tree, AA Tree and AVL Tree, B-Tree and Basic Operations on B-Tree
Graphs: Graph Representation ( Using Adjacency Matrix and Adjacency List), Basic Operations on Graph (Node/ Edge Insertion and Deletion).