Module 1 · GATE General Aptitude

Logical Reasoning

Updated 18 Nov 2026 · 4,107 words
Updated 21 Nov 2026
Analogies, syllogisms, puzzles, blood relations, directions, series.
Analogies · Syllogisms · Puzzles · Blood Relations
🎯 Take Mock Test

Learning Objectives

  • Understand the fundamental concepts of Logical Reasoning
  • Apply key formulas and techniques to solve problems
  • Practice with exam-level questions to build speed and accuracy

What is Logical Reasoning?

Logical Reasoning in GATE General Aptitude tests your ability to identify patterns, analyse relationships, and draw valid conclusions. Topics include analogies, syllogisms, puzzles, blood relations, direction sense, and number/letter series. GATE typically has 2-3 logical reasoning questions in the aptitude section.

Key Concepts

1. Analogies: Relationships include synonym/antonym, cause-effect, part-whole, worker-tool, product-material, animal-young one, degree of intensity. For letter analogies, use positional values (A=1 to Z=26). Number analogies use arithmetic operations.

2. Syllogisms: Statement types: All A are B (circle A inside B), No A is B (separate circles), Some A are B (overlapping circles), Some A are not B (partial overlap). A conclusion follows only if true in ALL possible Venn diagrams.

3. Blood Relations: Build a family tree step by step. Key: 'son of' or 'daughter of' indicates parent-child relationship. 'Brother/sister of' indicates sibling relationship. 'Husband/wife of' indicates marital relationship.

4. Direction Sense: Track movement step by step using a grid. Draw arrows for each movement. Right turn = +90° (clockwise from current direction). Left turn = -90° (anticlockwise). Use Pythagoras for net displacement.

5. Number & Letter Series: Number series: check differences, ratios, squares/cubes, alternating patterns, Fibonacci. Letter series: check positional value differences — often involves consistent addition/subtraction or a pattern of operations.

Solved Examples

Example 1 (Analogy)
Find the missing term: Engineer : Blueprint :: Architect : ?

a) Building b) Design c) Construction d) Site
Solution: b) Design. An engineer creates a blueprint. Similarly, an architect creates a design. This is a worker-product relationship.
Example 2 (Blood Relation)
Pointing to a man, Priya said, 'He is the son of the only daughter of my father.' How is the man related to Priya?

a) Brother b) Son c) Cousin d) Nephew
Solution: b) Son. Priya's father has only one daughter — that must be Priya herself (since Priya is a female name). The man is the son of that only daughter (Priya). Therefore, the man is Priya's son.
Example 3 (Number Series)
Find the next term: 3, 8, 15, 24, 35, ?

a) 42 b) 44 c) 48 d) 49
Solution: c) 48. Pattern: 1×3=3, 2×4=8, 3×5=15, 4×6=24, 5×7=35, 6×8=48.

Shortcut Techniques

  • For syllogisms in GATE, the Venn diagram method is most reliable. Draw all possible configurations before checking conclusions.
  • In blood relations, carefully track gender-specific terms (only 'mother' and 'sister' indicate female; 'father', 'brother', 'son' indicate male).
  • For series questions, examine differences first — if differences are constant or follow a pattern, you've found it. If not, check ratios or alternate terms.
  • In direction problems, draw a diagram for each movement — mental tracking often leads to errors in multi-step problems.
  • For analogy questions, identify the exact relationship in the first pair before checking options — multiple options may have partial similarity.
Pro Tip
GATE logical reasoning questions are straightforward and test basic aptitude. Do not overthink — if the answer seems too complex, you are likely on the wrong track. Practice 3-5 questions daily to maintain speed. These questions are easy to score if you identify the pattern quickly.

Advanced Applications

Modern exams feature questions combining multiple quantitative concepts. Master these by practicing previous year papers.

Shortcut Methods

Percentages: Use fraction table (12.5%=1/8, 20%=1/5, 25%=1/4). SI/CI: For 2 years, CI-SI = P(r/100)^2. Time Work: Use LCM of time periods. Average Speed: 2ab/(a+b) for equal distances.

