Home › AKTU PYQ › Design and Analysis of Algorithm › Exam Strategy

Design and Analysis of Algorithm (BCS503) AKTU exam strategy

Focus on Unit 1 (Introduction: Algorithms and Sorting) and Unit 4 (Dynamic Programming, Backtracking & Branch and Bound). Together they account for about 61 marks among all questions printed per paper. Unit 2 (Advanced Data Structures) is safest to skim if you're short on time.

Unit priority

  • Unit 1 (Introduction: Algorithms and Sorting) – Must Prepare, 32 marks avg. Unit 1 (Introduction: Algorithms and Sorting) averages 32 marks per paper — one of the heaviest units in this subject. Algorithm Analysis Basics and Comparison Based Sorting have appeared in every paper analysed — these are must-dos. Must-do: Algorithm Analysis Basics, Comparison Based Sorting.
  • Unit 4 (Dynamic Programming, Backtracking & Branch and Bound) – High Priority, 29 marks avg. Unit 4 (Dynamic Programming, Backtracking & Branch and Bound) averages 29 marks per paper — one of the heaviest units in this subject. Must-do: Backtracking, Dynamic Programming, Branch and Bound, All Pair Shortest Paths.
  • Unit 5 (Selected Topics) – High Priority, 29 marks avg. Unit 5 (Selected Topics) averages 29 marks per paper — one of the heaviest units in this subject. String Matching has appeared in every paper analysed — these are must-dos. Must-do: String Matching, NP-Completeness Theory, Approximation Algorithms, Randomized Algorithms.
  • Unit 3 (Divide and Conquer & Greedy Methods) – Medium Priority, 28 marks avg. Unit 3 (Divide and Conquer & Greedy Methods) averages 28 marks per paper — one of the heaviest units in this subject. Minimum Spanning Trees has appeared in every paper analysed — these are must-dos. Must-do: Divide and Conquer, Minimum Spanning Trees, Single Source Shortest Paths, Greedy Methods.
  • Unit 2 (Advanced Data Structures) – Safe to Skim, 27 marks avg. Unit 2 (Advanced Data Structures) averages 27 marks per paper — one of the heaviest units in this subject. Must-do: Binomial Heaps, Red-Black Trees, Fibonacci Heaps, Skip List.

Topics AKTU keeps repeating

  • Algorithm Analysis Basics: Asked in 8 out of 8 papers. If you prepare only one topic from its unit, make it this one.
  • Comparison Based Sorting: Asked in 8 out of 8 papers. If you prepare only one topic from its unit, make it this one.

Short on time?

  • Among all units, Unit 2 (Advanced Data Structures) is the lowest priority at 27M avg. If you're running low on time, prioritize the top 3 units and give this one a quick read. But even here — Red-Black Trees, Binomial Heaps, B-Trees are high-repeat topics. Cover these at minimum to stay safe.

How the paper is marked

  • Section A: 7 questions × 2 marks = 14 marks. Short definition/concept questions from all 5 units. Prepare 2–3 key definitions per unit — this section is the easiest 14 marks you can secure.
  • Section B: Attempt any 3 of 5 questions × 7 marks = 21 marks. Choose the 3 questions from units you've prepared most. Don't attempt all 5 — pick your strongest 3 and write them well.
  • Section C: 5 OR-pairs × 7 marks = 35 marks. One pair per unit — you must attempt all 5. This is where the exam is won or lost. Focus your deep preparation on the top 3 priority units.

Exam-day tips

  • Start with Section A to build momentum — budget 15–20 minutes max for all 7 questions.
  • In Section B, Unit 1 (Introduction: Algorithms and Sorting) questions have the highest repeat rate — always attempt that one first.
  • For Section C OR-pairs, read both options before choosing — sometimes the 'b' option is simpler despite appearing longer.
  • If you've prepared the VERY LIKELY topics, you can comfortably score 50+ marks without touching any new topic on exam day.
  • This strategy is built on 8 past papers — the patterns here are highly reliable.