4th Semester CSE Lab Programs 1. Apply Divide and Conquer Strategy to Solve Sorting Problems Merge Sort Quick Sort 2. Apply Decrease and Conquer Strategy to Solve Graph Problems Breadth-First Search (BFS) Topological Sorting using Depth-First Search (DFS) 3. Apply Transform and Conquer Strategy Heap Sort Checking Element Uniqueness after Presorting 4. Apply Input Enhancement Strategy to Solve String-Matching Problems Horspool’s Algorithm Boyer–Moore Algorithm 5. Apply Dynamic Programming Strategy to Solve Optimization Problems Warshall-Floyd Algorithms (All-Pairs Shortest Path) Knapsack Problem Solution using Memory Function Fractional Knapsack 6. Apply Greedy Strategy to Solve Graph Problems Dijkstra’s Algorithm (Single-Source Shortest Path) Prim’s Algorithm (Minimum Spanning Tree) 7. Apply Backtracking Strategy to Solve Combinatorial Problems N-Queens Problem Subset-Sum Problem 8. Apply Branch and Bound Strategy to Solve Combinatorial Problems Travelling Salesperson Problem (TSP) Assignment Problem