Pro Tip
Write key formulas on rough sheet immediately after the exam bell while memory is fresh.

Categorical Syllogisms: Structure, Mood, and Figure

A categorical syllogism consists of three propositions: two premises and a conclusion, each containing a subject, a predicate, and a copula. The four standard forms are A (All S are P), E (No S are P), I (Some S are P), and O (Some S are not P). The mood of a syllogism is the sequence of these letters for the major premise, minor premise, and conclusion (e.g., AAA, EIO). The figure is determined by the position of the middle term (M) in the premises: Figure 1 (M‑P, S‑M), Figure 2 (P‑M, S‑M), Figure 3 (M‑P, M‑S), Figure 4 (P‑M, M‑S). Only 24 of the 256 possible mood‑figure combinations are valid under the traditional rules of distribution, existential import, and the prohibition of illicit major/minor terms.

The distribution rule states that a term distributed in the conclusion must be distributed in at least one premise. In an A proposition the subject is distributed; in an E both terms are distributed; in an I none are distributed; in an O the predicate is distributed. The middle term must be distributed at least once, otherwise the syllogism commits the fallacy of undistributed middle. Additionally, no conclusion may be drawn from two negative premises, and a negative premise requires a negative conclusion. These constraints reduce the valid forms to the classic 15 moods across the four figures (Barbara, Celarent, Darii, Ferio in Figure 1; Cesare, Camestres, Festino, Baroco in Figure 2; etc.).

Modern examinations often test the ability to recognise invalid forms quickly. A common shortcut is to convert each premise into a Venn diagram with three overlapping circles (S, M, P). Shade the area representing “No S are P” or “All S are P” as required, then place an “×” for particular statements. If the conclusion’s diagram is already forced in every possible shading, the syllogism is valid. This visual method bypasses memorisation of the 15 valid moods and works uniformly for all figures.

Exceptions arise when existential import is assumed for universal statements. Classical logic treats “All S are P” as implying the existence of at least one S, whereas modern Boolean interpretation does not. In exam questions that explicitly state “Assume existential import”, the valid moods expand to include forms such as AAI‑1 (Barbari) and EAO‑1 (Celaront). Without that assumption, these forms are invalid because the conclusion “Some S are P” cannot be guaranteed from universal premises alone.

Practical tip: when a question presents a syllogism in natural language, first identify the three terms, assign them to S, M, P, then rewrite each premise in standard form. Check the mood and figure against the valid list or draw the three‑circle Venn diagram. This two‑step process eliminates the most frequent error — mis‑identifying the middle term — and yields a reliable answer within 30 seconds.

Analogical Reasoning: Classification of Relations and Inference Rules

Analogies test the ability to perceive a structural similarity between two pairs of concepts. The relationship in the first pair (A : B) must be reproduced exactly in the second pair (C : D). Standard relation categories include: (1) Worker‑Product (carpenter : table), (2) Tool‑Function (scalpel : incise), (3) Cause‑Effect (rain : flood), (4) Part‑Whole (wheel : car), (5) Degree‑Intensity (warm : hot), (6) Symbol‑Referent (dove : peace), (7) Synonym/Antonym (joy : sorrow), (8) Classification (rose : flower), (9) Sequential (seed : sprout), and (10) Mathematical/Operational (2 : 4 :: 3 : 6). Recognising the precise category is essential because many distractors share a superficial similarity but belong to a different category.

A systematic approach: (a) articulate the relationship in a full sentence (“A carpenter makes a table”), (b) test each option by inserting it into the same sentence frame (“An architect makes a …”), (c) discard options that change the grammatical role (e.g., “building” is the product, not the act of designing), and (d) verify that the direction of the relation is preserved (worker‑product, not product‑worker). When multiple options survive, look for a secondary constraint such as gender, number, or domain specificity (e.g., “architect : blueprint” vs. “architect : design” — both are worker‑product, but “blueprint” is the technical document an architect produces, making it the tighter fit).

