Design and Analysis of Algorithm (BCS503) AKTU syllabus – unit-wise topics
The complete Design and Analysis of Algorithm syllabus for AKTU, unit by unit. Next to each topic you can see how often it has appeared in past papers, so you know where the marks are.
Unit 1: Introduction: Algorithms and Sorting
- Algorithm Analysis Basics – asked 25 times
- Comparison Based Sorting – asked 18 times
- Sorting in Linear Time – asked 3 times
Unit 2: Advanced Data Structures
- Red-Black Trees – asked 8 times
- B-Trees – asked 4 times
- Binary Search Trees – asked 1 times
- Binomial Heaps – asked 11 times
- Fibonacci Heaps – asked 4 times
- Tries – asked 1 times
- Skip List – asked 4 times
- Persistent Data Structures – asked 1 times
Unit 3: Divide and Conquer & Greedy Methods
- Divide and Conquer – asked 9 times
- Greedy Methods – asked 8 times
- Minimum Spanning Trees – asked 9 times
- Single Source Shortest Paths – asked 8 times
Unit 4: Dynamic Programming, Backtracking & Branch and Bound
- Dynamic Programming – asked 10 times
- All Pair Shortest Paths – asked 5 times
- Backtracking – asked 13 times
- Branch and Bound – asked 8 times
Unit 5: Selected Topics
- Algebraic Computation
- Fast Fourier Transform – asked 4 times
- String Matching – asked 13 times
- NP-Completeness Theory – asked 8 times
- Approximation Algorithms – asked 7 times
- Randomized Algorithms – asked 5 times