Design and Analysis of Algorithm (BCS503) AKTU predicted paper 2026-27
AI-predicted paper for Design and Analysis of Algorithm based on 8 past papers (2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026). NOT an official AKTU paper. Use as a revision tool only.
Paper pattern
- Section A: Attempt all questions. (14 marks)
- Section B: Attempt any THREE questions out of five. (21 marks)
- Section C: Attempt ONE question from each pair (a or b). (35 marks)
Why these questions
- Unit 1 (Introduction: Algorithms and Sorting) dominates — 22% avg weightage
- Asked every year: Algorithm Analysis Basics, Comparison Based Sorting
- Due for comeback: Sorting in Linear Time, B-Trees
- Low priority (never asked): Algebraic Computation
- Most repeated topic: Algorithm Analysis Basics
Section A – 2-mark questions
- Define algorithm and its characteristics.
- List the properties of Binomial Heap
- With a suitable example explain the concept of Convex –Hull Problem
- Define the term "Graph Coloring".
- Explain NP-complete and NP-Hard.
- Explain and compare best and worst time complexity of Quick Sort.
- With a suitable example explain “Branch and Bound”.
Section B – sample questions
- Compare the various programming paradigms such as divide-and-conquer, dynamic programming and greedy approach.
- Explain P, NP, NP –Complete and NP-Hard complexity classes. How they are related to each other.
- Illustrate the N-queens problem? Draw “State Space Tree” for 4 queen’s problem using backtracking.