Advanced analogies may involve multi‑step relations: A : B :: C : D where the link from A to B is “A is the cause of B” and the link from C to D is “C is the prevention of D”. In such cases the relation type flips (cause vs. prevention) and the correct answer must mirror the logical inversion. Another twist is the “double analogy” where two independent relations hold simultaneously (e.g., “pen : ink :: brush : paint” — tool‑medium and instrument‑material). The examinee must identify the dominant relation that is common to both pairs.

Letter‑based analogies follow the same principle but operate on positional values (A=1, B=2, …). Common patterns: constant addition (A : C :: D : F, +2), alternating addition/subtraction, mirror positions (A : Z :: B : Y), or prime‑index mapping. The solver should compute the numeric difference for the first pair, then apply the identical arithmetic operation to the third term. If the operation yields a value outside 1‑26, wrap‑around (mod 26) is usually implied unless the question states otherwise.

Practice with a taxonomy table of relation types accelerates pattern recognition. Write the ten categories on a reference sheet, list two canonical examples per category, and rehearse converting a given pair into a sentence. Over time the classification becomes automatic, reducing the average solution time from 45 seconds to under 15 seconds.

Double Analogy Resolution
Select the pair that best matches the relationship in the given pair:  Catalyst : Reaction :: ? : ?  Options: (a) Enzyme : Metabolism, (b) Fuel : Engine, (c) Key : Lock, (d) Teacher : Student.
Step 1: Express the stem relation. A catalyst accelerates a reaction without being consumed; it is an agent that enables a process. Step 2: Test each option. (a) Enzyme : Metabolism — an enzyme catalyses metabolic reactions, mirroring the agent‑process link. (b) Fuel : Engine — fuel is consumed, not a reusable agent. (c) Key : Lock — key opens a lock, a tool‑object relation, not an enabling agent. (d) Teacher : Student — teacher instructs, a human‑role relation. Only (a) preserves the exact logical structure: reusable agent : process it enables. Answer: (a).
Exam‑Day Strategy
When you encounter an analogy, write the stem relation in a single clause on the rough sheet (e.g., “X enables Y”). Then read each option aloud, substituting into the clause. The option that yields a grammatically and logically coherent sentence is the answer. This verbalisation prevents silent mis‑reading and costs only a few seconds.

Complex Puzzle Architectures: Multi‑Variable Linear and Circular Arrangements

Puzzles that combine several attributes — such as person, colour, profession, and floor — require a matrix or grid rather than a simple line diagram. The standard technique is to create a table with rows representing entities (e.g., five persons) and columns for each attribute. Clues are of three types: direct assignment (“A lives on floor 3”), relative ordering (“B is immediately above C”), and conditional (“If D is a doctor, then E likes red”). Process direct clues first, filling cells definitively. Next, translate ordering clues into positional constraints (e.g., “B above C” means row(B) = row(C) − 1 in a bottom‑to‑top numbering). Conditional clues are handled by branching: assume the antecedent true, propagate consequences, and check for contradictions; if a contradiction appears, the antecedent must be false.

Circular arrangements add rotational symmetry. Fix one reference point arbitrarily (e.g., place “P” at the 12 o’clock position) to break symmetry, then apply clockwise/anticlockwise clues. “X sits third to the left of Y” translates to moving three steps anticlockwise from Y. When multiple circular tables interact (e.g., two concentric circles with facing pairs), draw both circles and map facing relations as vertical links. The same matrix method works: each seat becomes a row, attributes become columns, and facing pairs share a column for “opposite”.

Advanced puzzles often embed a “unique solution” requirement. After populating all certain cells, count the remaining empty cells. If the number of free permutations exceeds one, re‑examine clues for hidden exclusivity (e.g., “Only one person likes blue”). Such uniqueness clues convert a partially filled grid into a fully determined one. Another hidden constraint is the “pigeonhole principle”: if there are four colours and five persons, at least one colour repeats; a clue stating “All colours are different” would be contradictory, signalling a mis‑interpretation.

Time management: allocate a maximum of 2 minutes per puzzle. If after 90 seconds the grid has more than three ambiguous cells, flag the question, move on, and return later. The mental cost of holding a large incomplete matrix is high; a fresh look often reveals a missed direct clue.

