GateAI

GATE CSE Analytical Aptitude PYQs

Medium yield9.3% of General Aptitude

Analytical Aptitude in GATE CS evaluates logical reasoning, spatial deduction, constraint satisfaction, and basic graph/connectivity logic. Recent years have di… Read the guide

Questions
11
Asked
since 2017
Total marks
18
Marks / paper
1.4

11 GATE CSE Analytical Aptitude PYQs with solutions, from General Aptitude. Browse all GATE CSE PYQs.

Questions

Every official paper that asked this topic, newest first.

What GATE tests in Analytical Aptitude

Concepts, patterns, formulas and traps distilled from past papers.

Analytical Aptitude in GATE CS evaluates logical reasoning, spatial deduction, constraint satisfaction, and basic graph/connectivity logic. Recent years have distinctly favored visual, grid-based, and structural puzzles (such as Minesweeper/Nonogram-style constraint grids and planar zone connectivity) alongside classical seating arrangements and demographic proportion deductions. Questions predominantly appear in the 2-mark category and require systematic elimination of options based on clear structural constraints.

Core concepts

  • Circular and square seating arrangements with inward facing orientation
  • Discrete grid neighborhood calculation (corners, edges, and internal cells)
  • Matrix row and column marginal constraint verification
  • Planar dual graphs and spanning tree connectivity for geographic regions
  • Set-theoretic proportions and logical deductions from percentages
  • Strict linear orderings and transitive relation chaining
  • Circular seating arrangements and neighbor parity constraints
  • Classical mislabeled container disambiguation
  • Aristotelian categorical propositions (A, E, I, O statements) and contrary relations
  • Constraint satisfaction and proof by contradiction in sequential stages
  • Generational hierarchy (Parent-Child, Grandparent-Grandchild)
  • Collateral relationships (Siblings, Uncle/Aunt, Niece/Nephew)
  • Gender determination and ambiguity (explicit gender vs unspecified gender)
  • Cardinality of descendants (at least vs exactly one son/daughter)

Recurring question patterns

  • Grid and Adjacency Constraint Puzzles

    CommonMCQ2 marks2026, 2024

    A 2D grid (N×NN \times N) is presented where cells contain numbers, markers, or shading rules based on neighboring cell counts (including diagonals) or marginal row/column constraints (Nonogram style). The test-taker must infer missing values or identify valid grid configurations.

  • Graph Connectivity and Spanning Structures

    OccasionalMCQ2 marks2025

    A spatial map or planar layout divided by boundaries (e.g., river segments) is provided. Test-takers must select the minimal set of bridges/edges that connects all disjoint zones without redundancy (finding a valid spanning tree).

  • Arrangements and Relative Positioning

    OccasionalMCQ1 marks2017

    A small group of entities (e.g., 4 people) are arranged around a geometry (square/circular table) facing inward. Relative orientation clues (left/right) are used to deduce exact placements and opposite pairs.

  • Categorical Proportions and Demographic Inference

    OccasionalMCQ2 marks2022

    A short text prompt supplies subgroup percentages for disjoint sets across two stages (e.g., appeared vs. qualified candidates). Test-takers evaluate logical inferences regarding absolute or relative subgroup sizes.

  • Linear and Directional Relative Ordering

    OccasionalMCQ1 marks2017

    Determining exact positions or median elements in a sequence from a collection of pairwise relative positional statements (e.g., East/West or Left/Right).

  • Circular Seating Arrangement under Attribute Constraints

    OccasionalMCQ2 marks2017

    Arranging a set of individuals with binary attributes (e.g., gender, handedness) around a circle such that local neighborhood conditions (immediate left/right) and global count bounds are satisfied.

  • Truth and Mislabeling Logic Puzzles

    OccasionalMCQ2 marks2017

    Determining an optimal single-query decision strategy to disambiguate fully mislabeled entities or boxes containing discrete items.

  • Square of Opposition and Categorical Quantifiers

    OccasionalMCQ1 marks2022

    Identifying incompatible pairs of quantified statements (Universal Affirmative, Universal Negative, Particular Affirmative, Particular Negative) over non-empty domains.

  • Multi-Round Elimination and Ranking Deduction

    OccasionalMCQ2 marks2026

    Deducing exact round-wise performance or rank occurrences for participants in an event by sequentially eliminating rounds using given conditions and contradictions.

  • Blood Relations Multi-Statement Evaluation

    CommonMCQ1 marks2025

    A set of pairwise relationship facts among 4 to 5 individuals is provided, followed by numbered assertion statements evaluating ancestral, collateral (e.g., uncle/aunt), or cardinality (e.g., number of sons/daughters) claims. Candidates determine which subset of statements is conclusively true.

