Introduction to Data Structures:
Understand the purpose and types of data structures.
Pointers, Structures, Functions, Dynamic Memory Allocation & Recursion.
Sorting Algorithms : Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort.
Searching Algorithms: Linear Search for unsorted data, Binary Search for sorted data.
Array-Based Data Structures, Linked Lists, Matrix Operations, Dynamic Arrays, Hash Tables
Introduction to Trees:
Understand binary tree concepts and their representations.
Learn and practice binary tree traversal (preorder, inorder, postorder).
Advanced Tree Structures, Heaps
Graph Representation and Management:
Learn the fundamentals of graph representation.
Graph Traversal Algorithms:BFS , DFS .
Shortest Path Algorithms: Dijkstra’s Algorithm, Bellman-Ford Algorithm .
Minimum Spanning Tree: Prim’s Algorithm, Kruskal’s Algorithm.
Divide and Conquer, Greedy Algorithms, Dynamic Programming (DP), Backtracking