Verbal Reasoning — Analogies, Series, Coding-Decoding

Three families of questions dominate the verbal-reasoning block of almost every judiciary preliminary paper and the CLAT-PG aptitude section: analogies, series, and coding-decoding. They look unrelated, but they reward one identical habit of mind — finding the rule that links one term to the next, then applying that rule mechanically. There are no marks for guessing prettily; there are marks for spotting the relationship fast and testing it against every option. This chapter builds that single skill from the alphabet up: how to read a relationship in an analogy, how to classify the dozen-odd patterns hiding inside a series, and how to crack a cipher in coding-decoding without flailing. Throughout, we keep the alphabet-position toolkit (the EJOTY mnemonic and the opposite-letter rule) at hand, because every one of these question types ultimately runs on it.

Why Analogies, Series and Coding-Decoding Are One Skill

Examiners group these three together for a reason. Each presents you with a hidden rule and asks you to either complete it or reverse it. In an analogy, the rule connects two words and you must find a fourth that stands in the same relation to a third. In a series, the rule connects each term to the next and you must extend it. In coding-decoding, the rule maps real letters to coded ones and you must apply or undo the mapping. The cognitive move is identical: isolate the transformation, verify it holds across all the data you are given, then apply it cleanly.

This matters for time management. A judiciary prelims aspirant typically has under a minute per reasoning question. You cannot afford to treat each item as a fresh puzzle. Instead you train pattern-recognition until the common transformations — a fixed letter shift, a squared sequence, a part-to-whole link — announce themselves at a glance. The disciplined approach is always the same three steps: (1) state the rule in words; (2) confirm it against every given pair or term, not just the first; (3) apply it to the unknown. Most wrong answers come from skipping step two and locking onto a rule that fits the opening pair but breaks later. Before going further it helps to be fluent with the number system and arithmetic foundations, because series questions lean directly on squares, cubes, primes and factor patterns.

The Alphabet-Position Toolkit (EJOTY and the Sum-27 Rule)

Before any letter-based question, internalise two facts. First, the forward position of each letter: A=1, B=2, up to Z=26. You should not count from A every time. Use the EJOTY mnemonic, which fixes the multiples of five — E=5, J=10, O=15, T=20, Y=25 — so any letter is at most two steps from a landmark. R is two past O (15), so R=18; V is two past T (20), so V=22.

Second, the opposite-letter rule: for any letter, its position counted from the front and its position counted from the back sum to 27. So the letter opposite A is Z (1+26), opposite C is X (3+24), opposite M is N (13+14). To find the mirror of any letter, subtract its forward position from 27. This single rule converts a tedious backward count into one subtraction and underpins a large share of coding questions, where the code is simply each letter replaced by its opposite. The forward shift used in a Caesar-style cipher and this mirror operation are the two most common letter transformations you will meet, so commit both to muscle memory.

Analogies: Reading the Relationship

An analogy asks: A is to B as C is to ? — written A : B :: C : ?. Your job is to name the precise relationship between A and B, then find the option that bears the same relationship to C. The cardinal error is naming the relationship too loosely. If the link between the first pair is "glove : hand", "a glove is worn on a hand" is sharper than "they go together", and that sharpness eliminates distractors. Always articulate the relationship as a full sentence before you look hard at the options. The sentence is sometimes called a "bridge"; a good bridge is specific enough that swapping in the third term and each candidate fourth term either obviously works or obviously fails.

When more than one option seems to fit, make the relationship narrower until only one survives. This is the single most reliable analogy technique. Examiners deliberately plant a near-miss option that satisfies a loose reading of the link but fails a strict one. Tightening the rule — adding direction, degree, or function — is how you defeat the trap. Consider "author : novel :: ? : ?". A loose bridge, "someone who makes a thing", admits "baker : bread", "sculptor : statue" and "poet : poem" all at once. Tighten it to "a person who composes a written work of that specific literary kind" and only "poet : poem" survives among literary pairs. The habit of refusing the first comfortable bridge and demanding a sharper one is what separates a sixty-per-cent score from a ninety-per-cent score on this question type.

