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 to Algorithms
- Algorithm specification, performance analysis.
- Asymptotic notations, recurrence relations.
Module 2: Divide and Conquer
- General method, binary search.
- Merge sort, quick sort.
- Strassen’s matrix multiplication.
Module 3: Greedy Method
- General method, knapsack problem.
- Job sequencing, Huffman codes.
Module 4: Dynamic Programming
- General method, multistage graphs.
- 0/1 knapsack, traveling salesman problem.
Module 5: Backtracking and Branch and Bound
- N-Queens problem, graph coloring.
- Branch and bound: LC search, FIFO.
Module 6: NP-Hard and NP-Complete Problems
- Basic concepts, Cook’s theorem.
- NP-hard graph problems.