Design and Analysis of Algorithms
Definition: Design and Analysis of Algorithms focuses on developing efficient algorithms using various paradigms and analyzing their time and space complexity.
Available PYQs:
2015
2016
2019
2022
2023
2024
Praxian Analysis 2025
To add PYQs: Click Here
Detailed Syllabus
Module 1: Introduction
- Algorithm complexity, asymptotic notation.
- Recurrences.
Module 2: Divide and Conquer
- Merge sort, quick sort.
- Matrix multiplication.
Module 3: Greedy Algorithms
- Activity selection, knapsack.
- Huffman coding.
Module 4: Dynamic Programming
- 0/1 knapsack, LCS.
- Matrix chain multiplication.
Module 5: Graph Algorithms
- BFS, DFS, shortest paths.
- MST algorithms.
Module 6: Complexity Theory
- P, NP, NP-complete.
- Approximation algorithms.