Non-verbal reasoning is the umbrella term for any question where the logic lives in a pattern — not in a word or sentence. At SSC MTS level, this expands to include not just figure-based questions but the broader family of "pattern recognition" problems: number series, letter coding, analogies based on a rule, and ranking puzzles. The thread connecting all of them is the same: find the rule, then apply it.
Think of it this way. Your brain has two modes when reading a question. Mode one is linguistic — you're parsing words for meaning. Mode two is structural — you're looking at a sequence and asking "what is the generator here?" Non-verbal reasoning is almost always about mode two, even when the question uses words.
Here is a useful analogy. Imagine you are watching a train pass by. You see coach 1, coach 2, coach 3. You don't need to know what's inside each coach to predict what coach 4 looks like — you just need to notice the pattern in their numbering or colour or size. That is exactly what you're doing in every non-verbal reasoning question. You're tracking a variable that is changing according to a rule, and predicting the next state.
For SSC MTS specifically, "non-verbal reasoning" in practice means:
You will rarely see pure figure-rotation or water-image questions at MTS difficulty, but the reasoning muscle is identical — locate the rule, apply it, verify against the options.
Pattern 1 — Constant difference of differences (second-order arithmetic)
When the differences between consecutive terms are not equal but their differences are equal, you're in second-order arithmetic territory.
Example: 2, 8, 18, 32, 50, ?
Differences: 6, 10, 14, 18 → second differences: 4, 4, 4 (constant)
Next difference = 18 + 4 = 22, so next term = 50 + 22 = 72
The underlying formula here is 2n² for n = 1, 2, 3... but recognising the second-difference pattern is faster in the exam hall.
Pattern 2 — Multiply + add (recurrence)
Example: 3, 7, 15, 31, 63, ?
Rule: each term = previous term × 2 + 1
63 × 2 + 1 = 127
These look messier than pure geometric series. The tell: no constant ratio, no constant difference. Immediately test "×2 ± constant" or "×3 ± constant".
Pattern 3 — Perfect powers
1, 4, 9, 16, 25... — squares. 1, 8, 27, 64... — cubes. Recognising these saves you from computing differences.
Every letter-shift code at MTS level uses a uniform shift applied to each letter. Your only job is to find the shift from one known letter pair, then verify with a second pair.
Example: TEACHER → VGCEJGT T → V: +2, E → G: +2. Shift confirmed as +2.
STUDENT → shift each letter +2: S(19) → U(21), T(20) → V(22), U(21) → W(23), D(4) → F(6), E(5) → G(7), N(14) → P(16), T(20) → V(22) Answer: UVWFGPV
Do not re-derive the shift for every letter. Find it from the first two letters, then apply mechanically.
When you have three coded sentences, use the "common word → common code" principle.
pen is blue = nit ka so
blue and red = so me ja
red ink pen = ja si nit
Step 1 — find words appearing in exactly two sentences and match:
nit ka so and ja si nit → nit = pennit ka so and so me ja → so = blueso me ja and ja si nit → ja = redStep 2 — in sentence 3, ja si nit = red ink pen. Since ja = red, nit = pen, the remaining code si = ink.
Before looking at the options, say out loud (or in your head): "16 is to 256 as 12 is to ?"
What is 256 relative to 16? It is 16² = 256. So the relationship is "square of the first number." Apply it: 12² = 144.
If you jump to the options first, you will be led astray by option B (1728 = 12³) which is a deliberate trap.
Total = Position from left + Position from right − 1
This formula is the only thing you need. The −1 exists because the person occupying the position is counted twice (once in each direction).
Position from left = 15, from right = 12: Total = 15 + 12 − 1 = 26
When a blood-relation question gives 4-6 clues, draw a tree first. Don't try to hold it in working memory.
Standard shorthand: M = Male, F = Female, horizontal line = married couple, vertical line = child.
Then ask: what is the shortest path between the two people in question? Count generations and gender.
"Day before yesterday was Thursday" — this is a fixed-point problem.
Let today = X. Then:
So X − 2 = Thursday → X = Saturday (today)
Day after tomorrow = X + 2 = Saturday + 2 = Monday
The mistake most people make is trying to count in their heads without anchoring to "today." Always anchor first.
When a number series has no obvious ratio or constant difference, write out the differences and then the differences of those differences. If the second row is constant, you're in 2n² territory. Applying this takes 3 rows of subtraction (about 15 seconds) versus guessing multiple formulas (45+ seconds). The second-difference will also tell you the increment for the next first-difference, letting you compute the answer in one final addition.
In letter-coding, confirm the shift using only the first two letters of the coded word. Once confirmed, apply it to every remaining letter without re-checking. This reduces the verification step from 7 comparisons to 2, cutting solve time from about 40 seconds to under 15 seconds for a 7-letter word like STUDENT.
In analogy questions, before reading options, frame the relationship as a sentence: "the second number is the [square / cube / double / half] of the first." Commit to that sentence, then match it to the options. This prevents the options from planting false relationships in your mind. The standard approach (scan all 4 options and check each) takes 4 comparisons; this method takes 1 derivation + 1 match, saving 20-25 seconds on average.
In word-coding, resist the urge to decode all three sentences simultaneously. Instead: (1) circle words that appear in exactly two sentences, (2) find codes common to those two sentences, (3) assign. You will solve for all base codes in under 30 seconds. Trying to work with all three sentences at once routinely takes 60-90 seconds and produces errors.
For any day/date puzzle, immediately write: "Today = ___." Fill it in from the clue given. Every subsequent calculation is then a simple forward or backward count from a fixed point. Without anchoring, candidates mentally drift and recount, costing 20-30 extra seconds and introducing errors. With anchoring, the count takes under 10 seconds.
Look at the question type first — 3 seconds of classification saves 30 seconds of misdirected effort.
Is it a number series? → Check for constant difference (arithmetic). If not, check for constant ratio (geometric). If not, write differences and check second differences. If not, test ×2±1 or ×3±1. Whichever locks in, apply it to the last term.
Is it a letter/word code? → Single word: find the shift from the first letter, verify on the second, apply to all. Sentence-based: use match-and-eliminate across sentence pairs.
Is it an analogy? → State the relationship in words before reading options. Then match.
Is it ranking/position? → Write the formula: Total = Left + Right − 1. Plug in. Done.
Is it blood relation? → Draw the tree. Two married couples = two horizontal lines. Identify each person's generation. Trace the path.
Is it day/date? → Write "Today = ?" and solve backward from the given anchor. Then count forward to the target.
If you cannot find the pattern within 45 seconds, mark your best guess and move on. Never spend more than 90 seconds on any single reasoning question.
Why this question: Blood-relation questions trip candidates because they try to hold the entire family tree in memory without drawing it. This PYQ tests whether you map before you interpret.
Solving path: Start with the grandfather clue. D is grandfather of F and father of A — so D is one generation above A, and two generations above F. This means A and F are one generation apart. A is D's child. F is D's grandchild. Since E is F's mother (and E is not mentioned as A's sibling explicitly), the family tree places A as a sibling of F's parent — which makes A the uncle. Answer: Uncle.
Why this question: Word-coding is high-frequency in MTS reasoning. This PYQ is a textbook application of match-and-eliminate.
Solving path: Find "pen" in sentences 1 and 3. Common code: nit. Find "blue" in sentences 1 and 2. Common code: so. Find "red" in sentences 2 and 3. Common code: ja. In sentence 3 (ja si nit = red ink pen), ja = red, nit = pen, so si = ink. Answer: si.
Why this question: Day arithmetic is a guaranteed 1-mark question. The anchor method solves it in under 15 seconds.
Solving path: Day before yesterday = Thursday. So today = Thursday + 2 = Saturday. Day after tomorrow = Saturday + 2 = Monday. Answer: Monday.
Why this question: The ranking formula is the only thing tested here. One line of arithmetic.
Solving path: Total = 15 + 12 − 1 = 26. The −1 is non-negotiable. Answer: 26.
Why this question: Number series with second differences is one of the two most common series types in MTS. This PYQ uses it cleanly.
Solving path: Series: 2, 8, 18, 32, 50. Differences: 6, 10, 14, 18. Second differences: 4, 4, 4 (constant). Next first difference = 22. Next term = 50 + 22 = 72. Answer: 72.
Forgetting the −1 in ranking problems. Total = Left + Right − 1. Candidates who write Left + Right get 27 instead of 26. The −1 exists because the person is counted in both directions. Write the formula, don't compute from memory.
Verifying the coding shift only once and assuming it applies. Always check the shift on at least two letters before committing. Some MTS questions use alternating shifts (e.g., +2, +3, +2, +3) and a single check will lock you into the wrong pattern.
In analogy questions, matching the wrong relationship because the options are checked before the rule is stated. Option B in the 16:256 PYQ is 1728 = 12³, which looks plausible if you don't first confirm that the rule is "squaring." Candidates who scan options first get pulled toward the cube. State the rule, then match.
In blood-relation questions, assuming gender without explicit confirmation. Names like A, B, C are gender-neutral. Only assign gender when the question says "father," "mother," "son," "daughter," "grandfather," "grandmother." "Sibling" and "cousin" are gender-neutral in the question stem and in the answer options at this level.
In day-of-week problems, adding days without anchoring to today. "Day before yesterday was Thursday" does not mean today is Thursday. Candidates who don't anchor make a two-day error and choose Sunday instead of Monday.
In recurrence series, testing only ×2 and missing the +1 adjustment. Series like 3, 7, 15, 31 do not have a constant ratio. The ratio is not 2 — the rule is ×2 + 1. If your ratio check fails, immediately test "multiply and add a small constant" before writing off the question as too hard.