GUEST LECTURE ON DESIGN AND ANALYSIS OF ALGORITHMS(Only for III CB and CS), KPR Institute Engineering and Technology, Autonomous Engineering Institution, Coimbatore, India

Students will learn different algorithm design paradigms, such as:

1. Divide and Conquer (e.g., Merge Sort, Quick Sort)

2. Dynamic Programming (e.g., Knapsack Problem, Longest Common Subsequence)

3. Greedy Algorithms (e.g., Prim's Algorithm, Huffman Coding)

4. Backtracking (e.g., N-Queens Problem, Sudoku Solver)

5. Branch and Bound (e.g., Traveling Salesman Problem)

6. Students will develop skills to analyze the efficiency of algorithms by understanding:

• Time Complexity (Big-O, Big-Theta, Big-Omega notations)

• Space Complexity

• Worst-case, Best-case, and Average-case performance