CSS Prepare

compulsory · CSS study notes

7. Logical Problem Solving — Structure and Approach

CSS GSA — Paper 7, Part-II, Section VII, Sub-topic 7 (Logical Problem Solving — Structure and Approach)

Past Paper Weightage

  • This is a meta-strategy page (how to approach ANY logical reasoning question), not a separate question type — apply it across sub-topics 1–4.

Structure of a Logical Reasoning Question

  • Every logical reasoning question has three parts: (1) Premises/given statements — the facts you must accept as true; (2) The question stem — what you're actually being asked to find (a valid conclusion, an assumption, the next item, a decoded value); (3) Answer options — usually including at least one "looks right but isn't" distractor built from a common reasoning error.
  • Recognizing which of the four sub-topic types (syllogism, deduction/induction, series/coding, blood-relation/direction) a question belongs to is the first and most time-saving step, since each type has its own dedicated shortcut (see sub-topics 1–4).

General Strategies

  1. Read the question stem BEFORE re-reading the premises carefully — knowing exactly what's being asked (a conclusion? an assumption? the next term?) tells you what to look for as you parse the premises, instead of absorbing everything and re-reading twice.
  2. Externalize the problem — draw a Venn diagram, a chain, a compass, or a quick table rather than holding multiple relationships in your head; this is the single biggest source of avoidable errors under time pressure.
  3. Test the answer options against your own derivation, not the reverse — solve the problem first with your own working, then match it to an option, rather than plugging each option in one by one (which is slower and more error-prone for logic-type questions, though it can be faster for coding/series types).
  4. Watch for the "sounds true" trap — CSS logical reasoning questions are graded on strict logical validity, not real-world plausibility; a valid conclusion can sound strange, and an invalid one can sound perfectly reasonable.
  5. Budget your time per question type — series/coding-decoding questions should take under 60 seconds once the pattern is spotted; syllogism/assumption questions typically need slightly longer (60–90 seconds) because they require careful reading of quantifier words ("all," "some," "no").

Suggested Step-by-Step Approach (Use on Every Question)

  1. Read the question stem first.
  2. Identify which sub-type this is (syllogism / deduction-induction / series-coding / blood-relation-direction).
  3. Jump to that sub-type's shortcut method (see sub-topics 1–4) and apply it directly.
  4. Draw/externalize the problem rather than solving mentally.
  5. Derive your own answer BEFORE looking at the options.
  6. Match your derived answer to the closest option, and sanity-check by testing it against every given premise once more.

MCQ Traps

  • Spending equal time on every question regardless of type wastes time on quick series/coding items and starves harder syllogism items of the time they need
  • Skipping the "identify the sub-type" step and diving straight into the premises is the most common cause of slow, error-prone answers

Self-Test Questions

  1. Explain the three-part structure common to all logical reasoning questions.
  2. Why is it recommended to read the question stem before the premises, rather than after?
  3. Apply the 6-step suggested approach to a syllogism question of your choice and note how much time each step took.

Past-Paper MCQs (FPSC)

✅

The FPSC MCQ papers you shared (2024 and 2025) had no direct question on logical problem-solving method.

Past-Paper Questions with Answers (FPSC)

✅

No question asked about the method itself; it is tested by solving problems. Below are past questions that show the standard approach (understand → set up → solve → check). Answers are worked out by me.

  • Worked examples of the method
    • CSS 2019 Q7(b) (heads and legs): define unknowns h and r; set h + r = 70 and 2h + 4r = 196; solve → 42 hens, 28 rabbits; check legs 84 + 112 = 196
    • CSS 2017 Q8(B) (food for students): identify the fixed quantity (food) and set 32N = 24(N + 400) → N = 1,200
    • CSS 2019 Q8(d) (tokens): repeat the exchange until none is left: 16 + 4 + 1 = 21 free packets
    • CSS 2024 Q6(d) (digits): turn each clue into an equation → number 375

CSS Exam Perspective

🎯

  • How it is tested: through word problems that need a clear plan
  • Tip: write the plan in one line (what is unknown, what is fixed) before any arithmetic