Design and Analysis of Algorithm (BCS503) important questions and topics for AKTU
These are ranked by how often AKTU repeats them across 8 papers. Repeated questions and "very likely" topics are the safest marks in the exam.
Most repeated Design and Analysis of Algorithm questions
- Explain Dijkstra's Algorithm. Prove that it may fail if the graph contains negative edge weights. (7 marks, 2026, Single Source Shortest Paths) – also asked in 2025, 2024, 2023, 2022, 2021, 2020, 2019
- Explain Merge Sort with example and also compute time complexity. (7 marks, 2026, Comparison Based Sorting) – also asked in 2025, 2024, 2023, 2022, 2021, 2020, 2019
- Solve a 0/1 Knapsack problem with given profits [60, 100, 120, 90, 75, 45], weights [5, 10, 15, 20, 35, 40] and capacity = 50 using Dynamic Programming. (7 marks, 2026, Dynamic Programming) – also asked in 2025, 2024, 2023, 2022, 2021, 2020, 2019
- Explain Kruskal's algorithm for MST and also discuss time complexity. (7 marks, 2026, Minimum Spanning Trees) – also asked in 2025, 2024, 2023, 2022, 2021, 2020, 2019
- Explain the Branch and Bound approach for the Travelling Salesman Problem (TSP) using the Reduced Cost Matrix method. (7 marks, 2026, Branch and Bound) – also asked in 2025, 2024, 2023, 2022, 2021, 2020, 2019
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