The Recurring Analogy Relationship Types

A finite menu of relationships recurs across papers; recognising the category speeds you up. The core types are: synonym (happy : glad), antonym (expand : contract), part-to-whole (page : book; petal : flower), and cause-to-effect (fire : smoke; virus : illness). Beyond these four, watch for worker-to-tool (carpenter : saw), worker-to-product (poet : poem), object-to-function (knife : cut), degree or intensity (warm : hot; dislike : detest), category-to-member (metal : iron), and symbol-to-thing-symbolised (dove : peace).

Two refinements decide hard questions. First, order matters: if the stem runs cause : effect, the answer must also run cause : effect, not effect : cause. "Fire : smoke" demands "accident : injury", not "injury : accident". Second, degree must match: in an intensity analogy, the size of the jump should be comparable, so "warm : scorching" is a worse fit for "cool : cold" than "cool : freezing" might demand. Treat each pair as a directed, calibrated relation, never a vague association.

It pays to keep a running mental inventory of these categories, because naming the category is half the battle. When you read "telescope : astronomer", the instinct should fire "tool-to-user, reversed" before you scan options, so you immediately seek a user-and-their-instrument pair in the same order. When you read "famine : starvation", you should register "cause-to-effect" and reject any option that reverses the causal arrow. Speed on analogies is not about a larger vocabulary alone; it is about classifying the relationship into one of this finite set within the first two seconds, which only deliberate, categorised practice builds.

Letter and Number Analogies

Not all analogies are about meaning. Letter analogies hide an alphabet operation: in BD : FH :: JL : ?, each pair is two consecutive even-position letters and the pairs jump by four positions, so the answer is NP. Reach for the position toolkit here — convert letters to numbers, find the operation, convert back.

Number analogies hide an arithmetic relationship: in 4 : 64 :: 5 : ?, the rule is cube (4 cubed is 64), so the answer is 125. In 7 : 50 :: 9 : ?, the rule is n-squared-plus-one (49+1), giving 82. The discipline is the same as in number series — test square, cube, multiply, add-and-square before settling. Mixed letter-number analogies combine both, for example mapping a word to the sum of its letter positions. Speed here comes directly from the EJOTY fluency built above and from comfort with ratio and proportion, since many number analogies are disguised ratios.

Series: Extending a Hidden Rule

A series gives several terms and asks for the next (or a missing) term. The terms may be numbers, letters, or a blend. Your first move is always to compute the differences between consecutive terms, then, if those are not constant, the differences of the differences. A first difference that is constant signals an arithmetic series; a constant ratio signals a geometric one; a pattern in the second differences signals a quadratic (often a squares-based) rule.

Do not stop at the first plausible rule. A series like 2, 6, 12, 20, 30 is not "add an even number" loosely — it is add 4, add 6, add 8, add 10, a clean arithmetic progression of differences, so the next term is 42. Stating the rule precisely guards against the examiner's favourite trick of a series whose opening looks geometric but is actually polynomial. Take 1, 3, 7, 13, 21: the differences are 2, 4, 6, 8 — themselves arithmetic — so the next difference is 10 and the next term is 31. A careless eye sees the early terms roughly doubling and guesses a geometric rule, which fails by the third term. The remedy is mechanical: always write the difference row beneath the series before committing, because a glance at that row usually names the family immediately.

A second discipline is to check the position of the missing term. Some series ask not for the next term but for one buried in the middle, marked by a blank or a letter. Solve those by establishing the rule from the surrounding terms on both sides, then confirming your candidate makes both the term before and the term after consistent. Working from only one side is the commonest source of an off-by-one error in series questions.

The Pattern Catalogue for Number Series

