Home › AKTU PYQ › Programming for Problem Solving › Exam Strategy

Programming for Problem Solving (BCS101) AKTU exam strategy

Focus on Unit 1 (Introduction to Computer System and C Basics) and Unit 3 (Loops Arrays Strings and Structures). Together they account for about 60 marks among all questions printed per paper. Unit 4 (Functions and Searching Sorting Algorithms) is safest to skim if you're short on time.

Unit priority

  • Unit 1 (Introduction to Computer System and C Basics) – Must Prepare, 31 marks avg. Unit 1 (Introduction to Computer System and C Basics) averages 31 marks per paper — one of the heaviest units in this subject. Components of Computer System and Algorithm Representation have appeared in every paper analysed — these are must-dos. Must-do: Data Types Variables Storage, Components of Computer System, Algorithm Representation, Language Processors.
  • Unit 3 (Loops Arrays Strings and Structures) – High Priority, 29 marks avg. Unit 3 (Loops Arrays Strings and Structures) averages 29 marks per paper — one of the heaviest units in this subject. Arrays has appeared in every paper analysed — these are must-dos. Must-do: Iteration and Loops, Arrays, Structure Union Enumerated Types.
  • Unit 5 (Pointers File Handling and Preprocessors) – High Priority, 28 marks avg. Unit 5 (Pointers File Handling and Preprocessors) averages 28 marks per paper — one of the heaviest units in this subject. Must-do: Pointers, File Handling, C Preprocessors and Macros.
  • Unit 2 (Operators Expressions and Conditional Branching) – Medium Priority, 25 marks avg. Unit 2 (Operators Expressions and Conditional Branching) averages 25 marks per paper — one of the heaviest units in this subject. Must-do: Operators and Expressions, Conditional Branching, Type Conversion Mixed Operands.
  • Unit 4 (Functions and Searching Sorting Algorithms) – Safe to Skim, 24 marks avg. Unit 4 (Functions and Searching Sorting Algorithms) averages 24 marks per paper — one of the heaviest units in this subject. Must-do: Functions, Sorting Algorithms, Searching Algorithms.

Topics AKTU keeps repeating

  • Operators and Expressions: Asked in 8 out of 12 papers. If you prepare only one topic from its unit, make it this one.
  • Conditional Branching: Asked in 8 out of 12 papers. If you prepare only one topic from its unit, make it this one.

Short on time?

  • Among all units, Unit 4 (Functions and Searching Sorting Algorithms) is the lowest priority at 24M avg. If you're running low on time, prioritize the top 3 units and give this one a quick read. But even here — Functions, Sorting Algorithms, Searching Algorithms 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 to Computer System and C Basics) 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 12 past papers — the patterns here are highly reliable.