Practice regimen: solve at least three multi‑attribute puzzles daily, varying the number of entities (4‑7) and attributes (3‑5). Use a spreadsheet template to automate row/column creation, allowing focus on logical deduction rather than drawing.

Blood‑Relation Coding: Generational Mapping and Gender Inference

Blood‑relation problems are essentially graph traversals on a family tree where nodes are individuals and edges encode parent‑child, sibling, or marital links. The most reliable representation is a generational diagram: place the oldest known generation at the top, draw vertical lines for parent‑child, horizontal lines for marriage, and bracket siblings. Gender is indicated by symbols (△ for male, ○ for female) or by pronouns in the statement. Every “son of” or “daughter of” fixes a child‑parent edge and the child’s gender; “brother of” or “sister of” fixes a sibling edge and the subject’s gender; “husband of” or “wife of” fixes a marital edge and the gender of both spouses.

A systematic decoding algorithm: (1) Identify the anchor person (usually the speaker). (2) Parse each relational phrase sequentially, updating the diagram. (3) When a phrase contains “only” (e.g., “only daughter of my father”), it creates a uniqueness constraint that often identifies the speaker’s gender and eliminates siblings. (4) After the diagram is complete, answer the target question by tracing the path between the two persons and counting generational steps (up = parent, down = child, across = sibling/spouse). The relationship name follows standard nomenclature: 0 generations up/down = self; 1 up = parent; 1 down = child; 2 up = grand‑parent; 2 down = grand‑child; 1 up + 1 down = uncle/aunt/nephew/niece depending on gender; same generation across marriage = brother‑in‑law/sister‑in‑law.

Common pitfalls: (a) Assuming “brother” implies male speaker — the speaker could be female referring to her brother. (b) Ignoring “only” which collapses multiple possible siblings into a single individual. (c) Mis‑reading “father’s brother” as “uncle” without checking whether the father has multiple brothers; the phrase “the brother” implies uniqueness. (d) Overlooking marital links that change generational level (e.g., “wife of my brother’s son” is a daughter‑in‑law, not a niece).

Speed technique: encode each relation as a vector (Δgen, Δgender, Δmarital). For example, “son” = (+1, male, none), “wife” = (0, female, married). Summing vectors along the described chain yields the net generational offset and gender of the target relative. This algebraic method reduces a verbal puzzle to arithmetic and eliminates diagramming errors under time pressure.

Direction‑Sense and Series Integration: Composite Displacement and Pattern Fusion

Direction‑sense questions track a moving point on a plane. The standard coordinate system uses North = +Y, East = +X. A right turn adds 90° clockwise to the current heading; a left turn subtracts 90°. After a sequence of moves (distance, turn, distance, …) the net displacement vector (ΔX, ΔY) is obtained by summing the component vectors of each leg. The straight‑line distance from the origin is √(ΔX² + ΔY²). The bearing from the origin is given by arctan(ΔY/ΔX) with quadrant correction. In exams, distances are usually integers, so the final distance often simplifies to an integer or a simple radical (e.g., 5√2).

Series questions frequently combine arithmetic, geometric, and positional patterns. A composite series may interleave two independent sub‑series (odd positions follow one rule, even positions another). Detect interleaving by writing terms with indices: 1, 2, 3, 4, 5, 6 … If differences of odd‑indexed terms form a constant sequence while even‑indexed terms follow a ratio, the series is interleaved. Another fusion is “difference of differences”: compute first differences, then second differences; constant second differences indicate a quadratic pattern (an² + bn + c). When letters appear, convert to positional values (A=1 … Z=26) and apply the same numeric analysis.

Hybrid problems present a direction‑sense walk where each step length is drawn from a numeric series. Example: “Start facing North. Move 3 m, turn right, move 5 m, turn left, move 8 m, turn right, move 13 m …” The step lengths 3, 5, 8, 13 follow a Fibonacci‑like recurrence (each term = sum of previous two). The solver must first generate the required number of terms, then apply the turn sequence to compute the final coordinate. This tests both series generation and vector addition in a single item.

