Design and Analysis of Algorithm (BCS503) AKTU PYQ analysis – unit-wise weightage
We analysed 187 questions from 8 AKTU Design and Analysis of Algorithm papers (2019–2026). Here is how marks are spread across units and which topics keep coming back.
Design and Analysis of Algorithm unit-wise weightage
- Unit 1: Introduction: Algorithms and Sorting – 32% of questions, about 32 marks per paper
- Unit 2: Advanced Data Structures – 27% of questions, about 27 marks per paper
- Unit 3: Divide and Conquer & Greedy Methods – 28% of questions, about 28 marks per paper
- Unit 4: Dynamic Programming, Backtracking & Branch and Bound – 29% of questions, about 29 marks per paper
- Unit 5: Selected Topics – 29% of questions, about 29 marks per paper
Most repeated Design and Analysis of Algorithm topics in AKTU PYQs
- Algorithm Analysis Basics
- Comparison Based Sorting
- Backtracking
- String Matching
- Binomial Heaps
Unit 1 (Introduction: Algorithms and Sorting) – top topics
- Algorithm Analysis Basics – asked 25 times, last in 2026
- Comparison Based Sorting – asked 18 times, last in 2026
- Sorting in Linear Time – asked 3 times, last in 2024
Unit 2 (Advanced Data Structures) – top topics
- Binomial Heaps – asked 11 times, last in 2025
- Red-Black Trees – asked 8 times, last in 2026
- B-Trees – asked 4 times, last in 2024
Unit 3 (Divide and Conquer & Greedy Methods) – top topics
- Divide and Conquer – asked 9 times, last in 2026
- Minimum Spanning Trees – asked 9 times, last in 2026
- Greedy Methods – asked 8 times, last in 2025
Unit 4 (Dynamic Programming, Backtracking & Branch and Bound) – top topics
- Backtracking – asked 13 times, last in 2025
- Dynamic Programming – asked 10 times, last in 2026
- Branch and Bound – asked 8 times, last in 2026
Unit 5 (Selected Topics) – top topics
- String Matching – asked 13 times, last in 2026
- NP-Completeness Theory – asked 8 times, last in 2026
- Approximation Algorithms – asked 7 times, last in 2025