Memorise the recurring families so you can test them in order. Arithmetic: constant difference (2, 4, 6, 8 — add 2). Geometric: constant ratio (3, 6, 12, 24 — multiply by 2). Square series: 1, 4, 9, 16, 25. Cube series: 1, 8, 27, 64, 125. Mixed or two-step: alternating operations, such as multiply-by-2-then-add-1. Difference-of-differences: where the gaps themselves form a series, like 20, 18, 15, 11, 6 (subtract 2, 3, 4, 5). Division series: 64, 32, 16, 8, 4 (halving).

Three flags shortcut the search. If the numbers grow slowly and roughly linearly, suspect arithmetic or a difference pattern. If they grow fast, suspect geometric, squares, or cubes — and recognising perfect squares and cubes on sight (a payoff of the arithmetic foundations chapter) is decisive. If terms alternate up and down, suspect two interleaved sub-series, which you separate by reading every other term. The alternating case is common and missed often: in 1, 2, 4, 3, 9, 4, 16 the odd positions give 1, 4, 9, 16 (squares) and the even positions give 2, 3, 4 (counting), so the next term continues the squares with 25.

A handful of less obvious families round out the catalogue. Prime series list the primes (2, 3, 5, 7, 11, 13) and trip up candidates who hunt for an arithmetic gap that does not exist; recognising primes on sight, again a payoff of the foundations chapter, is the only reliable cure. Fibonacci-type series form each term by summing the previous two (1, 1, 2, 3, 5, 8, 13). Power series raise a base to increasing exponents (2, 4, 8, 16 as powers of two, distinct in feel from a plain doubling once you see 32, 64 following). When a fast-growing series resists squares and cubes, test these three before abandoning it. The discipline never changes: name the family, verify across every term, then extend.

Letter and Alphanumeric Series

Letter series run on alphabet positions, so convert and treat them as number series. In C, F, I, L, ?, the positions are 3, 6, 9, 12 — add 3 — so the next is 15, which is O. Skip patterns are the staple: "every third letter" or "forward two, back one". Wrap-around is the trap — after Z the count returns to A, so a forward jump from Y by three lands on B (25 to 28, minus 26).

Alphanumeric series interleave letters, numbers and sometimes symbols (for example B2, D4, F6, H8). Treat each stream independently: here the letters skip by two (B, D, F, H) and the numbers count even (2, 4, 6, 8), so the next term is J10. Many bank and judiciary papers add a third symbol stream; the method does not change — isolate each stream, find its rule, recombine. Patience in separating streams beats cleverness every time.

Coding-Decoding: The Five Families

Coding-decoding gives you a word and its coded form and asks you to encode or decode something new. Practically all questions fall into five families: letter coding (each letter shifted or mirrored), number coding (letters mapped to numbers, often their positions), substitution coding (whole words replaced by other words), symbol coding (letters or words replaced by symbols), and mixed or conditional coding (rules that depend on position or letter type). Identify the family first; the technique follows from it.

The diagnostic question is: does the code preserve length and order? If the code has the same number of characters as the word and they line up one-to-one, it is letter or number coding and you compare position by position. If a sentence is coded word-for-word with no clear letter pattern, it is substitution, and you solve it by matching common words across the given sentences — the classic "decipher" type.

Letter Coding: Shift and Mirror

The most common letter code is a fixed forward or backward shift — a Caesar cipher. If CAT becomes DBU, each letter moved forward by one (C to D, A to B, T to U), so to decode you shift back by one. Confirm the shift on all letters before applying it; examiners sometimes vary the shift by position (first letter +1, second +2, and so on), which only careful checking reveals.

The second common code is the mirror, where each letter is replaced by its opposite under the sum-27 rule from the toolkit. Here CAT becomes XZG, because the opposite of C is X (3 and 24), of A is Z, of T is G (20 and 7). When a code looks random but each letter sits near the far end of the alphabet from the original, test the mirror immediately. A small number of questions combine the two — mirror then shift — so if neither pure operation fits, try the composition. These letter transformations reward the same numeric fluency as arithmetic foundations: you are doing modular addition on positions 1 to 26.

