Design and Analysis of Algorithm (BCS503) important topics for AKTU – unit-wise
Topics are ranked by how many times AKTU asked them across 8 papers. Finish the "very likely" topics first, then the top topics of each unit.
High-probability Design and Analysis of Algorithm topics
- Algorithm Analysis Basics (Unit 1: Introduction: Algorithms and Sorting) – asked 25 times in 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026
- Comparison Based Sorting (Unit 1: Introduction: Algorithms and Sorting) – asked 18 times in 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026
- String Matching (Unit 5: Selected Topics) – asked 13 times in 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026
What to cover inside these topics
- Complexity of Algorithms (part of Algorithm Analysis Basics)
- Growth of Functions (part of Algorithm Analysis Basics)
- Performance Measurements (part of Algorithm Analysis Basics)
- Merge Sort (part of Comparison Based Sorting)
- Quick Sort (part of Comparison Based Sorting)
- Heap Sort (part of Comparison Based Sorting)
- Knuth-Morris-Pratt Algorithm (part of String Matching)
- Cyclic Rotation Matching (part of String Matching)
- Naive String Matching (part of String Matching)
Most asked Design and Analysis of Algorithm topics in each unit
- Unit 1 (Introduction: Algorithms and Sorting): Algorithm Analysis Basics – 25 times; Comparison Based Sorting – 18 times; Sorting in Linear Time – 3 times
- Unit 2 (Advanced Data Structures): Binomial Heaps – 11 times; Red-Black Trees – 8 times; B-Trees – 4 times
- Unit 3 (Divide and Conquer & Greedy Methods): Divide and Conquer – 9 times; Minimum Spanning Trees – 9 times; Greedy Methods – 8 times
- Unit 4 (Dynamic Programming, Backtracking & Branch and Bound): Backtracking – 13 times; Dynamic Programming – 10 times; Branch and Bound – 8 times
- Unit 5 (Selected Topics): String Matching – 13 times; NP-Completeness Theory – 8 times; Approximation Algorithms – 7 times