Syllabus PDF
Download the complete DAA syllabus.
Available Units of Design and Analysis of Algorithms (DAA)
Important Complexities
Essential time and space complexities.
Duration: 30 Min
Unit 1
Algorithm basics, complexity analysis, recursion, and problem-solving strategies.
Duration: 1 Hour
Unit 2
Divide and conquer, greedy algorithms, and dynamic programming.
Duration: 1.5 Hours
Unit 3
Dynamic programming, greedy algorithms, and optimal substructure.
Duration: 1 Hour
Unit 4
Dynamic programming, graph algorithms, spanning trees, shortest paths, and flow networks.
Duration: 1 Hour
Unit 5
Backtracking, branch-and-bound, knapsack, traveling salesman, and bin-packing problems.
Duration: 1.5 Hour
Unit 6
Number theory, modular arithmetic, GCD, and complexity classes (P, NP, NP-hard, NP-complete).
Duration: 1 Hour
Mid-Term Exam
In this Section you practice like mid-term exam.
Duration: 90 min