• Basics of data structures and algorithms
• Complexity analysis (time and space)
• Role of C++ in data structures

• 1D and 2D arrays
• Operations (insertion, deletion, searching, sorting)
• Strings and string manipulation

• Recursion

  • Basics and types of recursion
  • Recursive algorithms (e.g., factorial, Fibonacci, tower of Hanoi)

• Searching Algorithms

  • Linear search and binary search
  • Interpolation and exponential search

• Sorting Algorithms

  • Bubble, selection, and insertion sort
  • Merge sort, quicksort, and heap sort
  • Time complexity comparison

• Singly linked list (creation, insertion, deletion, traversal)
• Doubly and circular linked lists
• Applications of linked lists

• Stack implementation using arrays and linked lists
• Push, pop, and peek operations
• Applications (e.g., parentheses matching, postfix evaluation)

• Types: simple, circular, and priority queues
• Implementation using arrays and linked lists
• Applications (e.g., task scheduling)

• Binary trees (traversals: in-order, pre-order, post-order)
• Binary search tree (BST)
• AVL tree and tree balancing
• B and B+ Tree
• M-Way Tree

Heaps

• Introduction to heaps (min-heap and max-heap)
• Heap operations and applications
• Priority queues using heaps

• Representation (adjacency matrix and list)
• Graph traversal algorithms (BFS, DFS)
• Applications of graphs (e.g., shortest path, MST)

• Hashing

  • Hash tables and hash functions
  • Collision handling (chaining, open addressing)
  • Applications of hashing

• Basic concepts and problems (e.g., knapsack, LCS, Fibonacci)
• Optimization using memoization and tabulation

• Advanced Data Structures (Optional)

  • Trie, segment tree, and Fenwick tree
  • Disjoint set union (Union-Find)