Number Coding and Substitution Coding

In number coding, letters usually map to their alphabet positions, sometimes transformed. If a word codes to the sum of its letters' positions, then CAB codes to 3+1+2=6. If each letter maps to its position then a fixed operation applies — squared, doubled, plus a constant — derive the operation from a fully given example, then apply it. Always check whether the code uses forward positions (A=1) or reverse positions (A=26, the mirror count), as papers use both.

Substitution or "decipher" coding is different in flavour. You are given two or three coded sentences and must deduce which code-word stands for which real word by intersection. If "pit dol" means "red apple" and "dol fan" means "apple cart", then "dol" is the common code and "apple" the common word, so dol = apple. Eliminate methodically: the word appearing in both sentences must correspond to the code appearing in both. This is pure logic, not language, and rewards a tidy table over guesswork. The matching discipline mirrors how you reason through proportions in percentage, ratio and proportion — hold the knowns fixed and solve for the one unknown.

Symbol and Conditional Coding

Symbol coding replaces letters or words with symbols (#, @, *, and so on) under a stated key, often combined with a number for each element and a condition for symbols. These question sets — common in banking and increasingly in judiciary prelims — usually supply a table plus two or three rules such as "if the first element is a consonant and the last a vowel, code both as the symbol for the first". The work is bookkeeping: apply each rule in the stated order, watch for the exception clauses, and never assume a rule from an earlier set carries to a new one.

Conditional coding is where most marks are lost to carelessness rather than difficulty. Read every condition, note which take priority, and process the elements left to right unless told otherwise. Because these sets carry several sub-questions on one key, the time invested in getting the rules straight pays off across four or five marks at once — much like a multi-part time and work problem where one correct setup unlocks the whole question. Treat the rule list as a checklist and tick each off per item.

A Worked Mixed Set: Putting It Together

Examiners often chain the three types in a single block, so practise switching gears. Take three quick items. First, the analogy DIVE : EJWF :: SWIM : ?. Each letter of the code is the original shifted forward by one, so SWIM becomes TXJN. Confirm on all four letters before answering: S to T, W to X, I to J, M to N — consistent, so TXJN is correct. Second, the series 3, 4, 8, 17, 33, ?. The differences are 1, 4, 9, 16 — the perfect squares — so the next difference is 25 and the answer is 58. Recognising 1, 4, 9, 16 as squares on sight, a dividend of the arithmetic foundations, makes this near-instant.

Third, a substitution item: if "sun rises east" is coded "ka pa ta" and "east is cold" is coded "ta ma da", which code means east? The word "east" is common to both sentences, and the only code common to both is "ta", so ta = east. Notice you did not need to decode the other words at all — the intersection alone answers the question. This is the essence of efficient reasoning: solve only as much as the question demands, and let the structure of the data do the work. The same minimalism serves you across the wider aptitude block, from ratio and proportion to time, distance and speed.

Exam Strategy and Common Pitfalls

Across all three question types, the same habits raise your accuracy. State the rule in words before touching the options. Verify the rule against every given datum, not the first one only. For analogies, tighten a loose relationship until one option survives, and respect direction and degree. For series, compute first and second differences and check for interleaved sub-series before guessing. For coding, identify the family, confirm the transformation on all letters, and watch for wrap-around past Z and for forward-versus-reverse position counts.

The recurring pitfalls are predictable: locking onto a rule that fits the opening but breaks later; missing an alternating two-stream series; forgetting the sum-27 mirror is even an option; and ignoring an exception clause in conditional coding. Build speed not by rushing but by recognising patterns, which only drilling delivers. Pair this chapter's drills with the quantitative chapters — the number system for series fluency and time, distance and speed for the wider aptitude block — and return to the aptitude and reasoning hub to map your remaining topics. Consistent, rule-first practice is what converts these high-yield questions into reliable marks.