Shortcut for hybrid items: write the heading after each turn as a unit vector (N = (0,1), E = (1,0), S = (0,−1), W = (−1,0)). Multiply each step length by its heading vector and accumulate. Because headings repeat every four turns, the heading sequence can be pre‑computed for the given turn pattern (e.g., R, L, R, L …). This reduces the problem to a dot‑product sum that can be evaluated mentally for small sequences.

Practice plan: create a spreadsheet that generates random turn strings (length 4‑8) and random series (arithmetic, geometric, Fibonacci, quadratic). Compute the final coordinate automatically, then solve manually to verify. Repeat until the combined reasoning becomes fluid — typically 15‑20 hybrid drills.

  • Assuming a universal statement carries existential import when the question follows Boolean interpretation.
  • Mis‑identifying the middle term in a syllogism, leading to an incorrect figure assignment.
  • Choosing an analogy option that shares a superficial category but reverses the direction of the relation.
  • Neglecting the “only” qualifier in blood‑relation statements, which collapses multiple possible siblings.
  • Forgetting to fix a reference point in circular arrangements, causing rotational ambiguity.
  • Treating a right turn as anticlockwise when the current heading is South or West.
  • Overlooking interleaved sub‑series and forcing a single pattern on the whole sequence.

Conditional Syllogisms and Hypothetical Reasoning

Conditional syllogisms extend categorical logic with implication statements (“If P then Q”). The two valid forms are modus ponens (P, If P then Q ⊢ Q) and modus tollens (¬Q, If P then Q ⊢ ¬P). Common fallacies are affirming the consequent (Q, If P then Q ⊢ P) and denying the antecedent (¬P, If P then Q ⊢ ¬Q). In exam items, antecedent and consequent are often embedded in passages; isolate the conditional core first. Rewrite statements symbolically, then apply a truth‑table check for the valid forms. When conditionals chain (If P then Q, If Q then R), hypothetical syllogism yields If P then R. This chaining is tested by presenting “if‑then” rules and asking which conclusion follows necessarily. Categorical and conditional premises may be mixed; solve the categorical part with Venn diagrams and the conditional part with propositional rules, then combine results. A conditional does not assert its antecedent; any conclusion assuming the antecedent without support is invalid.

Analogy Types: Functional, Causal, and Structural Mapping

Analogies are classified by the relation between pair terms. Functional analogies link object to purpose (knife : cut :: pen : write). Causal analogies link cause to effect (rain : flood :: spark : fire). Structural analogies link items with similar internal arrangement (atom : solar system :: cell : organism). Recognising the type guides the search for the answer. Systematic approach: (1) Express the stem relation concisely (“A is used to B”, “A causes B”, “A is a part of B”). (2) Test each option by substituting into the same phrase. (3) Discard options where the phrase fails or reverses. Distractors often share a superficial category but violate relational direction (tool : user vs. user : tool). “Double analogy” items require two independent relations simultaneously (e.g., “glove : hand :: sock : foot” and “glove : leather :: sock : cotton”); the correct option must satisfy both. Building a personal taxonomy of 30‑40 stem relations with verbal templates reduces cognitive load during the test.

Worked Example: Double Analogy
Select the pair that best matches the relationship in the stem: “Thermometer : Temperature :: Barometer : ?” Options: (A) Pressure (B) Altitude (C) Humidity (D) Wind
The stem shows an instrument‑to‑measurement relation: a thermometer measures temperature. The first term is the device, the second the quantity measured. Applying the same template: a barometer measures pressure. Option (A) Pressure fits. Option (B) Altitude is measured by an altimeter. Options (C) and (D) are unrelated. The correct answer is (A) Pressure.
Exam‑Day Strategy
For analogy clusters, write the relational phrase on the rough sheet before scanning options. This prevents selecting a categorically similar but relationally reversed pair. Allocate roughly 30 seconds per analogy; if no option fits, flag and return later.

Multi‑Layered Puzzle Solving: Constraint Propagation and Search Pruning