Formulas GATE uses

Minimum Spanning Edges for Connectivity

∣Emin⁡∣=∣V∣−1|E_{\min}| = |V| - 1

Determining the minimum number of bridges required to connect nn disjoint land zones.

Moore Neighborhood / 8-Way Adjacency

Neighbors(r,c)={(i,j)∣∣i−r∣≤1,∣j−c∣≤1,(i,j)≠(r,c)}\text{Neighbors}(r, c) = \{(i, j) \mid |i - r| \le 1, |j - c| \le 1, (i, j) \neq (r, c)\}

Calculating the count of surrounding cells (including diagonals) on a discrete grid boundary or interior.

Complementary Percentage Share

P(Complement)=100%−P(Category)P(\text{Complement}) = 100\% - P(\text{Category})

Deducing binary group percentages (e.g., % of girls given % of boys) within candidate pools.

Transitive Ordering Chain

A<B∧B<C  ⟹  A<B<CA < B \land B < C \implies A < B < C

Used in linear ranking/positional questions to construct a unique total order from pairwise relative constraints.

Categorical Contrary Relation

(∀x∈S,P(x))∧(∀x∈S,egP(x))≡Falsefor ∣S∣≥1(\forall x \in S, P(x)) \land (\forall x \in S, eg P(x)) \equiv \text{False} \quad \text{for } |S| \ge 1

Used to establish that Universal Affirmative (All S are P) and Universal Negative (No S are P) cannot both be true simultaneously on a non-empty set.

Examiner traps in Analytical Aptitude

  • Miscounting corner or border cells in grids by assuming all cells have 8 neighbors instead of 3 (corners) or 5 (edges).
  • Confusing relative 'left' and 'right' when people face the center from different table orientations (e.g., North-facing vs South-facing).
  • Selecting a subset of edges that has the correct count (n-1) but contains a cycle, leaving one or more regions disconnected.
  • Conflating percentages of a subgroup across different reference bases (e.g., % of appeared candidates vs % of qualified candidates).
  • Assuming pairwise relative positioning (e.g., 'A is West of B') implies immediate adjacency rather than strict inequality.
  • Selecting 'Cannot be determined' prematurely when systematic case elimination yields a unique solution.
  • Confusing contrary statements (cannot both be true) with subcontrary statements (cannot both be false) in quantifier logic.
  • Overlooking the mislabeling invariant—forgetting that a box labeled 'Both' cannot contain both items.
  • Failing to check if a round's maximum performance violates previous ranking standings.
  • Assuming an unstated gender for an intermediate node (e.g., assuming Q is male or female when only parenthood is defined)
  • Conflating 'at least one' with 'only one' (e.g., failing to see that having two daughters invalidates 'has only one daughter')
  • Assuming uniqueness of children or siblings when the problem does not state 'only child'

How questions are asked

  • Evaluate missing grid values from neighborhood rules
  • Select matching shaded grid from row/column constraint totals
  • Identify minimum edge set connecting all map zones
  • Determine opposite pairs in table seating arrangement
  • Identify valid logical inference from binary demographic splits
  • Identify the middle element in a relative linear ordering
  • Determine the exact count of a subpopulation satisfying circular seating conditions
  • Identify which single box/item to inspect to resolve mislabeled states
  • Identify which pair of quantified statements cannot be simultaneously true
  • Deduce the specific round/stage an event occurred using constraint elimination
  • Multi-statement logical validity evaluation from relational bullet points

Paper trends

  • Shift from purely text-based logic/seating arrangements towards visual diagram-based combinatorial and grid puzzles carrying 2 marks.

    2026, 2025, 2024

  • Integration of fundamental computer science concepts (like graph connectivity, spanning trees, and Moore neighborhood counting) into intuitive General Aptitude visual puzzles.

    2025, 2024

  • Questions in 2017 emphasized classic puzzle archetypes such as relative linear orderings, mislabeled box logic, and circular seating arrangements.

    2017

  • Recent papers introduced formal propositional relations (Square of Opposition contraries) and narrative-driven real-world constraint deductions (multi-round sports outcomes).

    2026, 2022

  • Blood relations and deductive reasoning are tested as 1-mark conceptual aptitude MCQs focusing on strict logical necessity rather than complex tree computations.

    2025

Difficulty notes

Easy items (1-2 marks) involve direct verification of row/column sums, simple seating deduction of 4 positions, or basic complementary percentage comparisons. Medium items (2 marks) require multi-step spatial reasoning, such as identifying both the minimal edge count and cycle-free connectivity across multiple map regions, or carefully evaluating 8-way neighbor counts across edge-boundary grid cells.