Mental Ability
Learning Objectives
- Understand the fundamental concepts of Mental Ability
- Apply key formulas and techniques to solve problems
- Practice with exam-level questions to build speed and accuracy
Analogy
1.1 Understanding the Core Principle
Analogy questions test the ability to recognise a relationship between two given items and then apply the same relationship to a new pair. The relationship may be based on meaning, function, structure, or a logical rule such as cause and effect. When a candidate identifies that the first pair shares a specific link, the task becomes one of transferring that link to the options, discarding those that do not preserve the identical connection. This process demands both verbal reasoning and pattern recognition, because the same logical bond can appear in words, numbers, or even symbols.
In practice, the examiner often presents a pair such as “Doctor : Hospital” and expects the examinee to choose the option that mirrors the professional‑to‑workplace link, for example “Teacher : School”. The correctness of the answer hinges on the precision of the identified relationship; a superficial similarity like “Doctor : Stethoscope” would be wrong because the link there is tool‑to‑user rather than professional‑to‑institution. Therefore, the first step in every analogy problem is to articulate the exact relationship in a single sentence before scanning the alternatives.
1.2 Major Categories of Analogical Relations
Analogies can be grouped into several recurring categories, each with its own typical markers. Semantic analogies rely on meaning connections such as synonymy, antonymy, or degree of intensity; for instance “Hot : Scorching” mirrors “Cold : Freezing”. Functional analogies describe a purpose or role, as in “Key : Lock” compared with “Password : Account”. Structural analogies focus on form or composition, like “Hand : Finger” versus “Foot : Toe”. Causal analogies express cause and effect, exemplified by “Rain : Flood” and “Spark : Fire”. Recognising which category a given pair belongs to narrows the search space dramatically.
Examination papers frequently mix categories within a single set, so a candidate must be comfortable shifting from a semantic to a structural lens without losing momentum. A useful habit is to label the relationship mentally — “synonym”, “part‑to‑whole”, “tool‑to‑task” — before looking at the answer choices. This labelling acts as a filter that eliminates distractors which share only a surface resemblance but not the deep logical bond.
1.3 Strategies for Rapid Identification
Speed in analogy questions comes from a two‑stage approach: first, decode the stem pair into a concise relational statement; second, test each option against that statement. Writing the relational statement in the margin, even in abbreviated form, prevents the mind from drifting to irrelevant associations. For example, converting “Carpenter : Saw” into “Professional uses tool” makes it immediate that “Surgeon : Scalpel” fits while “Painter : Canvas” does not, because the latter is a creator‑to‑medium link rather than a professional‑to‑instrument link.
Another time‑saving technique is to spot “bridge words” that often signal a particular relation. Words such as “is a type of”, “is part of”, “is used for”, “is the opposite of” appear repeatedly in well‑constructed items. When these cues are present, the candidate can jump straight to the corresponding category without re‑analysing the stem. Practising with a wide variety of stems trains the brain to recognise these cues automatically, turning a potentially slow reasoning step into a near‑instant pattern match.
Classification
2.1 The Logic of Grouping
Classification tasks present a set of items — words, numbers, figures, or symbols — and ask the examinee to identify the one that does not belong to the common group. The underlying principle is that the majority share a defining attribute, while the odd item lacks that attribute or possesses a contradictory one. This attribute can be semantic (all are fruits except one), numeric (all are prime numbers except one), or visual (all are closed shapes except one). The challenge lies in abstracting the shared property quickly and verifying each candidate against it.
Because the odd item is often designed to be superficially similar to the group, a surface scan can be misleading. For instance, in the list “Apple, Mango, Banana, Carrot, Grape”, the immediate impression is that all are edible plant products, but the defining attribute “fruit” excludes “Carrot”, which is a root vegetable. The examinee must therefore articulate the grouping rule explicitly — “All are botanical fruits” — before testing each element. This explicit rule formulation is the safeguard against trap items that share a broader but incorrect category.
2.2 Common Bases for Classification
Examiners draw on a repertoire of classification bases that recur across papers. Linguistic bases include parts of speech, synonym clusters, or word‑origin families. Numerical bases cover parity, divisibility, prime‑composite status, square‑cube properties, or positional patterns such as Fibonacci membership. Visual bases involve symmetry, number of sides, open versus closed figures, or shading patterns. In mixed‑type questions, the same list may contain both words and numbers, requiring the candidate to detect a meta‑pattern such as “all items represent units of measurement” where “Kilogram”, “Metre”, “Second”, “Ampere”, “Candela” are SI base units and “Litre” is the odd one out because it is a derived unit.
Familiarity with these bases allows the test‑taker to generate a hypothesis quickly. A practical habit is to mentally list the most frequent classification criteria — “prime numbers”, “vowels”, “planets”, “chemical elements”, “geometric shapes” — and run through them as a checklist when the grouping is not immediately obvious. This systematic scan reduces the chance of overlooking a subtle numeric property such as “all numbers are one less than a perfect square”.
2.3 Avoiding Common Pitfalls
One frequent pitfall is selecting an item that differs in a trivial attribute while the intended grouping relies on a deeper property. For example, in “2, 3, 5, 7, 9” the obvious difference is that 9 is the only even‑digit number, but the intended rule is “prime numbers”, making 9 the correct odd one out because it is composite. Another trap is the “double‑odd” situation where two items could be considered outliers under different plausible rules; the test designer ensures only one rule fits the majority cleanly. The examinee must therefore verify that the chosen rule applies to at least four out of five items without exception.
Time pressure can tempt a candidate to guess after spotting a single difference. A disciplined approach is to write down the candidate rule, test it against every item, and only then confirm the outlier. If the rule fails for more than one item, the rule is wrong and a new hypothesis must be formed. This iterative verification, though it feels slower, actually saves time by preventing the need to re‑read the question after a wrong answer is chosen.
Series
3.1 Recognising the Underlying Pattern
Series questions present a sequence of numbers, letters, or symbols that follow a deterministic rule. The examinee must discover the rule and either predict the next term, locate a missing term, or identify an incorrect term. The rule may be arithmetic (constant difference), geometric (constant ratio), polynomial (differences of differences), or based on alternating operations, positional shifts, or even external knowledge such as prime numbers or squares. The first step is always to write the terms in a column and compute the first‑order differences; if those differences are constant, the series is arithmetic. If not, compute second‑order differences to test for a quadratic pattern.
Letter series often rely on alphabetical positions. Converting each letter to its numeric rank (A=1, B=2, …) transforms the problem into a numeric series, after which the same difference analysis applies. Symbol series may follow a visual rotation, reflection, or addition‑removal pattern; in such cases, sketching the first few figures side by side helps the eye catch the transformation rule. The key is to reduce the presented material to a simple mathematical or logical operation that can be expressed in a single sentence.
3.2 Common Series Types and Their Signatures
Arithmetic progressions show a fixed additive step, for example 3, 7, 11, 15 (difference 4). Geometric progressions multiply by a constant factor, such as 2, 6, 18, 54 (ratio 3). Square and cube series appear as 1, 4, 9, 16 or 1, 8, 27, 64. Prime series list successive primes: 2, 3, 5, 7, 11. Fibonacci‑type series add the two preceding terms: 1, 1, 2, 3, 5, 8. Alternating series apply two different rules in turn, e.g. +2, ×2, +2, ×2 producing 3, 5, 10, 12, 24. Recognising these signatures allows the candidate to jump to the correct hypothesis after only a few difference calculations.
Mixed series combine two independent sub‑series interleaved, such as odd positions following an arithmetic rule and even positions following a geometric rule. The tell‑tale sign is that the first‑order differences do not settle into a single pattern but instead oscillate. Splitting the sequence into two separate streams by taking every other term often reveals two clean progressions. This technique is essential for longer series where the interleaving is not announced.
3.3 Efficient Computation Techniques
Mental arithmetic speed is crucial. For arithmetic series, the nth term formula aₙ = a₁ + (n‑1)d can be used to jump directly to any term without iterating. For geometric series, aₙ = a₁·rⁿ⁻¹ serves the same purpose. When differences of differences become constant, the series is quadratic and the nth term can be expressed as an² + bn + c; solving for a, b, c using the first three terms yields a quick prediction for later terms. Practising these formulae with a variety of starting values builds the automaticity needed to solve a series question within thirty seconds.
Another practical shortcut is to look for “anchor terms” such as perfect squares, cubes, or well‑known constants (π ≈ 3.14, e ≈ 2.71) that appear in the series. Their presence often signals a mathematical‑constant‑based pattern, allowing the candidate to bypass lengthy difference tables. However, reliance on anchors must be balanced with verification, because examiners sometimes insert a familiar number as a distractor in an otherwise unrelated pattern.
| Series Type | Defining Rule | Typical First‑Order Difference Behaviour |
|---|---|---|
| Arithmetic | Constant addition (d) | Constant |
| Geometric | Constant multiplication (r) | Multiplicative growth; ratios constant |
| Quadratic | Second‑order difference constant | First differences form an arithmetic progression |
| Prime | Successive prime numbers | Irregular, no simple algebraic pattern |
| Fibonacci | Sum of two preceding terms | Differences follow the same series shifted |
Coding‑Decoding
4.1 Principle of Symbol Substitution
Coding‑decoding questions test the ability to understand a rule that transforms a plain message into a coded form and to reverse that process. The rule may operate at the level of letters (shift, reversal, substitution), numbers (arithmetic operation on positional values), or a combination of both. The examinee receives either a coded word with its plain counterpart or a set of coded‑plain pairs from which the rule must be inferred. Once the rule is known, it is applied to a new word or the code for a given word is produced.
The most common letter‑level rule is the Caesar shift, where each letter is moved forward or backward by a fixed number of positions in the alphabet. Variants include a progressive shift (first letter +1, second +2, third +3) or a keyword‑based substitution where a keyword determines a mixed alphabet. Number‑level rules often add, subtract, multiply, or divide the alphabetical rank of each letter, sometimes followed by a modulo‑26 wrap‑around. Recognising the family of the rule — shift, reversal, substitution, arithmetic — is the first analytical step.
4.2 Decoding Strategies for Common Patterns
When a single coded‑plain pair is given, write both words one above the other and compute the positional difference for each corresponding letter. If all differences are identical, the rule is a uniform shift. If differences follow a simple arithmetic progression, the rule is a progressive shift. If the coded word is the plain word written backwards, the rule is reversal. If the coded letters correspond to a keyword‑generated cipher alphabet, the keyword can often be reconstructed by aligning the known plain‑cipher pairs and spotting the keyword at the start of the cipher alphabet.
For number‑based codes, convert each plain letter to its rank, apply the suspected arithmetic operation, and check whether the resulting numbers match the given code. Because the alphabet size is 26, any operation that yields a number outside 1‑26 usually involves a modulo‑26 reduction (i.e., subtract 26 until the result falls in range). A quick mental check: if the code numbers are all larger than 26, the rule likely involves multiplication or addition without reduction, and the code may be a direct numeric representation rather than a letter‑to‑letter mapping.
4.3 Handling Mixed and Multi‑Step Codes
Advanced items combine two or more elementary operations, for example a shift followed by a reversal, or a substitution followed by a numeric conversion. The decoding process then becomes a pipeline: apply the inverse of the last operation first, then the inverse of the preceding one. A systematic way to untangle such codes is to hypothesize the last step by examining the final output format — if the code is a string of letters, the last step is likely a letter‑level operation; if it is a string of numbers, the last step is numeric. Working backwards from the output format narrows the search space dramatically.
Practice with a variety of mixed codes builds a mental library of common pipelines, such as “shift‑then‑reverse”, “keyword‑substitution‑then‑add‑5”, or “reverse‑then‑convert‑to‑numbers”. When faced with an unfamiliar combination, the candidate can still solve it by treating each character independently, writing the transformation table for the given example, and then generalising the observed per‑character mapping to the target word. This per‑character approach works even when the global rule is opaque, because the mapping is deterministic and consistent across the example.
| Operation | Description | Inverse Operation |
|---|---|---|
| Uniform Shift | Each letter moved +k positions | Shift –k positions |
| Progressive Shift | Shift increases by 1 each step | Decrease shift by 1 each step |
| Reversal | Word written backwards | Reverse again |
| Keyword Substitution | Mixed alphabet based on keyword | Reconstruct keyword alphabet and map back |
| Numeric Conversion | Letter rank ±/× constant, modulo 26 | Apply inverse arithmetic, then modulo 26 |
Direction Sense
5.1 Foundations of Cardinal and Inter‑Cardinal Directions
Direction sense questions describe a person or object moving from a starting point through a series of turns and distances, then ask for the final bearing relative to the start or the shortest distance back. The cardinal directions — North, East, South, West — form the primary axes, while the inter‑cardinal directions — North‑East, South‑East, South‑West, North‑West — lie exactly halfway between them. A turn “to the right” means a 90° clockwise rotation from the current heading; a turn “to the left” means a 90° anticlockwise rotation. Understanding this convention is essential because the wording “turns right” never changes regardless of the current facing.
Distances are usually given in metres or kilometres and are assumed to be straight‑line segments. The path traced is a polygonal chain on a plane. The final position can be determined by resolving each segment into its North‑South and East‑West components, summing the components separately, and then applying the Pythagorean theorem to obtain the straight‑line distance. The bearing is found by comparing the signs of the net North‑South and East‑West displacements: positive North and positive East yields North‑East, etc. This vector‑addition method works for any number of turns and eliminates the need for diagrammatic estimation.
5.2 Common Movement Patterns and Shortcuts
Examiners frequently use standard patterns such as “move 10 m North, turn right, move 10 m, turn right, move 10 m, turn right, move 10 m”. This square loop returns the person to the starting point, so the answer is zero distance and the original direction. Recognising such closed loops saves calculation time. Another pattern is the “right‑right‑left” sequence which often produces a net displacement that aligns with one of the cardinal axes, allowing a simple arithmetic sum rather than a full vector resolution.
When the path forms a right‑angled triangle, the final distance is the hypotenuse. If the two legs are given as multiples of a common factor (e.g., 6 m and 8 m), the hypotenuse is instantly known as 10 m by the 3‑4‑5 Pythagorean triple. Memorising the most common triples (3‑4‑5, 5‑12‑13, 8‑15‑17) lets the candidate answer distance questions without a calculator. For non‑triple legs, the candidate can still compute the square root mentally by approximation, but the exam usually supplies numbers that yield neat results.
5.3 Interpreting Shadow‑Based and Sun‑Based Questions
A distinct sub‑type asks for the direction of a shadow at a given time of day. The sun rises in the East and sets in the West; at solar noon it is due South in the northern hemisphere. Consequently, a vertical pole casts a shadow pointing West in the morning, North at noon, and East in the evening. If a person faces the rising sun, his left hand points North. These facts are geographic constants and do not change with the problem’s narrative. The candidate must translate the time description into the sun’s azimuth and then apply the shadow rule.
Questions may also involve a person turning to face his own shadow. Since the shadow direction is known from the time, the person’s new facing is opposite to the shadow direction. For example, at 9 am the shadow points West, so facing the shadow means facing West; the person’s right hand then points North. Building a small mental table of time‑versus‑shadow‑direction for the four key periods (sunrise, mid‑morning, noon, afternoon) enables instant answers without drawing diagrams.
Blood Relations
6.1 Core Terminology and Family Tree Construction
Blood relation problems describe a network of kinship using statements such as “A is the brother of B”, “C is the mother of D”, or “E is the son‑in‑law of F”. The examinee must deduce a specific relationship between two persons, often “How is X related to Y?”. The most reliable method is to draw a compact family tree using standard symbols: squares for males, circles for females, horizontal lines for marriages, vertical lines for parent‑child links. Each statement adds a node or an edge; contradictory statements are never given, so the tree remains consistent.
Key terms that appear repeatedly include “paternal” (father’s side), “maternal” (mother’s side), “uncle/aunt” (parent’s sibling), “nephew/niece” (sibling’s child), “cousin” (parent’s sibling’s child), “grand‑” prefixes (two generations up or down), and “in‑law” (relationship by marriage). Knowing that “brother‑in‑law” can be either the husband of one’s sister or the brother of one’s spouse prevents ambiguity. The candidate should memorise these definitions because the exam never provides a glossary.
6.2 Solving Multi‑Generational Puzzles
When the description spans three or more generations, the tree can become wide. A useful technique is to anchor the tree on the person whose relationship is asked, then expand outward only as needed. For instance, if the question asks “How is P related to Q?”, place Q at the centre, add Q’s parents, grandparents, siblings, and children as mentioned in the statements. Ignore relatives not connected to either P or Q. This focused expansion keeps the diagram small and reduces the chance of mis‑linking distant cousins.
Statements often use “only” to restrict possibilities, e.g., “R is the only son of S”. This tells us S has no other male children, which can be decisive when determining whether a male relative is a brother or a cousin. Similarly, “T has two daughters” fixes the number of female children. Quantitative clues like these are high‑value because they prune the tree dramatically. The candidate should underline such quantifiers while reading.
6.3 Common Traps and Verification Steps
A frequent trap is assuming gender from a name; the exam deliberately uses gender‑neutral names or provides explicit gender markers (“he”, “she”, “son”, “daughter”). Always rely on the explicit markers, not on cultural name conventions. Another trap is the “circular reference” where a statement like “U is the father of V” and later “V is the father of U” would be impossible; the exam never includes logical contradictions, so any apparent cycle indicates a mis‑reading.
Before finalising the answer, trace the path from the target person to the reference person on the drawn tree, counting generations and noting the gender at each step. Then translate that path into the standard kinship term: one generation up male = father, female = mother; two generations up = grandfather/grandmother; one generation down male = son, female = daughter; sibling of parent = uncle/aunt; child of sibling = nephew/niece; child of uncle/aunt = cousin. This systematic translation eliminates guesswork and ensures the answer matches the exact wording required by the question.
Mastery of these six modules — analogy, classification, series, coding‑decoding, direction sense, and blood relations — equips the aspirant with a versatile toolkit for the mental ability section, allowing each problem to be approached with a clear logical framework rather than rote memorisation.