Reasoning — Verbal and Analytical Foundations

Why This Chapter Matters

Every Grama/Ward Sachivalayam paper, regardless of which post you are targeting — Panchayat Secretary, Digital Assistant, Welfare and Education Assistant, or Engineering Assistant — carries a substantial reasoning component, and within that component verbal and analytical reasoning form the largest and most predictable slice. Unlike General Studies, where the syllabus keeps expanding with new facts and schemes, reasoning is a closed, well-mapped skill: the question types recur year after year with only the numbers and names changed. This means that a candidate who systematically masters the dozen or so core verbal reasoning formats — coding-decoding, blood relations, syllogisms, series, direction sense, ranking, and analogy — walks into the exam hall able to solve unfamiliar-looking questions in under a minute, simply because the underlying structure is familiar. This chapter builds that structural fluency from the ground up, with an emphasis not on tricks alone but on the logical scaffolding beneath each question type, so that you can handle variations the examiner introduces to test genuine understanding rather than rote memory.

The Architecture of a Reasoning Question

Before diving into individual topics, it helps to understand what reasoning questions are actually testing. Unlike quantitative aptitude, which tests calculation speed, or general studies, which tests recall, reasoning tests your ability to hold a small system of rules or relationships in your head and manipulate it correctly under time pressure. Every reasoning question, no matter how it is dressed up, reduces to one of three underlying operations: identifying a pattern and extending it (as in series and analogy), applying a fixed set of logical rules to a given set of statements (as in syllogisms and blood relations), or decoding a hidden transformation rule and reapplying it (as in coding-decoding). Recognising which of these three operations a question demands is itself half the battle, because it tells you which toolkit to reach for. A candidate who tries to "logically reason out" a coding-decoding question instead of hunting for the letter-shift or word-pattern rule will waste precious minutes; conversely, a candidate who tries to find an arithmetic pattern in a syllogism will get nowhere. Training yourself to instantly categorise a question the moment you read it is therefore the first and most valuable exam skill this chapter aims to build.

A second architectural point worth internalising early is that reasoning questions are deliberately written to be solvable within the given information — there is never a need for outside knowledge, and there is never genuine ambiguity once you read the statement carefully. If a question feels ambiguous, the fault almost always lies in a hasty reading, not in the question itself. This is why the single most important habit for this section is slow, careful first reading combined with fast, mechanical solving thereafter: spend the extra three or four seconds parsing the statement precisely, and you will save far more time by not having to redo the question after an error.

Coding-Decoding: Cracking the Hidden Rule

Coding-decoding questions present a word or set of letters encoded according to some rule, and ask you to apply that same rule to a new word, or to reverse the process and decode a given code back into the original word. The vast majority of coding-decoding questions used in recruitment exams fall into a handful of well-defined families, and recognising the family instantly is the key skill. The first and most common family is letter-shifting, where each letter of the word is replaced by another letter a fixed number of positions away in the alphabet — for instance, if CAT is coded as DBU, you can see that each letter has moved forward by exactly one position (C→D, A→B, T→U). Once you spot this shift, encoding or decoding any other word using the same rule becomes a simple matter of adding or subtracting the same number of positions letter by letter. It helps enormously to have the alphabet's forward and backward numbering memorised cold — knowing instantly that J is the 10th letter, or that the 21st letter is U, removes the need to count on your fingers during the exam.

The second major family is letter-and-number coding, where each letter of the alphabet is assigned a fixed number (usually its position, or a reversed position where A=26, B=25, and so on), and the question gives you a coded word as a string of numbers. Here the trick is to write out the alphabet with both forward and backward numbering above it as your first step on the rough sheet, so that decoding becomes instantaneous lookup rather than repeated counting. The third family is substitution coding, where the question tells you that in a certain artificial language, one real word stands for another — for example, "in a code language, 'red' is called 'blue', 'blue' is called 'green'" and so on through a chain of substitutions — and then asks a question like "what is the code for sky if sky is blue?" These questions test careful chain-tracking rather than any mathematical operation, and the main pitfall is losing track of which substitution applies at which link of the chain; writing out the full substitution chain on paper before answering prevents this error completely.

