VII. Logical & Analytical Reasoning

CSS GSA — Paper 7, Part-II, Section VII (Logical Reasoning and Analytical Reasoning/Ability)

Sub-topics

Past Paper Weightage

• Consistently tested every year alongside Quantitative Ability in Part-II (40 marks); arrangement puzzles and syllogism/statement-conclusion questions are the most frequent formats.

Logical Reasoning

• Defined in the syllabus as: using a rational, systematic series of steps based on sound mathematical/logical procedures and given statements to reach a valid conclusion
• Common question formats:
  • Syllogisms: drawing valid conclusions from two or more premises
    • Example: "All roses are flowers. Some flowers fade quickly. Therefore, some roses fade quickly."
    • Step 1: Identify the two premises — Premise 1: All roses → flowers (roses are a subset of flowers). Premise 2: Some flowers → fade quickly (only part of the flower group fades quickly, and we don't know which part).
    • Step 2: Check whether the "fading" flowers necessarily overlap with the "rose" subset. Since Premise 2 only says some flowers fade, and doesn't specify that roses are among them, we cannot guarantee the conclusion.
    • Step 3: Conclusion — the argument is INVALID, even though it sounds plausible. This is a classic CSS trap: don't confuse "sounds true" with "logically follows."
    • Valid contrast example: "All dogs are mammals. All mammals are animals." Step 1: dogs ⊆ mammals. Step 2: mammals ⊆ animals. Step 3: by transitivity, dogs ⊆ animals. Conclusion: "All dogs are animals" is VALID.
  • Statement and Conclusion / Assumption: identifying what must logically follow, or what is implicitly assumed, from a given statement
    • Example: Statement: "The company will offer a bonus if profits exceed target." Proposed Conclusion: "If profits do not exceed target, no bonus will be offered."
    • Step 1: Restate the statement as a logical conditional: Profits > Target → Bonus.
    • Step 2: The proposed conclusion asserts the reverse-negative: NOT(Profits > Target) → NOT(Bonus). This is the logical inverse of the original conditional, which is not automatically true just because the original is true — there could be other reasons for a bonus (e.g., a discretionary award).
    • Step 3: Conclusion — the proposed conclusion does NOT necessarily follow. This assumption/inverse-conditional trap is very common in CSS papers.
  • Deductive reasoning: general principle → specific conclusion (conclusion is guaranteed true if premises are true)
    • Example: "All CSS candidates must pass the MPT. Ali is a CSS candidate."
    • Step 1: General rule: CSS candidate → must pass MPT.
    • Step 2: Specific case: Ali is a CSS candidate.
    • Step 3: Apply the rule to the case: Ali must pass the MPT. This conclusion is guaranteed, because it follows directly and necessarily from true premises — this is the hallmark of deduction.
  • Inductive reasoning: specific observations → general conclusion (conclusion is probable, not guaranteed)
    • Example: "The last five CSS GSA papers (2021–2025) each included a question on vaccines."
    • Step 1: Observe the specific pattern across five instances.
    • Step 2: Generalize: vaccines appear to be a recurring, high-frequency topic.
    • Step 3: Predict: "This year's paper will likely include a vaccines question." This is only probable, not certain — induction never guarantees its conclusion the way deduction does.
  • Series/Pattern completion: numeric, alphabetic, or figural sequences requiring identification of the underlying rule
    • Example: Find the next number: 2, 6, 12, 20, 30, ___
    • Step 1: Find the differences between consecutive terms: 6−2=4, 12−6=6, 20−12=8, 30−20=10.
    • Step 2: Notice the differences themselves form a pattern: 4, 6, 8, 10 — increasing by 2 each time (consecutive even numbers).
    • Step 3: The next difference should be 12, so the next term = 30 + 12 = 42.
    • Example (alphabetic): Find the next letter: A, C, F, J, O, ___
    • Step 1: Convert to positions: A=1, C=3, F=6, J=10, O=15.
    • Step 2: Find the gaps: 3−1=2, 6−3=3, 10−6=4, 15−10=5 — gaps increase by 1 each time.
    • Step 3: Next gap = 6, so next position = 15+6 = 21 = letter U.
  • Coding-Decoding: identifying a pattern/rule that transforms letters/numbers, then applying it
    • Example: If CAT is coded as DBU, how is DOG coded?
    • Step 1: Compare CAT → DBU letter by letter: C→D (+1), A→B (+1), T→U (+1).
    • Step 2: The rule is: shift every letter forward by 1 in the alphabet.
    • Step 3: Apply the same rule to DOG: D→E, O→P, G→H, giving EPH.
  • Blood relations, direction sense, ranking/ordering: classic logical-puzzle formats testing systematic elimination
    • Example (blood relation): Pointing to a photo, Ahmed said, "She is the daughter of my grandfather's only son." Who is the woman to Ahmed?
    • Step 1: "My grandfather's only son" — since Ahmed's grandfather has only one son, and Ahmed himself descends from that grandfather, that son must be Ahmed's own father.
    • Step 2: "Daughter of my father" = Ahmed's own sister.
    • Step 3: Answer: the woman in the photo is Ahmed's sister.
    • Example (direction): A man walks 5 km North, turns right and walks 3 km, then turns right again and walks 5 km. How far and in what direction is he from the start?
    • Step 1: Plot each leg on a mental compass: Leg 1: 5 km North. Leg 2: turning right from North means now facing East — walk 3 km East. Leg 3: turning right from East means now facing South — walk 5 km South.
    • Step 2: The Northward 5 km and the Southward 5 km cancel out exactly, leaving only the 3 km Eastward movement.
    • Step 3: Final position: 3 km East of the starting point.

Analytical Reasoning / Ability

• Defined in the syllabus as: visualizing, articulating, and solving both complex and simple problems, making sensible decisions from available information, and applying logical thinking to gather and analyze information
• Common question formats:
  • Arrangement puzzles: linear or circular seating arrangements based on given conditions
    • Example: Five friends A, B, C, D, E sit in a row. Clues: (1) B sits immediately right of A. (2) C sits at one end. (3) D sits between B and E.
    • Step 1: Place the most restrictive clue first — C is at an end. Try C at the left end: seat 1 = C.
    • Step 2: Clue 3 says D is between B and E, and Clue 1 says B is immediately right of A — so we need a block "A-B" and D sandwiched between B and E, meaning the order must run ...A-B-D-E... as a connected chain.
    • Step 3: With C fixed at seat 1, the remaining four seats (2–5) must hold A-B-D-E in that exact chained order: seat 2=A, seat 3=B, seat 4=D, seat 5=E.
    • Step 4: Verify every clue against the final arrangement C-A-B-D-E: B is right of A ✓, C is at an end ✓, D is between B and E ✓. Final answer: C-A-B-D-E.
  • Grouping/Selection puzzles: forming valid groups/committees subject to constraints
    • Example: A committee of 3 people must be chosen from 4 men and 3 women. How many valid committees can be formed if a specific man, X, must NOT be included?
    • Step 1: Since X is excluded, the selection pool shrinks from 7 people to 6 people (3 remaining men + 3 women).
    • Step 2: We need to choose any 3 people from these 6, with no further restriction — this is a straight combination: ⁶C₃.
    • Step 3: Calculate ⁶C₃ = 6! / (3! × 3!) = (6×5×4) / (3×2×1) = 120/6 = 20 valid committees.
  • Data sufficiency: determining whether given information is enough to answer a question, without necessarily solving it fully
    • Example: Question: "What is the value of x?" Statement 1: x + 5 = 12. Statement 2: x is a positive integer.
    • Step 1: Test Statement 1 alone: x + 5 = 12 → x = 7. This gives one unique value — sufficient on its own.
    • Step 2: Test Statement 2 alone: "x is a positive integer" fits infinitely many values (1, 2, 3, 4, ...) — not sufficient on its own.
    • Step 3: Conclusion: Statement 1 alone is sufficient; Statement 2 alone is not. (Note: data-sufficiency questions test whether you can find a unique answer, not what the answer actually is.)
  • Critical reasoning: strengthening/weakening an argument, identifying flaws, or finding the best inference from a passage

    • Example: Argument: "Sales of umbrellas rose sharply this month, so it must have rained more than usual." Which of the following most weakens this argument?

      (a) It rained on 10 days this month, same as last month

      (b) A major umbrella retailer ran a 50%-off promotion this month

      (c) Umbrella sales always rise in autumn

      (d) The retailer also sells raincoats

    • Step 1: The argument's logic is: rise in umbrella sales → conclusion of more rain. To weaken it, find an alternative explanation for the sales rise that has nothing to do with rainfall.

    • Step 2: Option (b) provides exactly that — a price promotion could fully explain higher sales regardless of weather, breaking the causal link the argument relies on.

    • Step 3: Answer: (b) most weakens the argument.

Exam Angle

• Draw diagrams/tables for arrangement and grouping puzzles rather than tracking conditions purely mentally — significantly reduces error rate under time pressure
• For syllogism-type questions, evaluate strictly on logical validity, not real-world plausibility — a conclusion can be logically valid even if it sounds odd, and invalid even if it sounds true

Self-Test Questions

1. Distinguish deductive reasoning from inductive reasoning with an example of each, showing your reasoning steps.
2. What is a syllogism, and what makes a syllogistic conclusion "valid" versus merely "true"? Use a worked example.
3. Explain the purpose of a data-sufficiency question type, and solve one example showing each statement tested separately.
4. Five people sit in a row; devise one clue-based arrangement puzzle and solve it step by step, showing how each clue narrows the possibilities.
5. A man walks 4 km East, turns left, walks 3 km, turns left again, walks 4 km. Find his distance and direction from the starting point, showing each leg of the journey.
6. From 5 men and 4 women, how many ways can a committee of 4 be formed with exactly 2 men and 2 women? Show the combination calculation step by step.

---

Past paper practice

• Direction-sense puzzles, jumbled-spelling questions, and coding-decoding ciphers appear almost every year in Section-B — master the step-by-step method, not just the answer

Past Paper Questions (FPSC GSA Paper 7, 2020–2024)

Each question is solved as numbered steps (write these in the exam) plus Quick Notes for fast revision — no dense single-paragraph answers.

2024 — Q6(b) [5] Jumbled Spellings

Answers:

1. UCTREUTRS → STRUCTURE
2. LOVONAC → VOLCANO
3. CIHPROSTATAC → CATASTROPHIC
4. YNTIAUMH → HUMANITY
5. NNTHORER → NORTHERN

Quick Notes:

• Method: count each letter, then find a real word using exactly that letter multiset

2024 — Q7(a) [5] Direction and Distance (cross-reference)

Note: This is a Pythagorean-triple distance question, fully worked on the VI. Quantitative Ability / Reasoning page (2024 Q7a): total distance travelled = 26 km, distance from start = 10 km.

2023 — Q7(b) [5] Jumbled Spellings

Answers:

1. LNUGEF → ENGULF
2. CKANS → SNACK
3. CIREFE → FIERCE
4. EERAANMOGTP → POMEGRANATE
5. MNIKPPU → PUMPKIN

2022 — Q6(a) [5] Direction and Distance — Morning Walk

Steps to write in exam:

1. Start at house = (0,0). Walk 110 m East → (110, 0)
2. Turn right (now facing South), walk 40 m → (110, −40)
3. Turn right (now facing West), walk 50 m → (60, −40)
4. Turn right (now facing North), walk 120 m → (60, 80)
5. Distance from house = √(60²+80²) = √10000 = 100 m

Quick Notes:

• Plot each leg on x-y coordinates, turning right each time (E→S→W→N); this is a 60-80-100 right triangle

2022 — Q7(c) [5] Jumbled Spellings

Answers:

1. THRSI → SHIRT
2. GNDREA → GARDEN
3. SCHAMOT → STOMACH
4. ONLNDO → LONDON
5. HIODALY → HOLIDAY

2022 — Q8(d) [5] Coding-Decoding — BROTHER → QDGSNQA, find SISTER

Steps to write in exam:

1. Reverse BROTHER → REHTORB
2. Shift every letter back by 1 in the alphabet: R→Q, E→D, H→G, T→S, O→N, R→Q, B→A → result = QDGSNQA (matches the given code, confirming the rule)
3. Apply the same rule to SISTER: reverse it → RETSIS
4. Shift each letter back by 1: R→Q, E→D, T→S, S→R, I→H, S→R
5. Answer: SISTER → QDSRHR

Quick Notes:

• Rule = reverse the word, then shift each letter back by 1 in the alphabet
• Tip: if a repeated letter (like R in BROTHER) gets two different codes under a simple shift, try reversing the word first

2021 — Q7(a) [5] Direction and Distance

Steps to write in exam:

1. Start = (0,0). Go 90 m East → (90, 0)
2. Turn right (South), go 20 m → (90, −20)
3. Turn right (West), go 30 m → (60, −20) — this is uncle's house
4. Go 100 m North → (60, 80)
5. Distance from start = √(60²+80²) = √10000 = 100 m

Quick Notes:

• Same coordinate-plotting method as 2022 Q6(a) — another 60-80-100 triangle

2021 — Q8(a) [5] Jumbled Spellings

Answers:

1. UORSEIS → SERIOUS
2. REGAHT → GATHER
3. TYLEAL → LATELY
4. RAMYR → MARRY
5. RYUHR → HURRY

2020 — Q7(a) [5] Weight Ordering Puzzle

Steps to write in exam:

1. Let Ehsan's weight = e
2. Pervaiz weighs double Ehsan → Pervaiz = 2e
3. Mushtaq weighs 4× Pervaiz → Mushtaq = 4×2e = 8e
4. Ehsan weighs half of Umair → Umair = 2e
5. Umair weighs half of Saleem → Saleem = 2×2e = 4e
6. Summary: Ehsan=e, Pervaiz=2e, Umair=2e, Saleem=4e, Mushtaq=8e

Answers:

• (i) Heaviest = Mushtaq (8e)
• (ii) Second heaviest = Saleem (4e)
• (iii) Lowest weight = Ehsan (e)
• (iv) Equal in weight = Pervaiz and Umair (both 2e)
• (v) Descending order = Mushtaq > Saleem > Pervaiz = Umair > Ehsan

Quick Notes:

• Assign a variable to the most-referenced person first, then express everyone else in terms of it

2020 — Q7(c) [5] Seating Arrangement — 5 Girls, 4 Boys, 3 Cars

Given: Girls A,B,C,D,E and Boys W,X,Y,Z; 3 per car; each car needs ≥1 boy & ≥1 girl; A & D always together; Z never with B or C.

Steps to write in exam:

1. Seat the "must-be-together" pair (A,D) first, with one boy to satisfy the boy/girl rule → Car-1: A, D, W
2. Isolate the most restricted person (Z) away from B and C → pair Z with girl E instead → Car-2: Z, E, X
3. Remaining people form the last car → Car-3: B, C, Y
4. Verify: each car has 3 people with ≥1 boy & ≥1 girl ✓; A & D together ✓; Z not with B/C ✓

Answer: Car-1: A, D, W — Car-2: Z, E, X — Car-3: B, C, Y (other valid arrangements exist by swapping which non-Z boy goes where)

Quick Notes:

• Strategy: seat the fixed pair first, then isolate the most restricted person away from their forbidden pairing