Complex arrangement puzzles (linear, circular, matrix) often involve 6‑10 entities with multiple attributes (colour, profession, floor, vehicle). An efficient method is constraint propagation: represent each entity as a node with a domain of possible values per attribute. Apply direct clues first (“A lives on floor 3”) to reduce domains. Then use relational clues (“B is immediately above C”) to enforce binary constraints, eliminating impossible pairs. When a domain collapses to one value, propagate that assignment to connected constraints. This iterative narrowing continues until a unique solution emerges or a branching point is reached. At a branch, choose the variable with the smallest remaining domain (minimum remaining values heuristic) and try values recursively, backtracking on contradiction. Maintain arc consistency after each assignment; if any domain empties, backtrack immediately. In timed conditions, solve the deterministic core on paper, then sketch a decision tree for the ambiguous sub‑puzzle. Questions often ask for a single attribute (e.g., “Who owns the red car?”), allowing you to stop once that attribute is fixed across viable branches. Practice with random constraint sets; aim to complete a typical 7‑entity, 4‑attribute puzzle in a few minutes.

Blood‑Relation Networks: Graph Representation and Cycle Detection

Blood‑relation problems can be modelled as a directed graph: vertices are individuals; edges encode parent‑child (directed upward), sibling (undirected), and marital (undirected, labelled “spouse”). Gender is a vertex attribute. A query (“How is X related to Y?”) becomes a shortest‑path problem with edge weights for generational steps (parent = +1, child = –1, sibling = 0, spouse = 0). The relationship name derives from net generational offset and target gender. Cycles appear when marital links connect branches (e.g., cousins marrying); they create multiple paths. The correct relationship follows the path with the smallest absolute generational sum, unless a unique route is specified (“the only brother”). Algorithmically, run breadth‑first search from the source, tracking cumulative offset and gender. On reaching the target, compute the label via a lookup table: offset 0 + same gender = brother/sister; offset 0 + opposite gender = sister/brother; offset +1 = father/mother; offset –1 = son/daughter; offset +2 = grandfather/grandmother; offset –2 = grandson/granddaughter; offset +1 with sibling edge = uncle/aunt; offset –1 with sibling edge = nephew/niece. Marital edges add the “in‑law” suffix without changing offset. This graph method helps avoid diagramming errors and handles “only” qualifiers by pruning sibling edges when a vertex has degree one in the sibling subgraph.

Series Fusion: Polynomial, Exponential, and Recursive Hybrid Patterns

Advanced series questions fuse independent patterns into one sequence. Common types: (1) Interleaved sub‑series – odd positions follow a quadratic rule (an²+bn+c), even positions a geometric progression (arⁿ⁻¹). Detect by separating indices and computing first/second differences per subsequence. (2) Recursive‑exponential blend – each term equals previous term times a constant plus a polynomial increment (Tₙ = k·Tₙ₋₁ + p(n)). Solve by iteration or characteristic equations. (3) Polynomial‑exponential hybrid – terms are sums of polynomial and exponential components (Tₙ = an²+bn+c + d·rⁿ). Identify by checking if successive ratios approach a constant while residuals follow a polynomial trend. Practical shortcut: write 8‑10 terms, compute successive ratios and differences in parallel columns. If ratios stabilise, isolate the exponential part by dividing by the estimated base; the remainder should reveal a polynomial. For letter series, convert to positional values (A=1…Z=26) first. Hybrid direction‑series items (step lengths from a fused series, turns from a fixed pattern) are solved by generating series terms, then applying vector addition. Recognising component “signatures” is key: constant second differences → quadratic; constant ratio → geometric; constant first differences → arithmetic; alternating signs → alternating series.

  • Assuming a conditional asserts its antecedent, leading to affirming the consequent.
  • Choosing an analogy option that matches category but reverses relational direction.
  • Neglecting to propagate constraints after domain reduction, leaving hidden contradictions.
  • Ignoring marital edges in blood‑relation graphs, causing incorrect generational offsets.
  • Forcing a single pattern on an interleaved series and missing alternating sub‑series.
  • Watch for these traps to avoid losing marks.

Practice Questions

← Numerical Ability ← Course Home