A fourth family, somewhat trickier, is where whole words in a sentence are coded, and you must work out the code for one specific word by comparing two or more coded sentences that share common words. For instance, if "pen is good" is coded as "ta ka na" and "good is costly" is coded as "na ka pa", you deduce that "is" corresponds to the common code word "ka" appearing in both, "good" corresponds to "na" (the word common to both sentences), and by elimination "pen" is "ta" and "costly" is "pa". The technique here is always the same: look for words that repeat across two coded sentences, match the coded terms that also repeat, and use elimination for the remainder. Practising this elimination method until it becomes automatic is far more valuable than memorising individual solved examples, because the actual words and codes will always differ in the live exam.

A fifth and increasingly common variant uses symbol or matrix coding, where letters are placed in a grid and each letter is represented by a pair of coordinates (its row and column position, sometimes with the second occurrence in a shifted grid used to distinguish otherwise identical coordinate pairs). These questions look intimidating at first but are mechanically simple once you build the two grids correctly on your rough sheet and read off coordinates methodically. The examiner's main way of adding difficulty here is by using two overlapping numbering schemes for rows and columns, so always check carefully whether the question specifies "when the row is even, use the second set of numbers" or similar conditions, because missing that conditional clause is the single most common cause of error in matrix coding.

Blood Relations: Mapping the Family Tree

Blood relation questions test your ability to build a family tree from a string of stated relationships and then answer a question about how two people in that tree are related to each other, or to identify a missing relationship. The single most effective technique for this topic is to draw the family tree as you read, rather than trying to hold the relationships in your head — even experienced solvers make careless errors when they attempt these questions purely mentally. A simple, consistent notation works best: use a horizontal line to connect spouses, a vertical line downward to connect a parent to children, and a small "+" or gender marker (M for male, F for female) next to each name so that gender-dependent relationship terms (uncle versus aunt, brother versus sister, nephew versus niece) can be resolved correctly at the end.

It is essential to know the standard English kinship vocabulary precisely, because a large share of errors in this topic come not from faulty logic but from uncertainty about what a term means. A "sibling" is a brother or sister sharing at least one parent; a "maternal" relative is on the mother's side and a "paternal" relative is on the father's side; your "in-law" relatives are related to you through marriage rather than blood; a "cousin" is the child of your parent's sibling; and a "nephew" or "niece" is the child of your sibling. Terms like "grandfather-in-law" or "sister-in-law's husband" appear specifically to test whether you can chain two or three relationship steps together correctly, and the only reliable way to handle these chained relationships is to resolve them one link at a time on your family tree diagram rather than attempting to compute the final relationship directly in your head.

Coded blood relation questions add another layer, where symbols such as "+" for "is the father of" or "×" for "is the sister of" replace the relationship words, and you must decode a string of such symbols to determine the final relationship between the first and last person named. The technique remains identical — draw the tree link by link using the coded symbols in place of words — but speed here comes specifically from having memorised the symbol-to-relationship mapping given at the start of the question, since re-reading the key repeatedly wastes time. A useful exam-day habit is to jot the symbol key in your own shorthand at the top of your rough work the moment you see the question, so your eyes never need to leave the tree-building process once you begin.

Puzzle-style blood relation questions, where several statements about a family are given and you must determine, for example, how many members are in the family or who occupies a particular role, require the same tree-drawing discipline but additionally reward patience: read all the statements once fully before drawing anything, since a relationship stated in the fourth sentence sometimes clarifies an ambiguity left open by the first sentence, and starting to draw too early can force you to redraw the entire tree when a later clue contradicts your initial assumption.

Syllogisms and the Logic of Statements

