Array Representation in Memory, Array Traversal, Insertion and Deletion in Arrays, Linear Search, Binary Search (Iterative and Recursive), Bubble Sort, Selection Sort, Insertion Sort, Comparison of Sorting Algorithms, Problem Solving using Arrays

Introduction to Linked Lists, Singly Linked List, Doubly Linked List, Circular Linked List, Header Linked List, Insertion in Linked List, Deletion in Linked List, Traversal of Linked List, Applications of Linked Lists

Stack Concept and Operations (Push, Pop, Peek), Stack Implementation using Array and Linked List, Applications of Stack (Expression Evaluation, Infix to Postfix), Queue Concept and Operations, Simple Queue, Circular Queue, Priority Queue, Deque (Double Ended Queue), Applications of Queue

Recursion Basics, Recursive Problem Solving, Tower of Hanoi, Tree Terminology, Types of Trees, Binary Tree Representation, Tree Traversals (Inorder, Preorder, Postorder), Binary Search Tree (Insertion, Deletion, Searching), AVL Trees and Rotations

Heaps (Min Heap and Max Heap), Heap Sort, Graph Representation (Adjacency Matrix and List), Breadth First Search (BFS), Depth First Search (DFS), Shortest Path Algorithms (Dijkstra, Floyd-Warshall), Hashing, Hash Functions, Collision Resolution Techniques