Syllogism questions present two or more statements involving quantifiers like "all," "some," "no," and occasionally "only," and ask you to determine which of several given conclusions necessarily follows. This topic is one of the most rule-bound in the entire reasoning syllabus, which makes it also one of the most reliably scorable once the rules are internalised — unlike puzzles, there is no ambiguity or partial credit in syllogism logic; a conclusion either follows with certainty from the given statements or it does not, and the correct answer is determined purely by formal logic rather than by real-world plausibility.

The most dependable method for solving syllogisms at this level is the Venn diagram approach, where each statement is translated into one or more circles representing categories, drawn to reflect every possible arrangement consistent with the statement, and the conclusion is checked against all such possible arrangements — a conclusion is valid only if it holds true in every possible diagram you can draw, not merely in the one that first comes to mind. For the statement "All A are B," you draw circle A entirely inside circle B. For "No A is B," you draw the two circles completely separate with no overlap. For "Some A are B," you draw the two circles overlapping partially, and crucially you must remember that "some" statements are compatible with, but do not require, a fully overlapping or fully contained relationship — meaning that when checking a "some" statement's implications, you must consider the possibility that "all A are B" might also be true, since "some" in formal logic means "at least some," not "some but not all." This particular nuance trips up many candidates who assume "some" strictly excludes "all," when in fact a conclusion of the form "some A are not B" cannot be validly drawn merely from "some A are B."

The complementary pair rule is another cornerstone: when two conclusions together cover every logical possibility (for example, "some A are B" and "no A is B" between them exhaust every possible relationship between A and B), and each is separately possible given the statements, the correct answer format is often "either conclusion I or II follows," a pattern the examiner uses specifically to test whether you understand that the two statements cannot both be false simultaneously. Recognising complementary pairs quickly — "all" versus "some not," and "some" versus "no" are the two standard complementary pairs — lets you shortcut straight to the "either-or" answer choice without laboriously drawing every diagram.

A practical exam strategy for syllogisms is to always test the conclusion against the diagram that makes the statements true but the conclusion false, if such a diagram can be drawn; if you cannot draw any valid diagram where the statements hold and the conclusion fails, the conclusion is certain and therefore correct. This "trying to break the conclusion" mindset is more reliable than trying to "prove" a conclusion directly, because it forces you to actively search for exceptions rather than settling for the first diagram that happens to confirm what feels intuitively true.

Number, Letter, and Alphabet Series

Series questions ask you to identify the pattern governing a sequence of numbers or letters and extend it to find a missing term or an odd term out. Number series patterns generally fall into a limited set of categories: simple arithmetic progressions with a constant difference; geometric progressions with a constant ratio; series based on squares, cubes, or their neighbours (such as a sequence where each term is one more than a perfect square); series with an alternating or two-stage pattern, where odd-position and even-position terms follow two separate rules; and series built from combined operations, where the difference between consecutive terms itself forms a recognisable pattern, such as differences that are themselves increasing by a constant amount, or differences that are themselves consecutive prime numbers. The efficient approach is always to first write out the differences between consecutive terms on your rough sheet, because a huge proportion of number series reveal their logic the moment the first-level differences are laid out, even when the original series looks erratic.

When first-level differences do not immediately reveal a pattern, the next step is to check second-level differences (the differences of the differences), check whether the terms relate to a squares or cubes sequence with a small constant added or subtracted, or check whether alternating terms belong to two interleaved series. It is worth building quick recall of squares up to at least 30 and cubes up to at least 15, since a huge share of "trick" number series are simply squares or cubes with a small offset, and instant recognition of, say, 169 as 13-squared saves substantial time compared to working it out from scratch under pressure.

Letter series work on the same principle but operate on alphabet position rather than numeric value, and the same techniques — computing position differences, checking for a repeating skip pattern, watching for reversed or grouped sequences — apply directly, provided you have alphabet positions memorised. Alphabet series questions sometimes also test skip-counting patterns, such as every third letter of the alphabet, or two interwoven series moving in opposite directions, and the best defence against being misled is, again, to write positions as numbers first and look for the numeric pattern rather than trying to "see" the pattern directly in letters.

Odd-one-out questions, where you must identify which term in a group does not share the pattern followed by the others, reward the same systematic approach: rather than staring at the whole set trying to spot the odd one intuitively, test each candidate term against a hypothesis about the shared rule (all are prime, all are one more than a multiple of three, all follow a particular letter-position parity, and so on) until one hypothesis correctly classifies all but one term.

Analogy, Classification, and Direction Sense

Analogy questions ask you to identify the relationship between a given pair of words or numbers and then find a second pair sharing the identical relationship. The relationship being tested typically falls into a recognisable category: part-to-whole (page is to book as brick is to wall), function-based (pen is to writing as knife is to cutting), category membership (rose is to flower as lion is to animal), degree or intensity (warm is to hot as cool is to cold), or cause-and-effect (fire is to smoke as rain is to flood). The discipline that prevents careless errors here is to state the relationship in a full, precise sentence before scanning the answer choices — "a page is a component part of a book" is a stronger and more testable statement than the vague impression that "page relates to book somehow," and stating the relationship explicitly exposes near-miss distractor options that share a superficial similarity but not the actual logical relationship.

Classification questions, commonly phrased as "find the odd one out" among a group of words, test the same category-recognition skill in reverse: you must identify the shared attribute uniting the majority of the items so you can spot which single item lacks that attribute. A frequent trap is that more than one plausible grouping exists among the options, and the examiner intends the finer, more specific classification rather than the broadest one — for instance, if four items are all "mammals" but three of them are specifically "carnivorous mammals," the intended odd one out is the non-carnivorous mammal, not simply "identify the non-mammal," since no such option may exist. Reading all the options before committing to a classification hypothesis avoids this trap.

Direction sense questions describe a person moving through a series of turns and distances, and ask for the final direction, distance, or displacement from the starting point relative to some reference point. The reliable method is to sketch a simple compass-oriented grid on your rough sheet the moment you begin — mark North at the top, plot the starting point at the origin, and trace each movement step by step, marking the turning point after each leg. A left turn always rotates your current facing direction ninety degrees anticlockwise, and a right turn rotates it ninety degrees clockwise; memorising this cleanly, rather than re-deriving it each time, prevents the single most common source of error in this topic. Once the full path is traced, the straight-line distance from the start to the final point (when asked) is generally found using the Pythagorean relationship between the net horizontal and net vertical displacement, since most direction-sense paths in these exams resolve into a right-angled configuration between the start and end points. Practising enough of these questions that the sketch-and-trace process becomes near-automatic is more valuable than trying to visualise the path mentally, especially under exam-hall time pressure where a small mental slip can send your entire answer in the wrong direction.

Building Real Exam Speed

Knowing the techniques above is necessary but not sufficient; genuine exam-day speed comes from repetition until pattern recognition becomes near-instant rather than effortful. A useful practice discipline is to solve reasoning questions in short, timed bursts of fifteen to twenty questions covering a single topic at a time until your average time per question in that topic drops to under a minute, and only then mix topics together in a combined practice set that mimics the actual exam's jumbled ordering. Mixing topics too early, before each individual technique is solid, tends to create confusion about which toolkit to reach for, whereas mixing topics after each is individually mastered builds the crucial skill of rapid categorisation this chapter opened with.

It also pays to maintain a small personal error log during your preparation, noting which specific sub-type of question — a particular coding family, a particular blood-relation phrasing, a particular syllogism quantifier combination — caused you to slip, since most candidates find their errors cluster around two or three recurring weak points rather than being spread evenly across the whole syllabus. Revisiting and specifically drilling those weak points in the final weeks before the exam yields a disproportionately large improvement in overall reasoning accuracy compared to generic revision of everything at equal intensity. The next chapter builds on this verbal and analytical foundation to cover non-verbal reasoning, puzzles, and data interpretation, where the same disciplined, structure-first approach continues to pay off.