What are common examiner traps in Quantitative Aptitude?

Assuming standard deviation increases when a constant is added to every data point (standard deviation is shift-invariant). Averaging speeds directly rather than weighting by time (i.e. computing arithmetic mean instead of total distance divided by total time). Confusing perimeter/edge assignments when rolling a 2D sheet into a 3D cylinder (joining longer edges makes the longer edge the height, not the circumference). Forgetting to subtract the overlap term in two-set inclusion-exclusion problems. Assuming equal selling price with +x\% and -x\% results in zero net profit/loss instead of a net loss. Treating single-elimination tournament match counting as 2k instead of simply N-1 matches. Off-by-one errors when establishing sample size for discrete intervals (e.g., counting 2-digit numbers between 1 and 100 as 99 instead of 99 - 10 + 1 = 90). Omitting reflexive pairs in divisibility/multiple conditions (e.g., forgetting that a number is a multiple of itself, such as (k, k)). Forgetting permutations/order in pair enumeration (e.g., counting (1, 4) but missing (4, 1) when finding sums). Neglecting the binomial coefficient nk and only computing pk(1-p)n-k for ordered trials. Unreduced fractions vs unsimplified fractions in options (some questions keep denominators unsimplified like 75/216 or 15/36 while others reduce to simplest terms). Assuming a simple arithmetic progression rather than checking higher-order differences. Finding an increment that matches the previous term without validating that the subsequent term also satisfies the rule. Arithmetic errors when adding the increment to the preceding value. Adding an extra negative term beyond the zero/positive boundary, which reduces the maximum sum. Off-by-one errors when solving the inequality a + (n-1)d 0 for integer n. Confusing the index n with the actual value of the term an during sum evaluation.

Quantitative Aptitude

53 Qs · since 2011 · 80 marks · 6.2 marks/paperHigh yield

Take topic test

Quantitative Aptitude in GATE CS evaluates foundational mathematical reasoning, arithmetic, algebra, combinatorics, elementary probability, and geometry through concise word proble… Guide

Type

Topic guide

What does GATE test in Quantitative Aptitude?

Quantitative Aptitude in GATE CS evaluates foundational mathematical reasoning, arithmetic, algebra, combinatorics, elementary probability, and geometry through concise word problems and functional/graphical models. The questions emphasize direct application of core algebraic identities, logarithmic laws, rates, proportions, set intersections, and calculus-based optimization rather than heavy computation. Items are evenly distributed between 1-mark conceptual or single-step problems and 2-mark multi-step arithmetic, geometric, or conditional reasoning setups.

Core concepts

Logarithmic laws and exponential equations
Single-variable differentiation for profit maximization and cost minimization
Conditional probability, Law of Total Probability, and Bayes' Theorem
Permutations, combinations with repetition, and Inclusion-Exclusion Principle
Geometric mensuration (volume of cylinders, surface area of cubes, similar triangles)
Ratios, proportions, and percentage profit/loss calculations
Elementary number theory (prime factorizations, perfect cubes, prime properties)
Summary statistics (mean, median, effects of shift/scale transformations on standard deviation)
Piecewise linear functions and ramp functions (S-K, 0)
Linear systems of equations derived from word problems
Equally likely outcomes in discrete sample spaces
Systematic enumeration of two-dice outcome tables (6 6 = 36)
Combinations and selections without replacement nr
Binomial distribution for independent repeated trials
Divisibility, multiples, and prime number properties within bounded discrete sets
Complementary counting
First and second-order difference analysis
Polynomial/quadratic sequence identification
Missing term interpolation with cross-verification against subsequent terms
Sequences of consecutive odd/even numbers or primes as step increments
Arithmetic Progression (AP)
Common difference (d)
Maximum sum optimization in decreasing sequences (an 0)
Summation of finite arithmetic series

Recurring question patterns

Logarithmic and Algebraic Identities
common · MCQ · 1 marks · 2025, 2024, 2022, 2011
Simplifying logarithmic relations, exponential identities, or polynomial expressions using standard laws (e.g., product rule, power rule, AM-GM relations, or root substitution).
Optimization via Calculus or Quadratic Vertex
common · MCQ · 2 marks · 2012, 2011
Finding the production quantity, dimension, or coordinate that maximizes profit/height or minimizes cost by taking the first derivative $\frac{d}{dq}=0$ or finding the vertex of a parabola.
Probability and Conditional Reasoning
common · MCQ · 2 marks · 2026, 2022, 2017, 2012
Calculating joint, conditional, total probability, or binomial distribution probabilities involving draws with/without replacement, independent weather days, or binary classification tests (Bayes' Theorem).
Combinatorics and Inclusion-Exclusion
common · MCQ · 1 marks · 2026, 2025, 2024, 2017
Counting arrangements, permutations with restrictions, multiset combinations (stars and bars), tournament eliminations, or 2-set Venn diagram overlaps.
Percentages, Profit-Loss, and Ratios
common · MCQ · 1 marks · 2026, 2024, 2013
Computing overall profit/loss percentage on multiple items, coin denomination values, proportional distribution, or wage/workload changes.
Geometry and Mensuration
occasional · MCQ · 2 marks · 2025, 2024
Relating areas and volumes of shapes (cylinders formed by rolling rectangles, cubes, similar triangles, or rotated rectangles within squares).
Piecewise and Ramp Functions Analysis
occasional · MCQ · 2 marks · 2026, 2022
Integrating piecewise continuous functions to find area under curves or matching piecewise linear / ramp graphs to algebraic expressions using $\max(S - K, 0)$ .
Work, Rate, and Speed Problems
occasional · MCQ · 2 marks · 2013, 2011
Multi-stage journeys calculating harmonic/weighted average speed or resource-day backlog depletion systems.
Successive Dice Rolls with Arithmetic Constraints
common · MCQ · 2 marks · 2026
A fair 6-faced die is rolled twice in succession; students must systematically count pairs $(x, y)$ satisfying algebraic or number-theoretic relations (e.g., sum is prime, second roll is an integer multiple of the first roll).
Binomial Repeated Independent Trials
occasional · MCQ · 2 marks · 2025
An experiment (such as rolling a fair die $n$ times) is repeated independently, requiring the probability of observing a target face or outcome exactly $k$ times.
Object Selection without Replacement (Urn/Color Problem)
occasional · MCQ · 1 marks · 2017
Selecting a subset of items (e.g., 2 socks from colored groups) simultaneously or sequentially without replacement to find the probability of homogeneous attributes (e.g., same color).
Discrete Number Range Divisibility and Complementary Probability
occasional · MCQ · 2 marks · 2013
Selecting an integer uniformly at random from a specified range (e.g., 2-digit numbers) and computing the probability of satisfying or not satisfying a divisibility rule.
Missing Term in Difference-Pattern / Quadratic Sequence
occasional · MCQ · 1 marks · 2024
A finite sequence of numbers is given with one unknown variable in the middle or end. The sequence is solved by calculating the first-order differences between consecutive terms (which form an AP such as consecutive odd numbers) or identifying a quadratic form $T_n = n^2 + c$ .
Maximum/Minimum Sum of an AP
rare · MCQ · 1 marks · 2013
Given an arithmetic progression with positive initial terms and a negative common difference (or vice versa), determine the maximum sum by summing up to the last non-negative term.

Formulas GATE uses

Successive Dilution Formula

\text{Remaining Liquid} = V \left(1 - \frac{x}{V}\right)^n

Used when a volume $x$ is repeatedly drawn from a total volume $V$ of liquid and replaced with an equal amount of diluent $n$ times.

Overall Loss on Identical Selling Prices

\text{Loss \%} = \left(\frac{x}{10}\right)^2 = \frac{x^2}{100}\%

Used when two items are sold at the same selling price, one at a profit of $x\%$ and the other at a loss of $x\%$ .

Multiset Combinations (Stars and Bars)

\binom{n + r - 1}{r}

Used to count the number of ways to choose $r$ items from $n$ distinct types with replacement where order does not matter.

Principle of Inclusion-Exclusion (2 Sets)

|A \cup B| = |A| + |B| - |A \cap B|

Used to find the size of sets or union of events with mutual overlap.

Single Elimination Tournament Match Count

\text{Total Games} = N - 1

Used to find total matches played in a pure knockout tournament of $N$ players to declare one champion.

Bayes' Rule for Binary Partitions

P(B \mid A) = \frac{P(B)P(A \mid B)}{P(B)P(A \mid B) + P(B^{\prime})P(A \mid B^{\prime})}

Used to determine posterior probability of a specific source given a successful test outcome.

Average Speed

\text{Average Speed} = \frac{\text{Total Distance}}{\text{Total Time}} = \frac{D}{\sum \frac{d_i}{v_i}}

Used when a journey is split into segments with varying speeds over specified fractional distances.

Min/Max Algebraic Form

\min(x, y) = \frac{(x+y) - |x-y|}{2}, \quad \max(x, y) = \frac{(x+y) + |x-y|}{2}

Used to represent minimum or maximum of real variables in closed algebraic form without piecewise branches.

Classical Definition of Probability

P(E) = \frac{n(E)}{n(S)}

Used across all uniform discrete sample space problems where every elementary event is equally likely.

Binomial Distribution PMF

P(X = k) = \binom{n}{k} p^k (1 - p)^{n - k}

Used when finding the probability of exactly $k$ successes in $n$ independent Bernoulli trials with success probability $p$ .

Combinatorial Selection of Identical Subgroups

P(\text{same category}) = \frac{\sum_{i=1}^{m} \binom{c_i}{r}}{\binom{N}{r}}

Used when selecting $r$ items from a total pool of $N$ items divided into $m$ distinct groups of sizes $c_1, c_2, \dots, c_m$ without replacement.

Complementary Probability

P(E^c) = 1 - P(E) = \frac{n(S) - n(E)}{n(S)}

Used when counting outcomes not satisfying a property (such as not divisible by $d$ ).

First-order Difference

d_n = T_{n+1} - T_n

Used to check if successive increments follow a linear progression (e.g., $3, 5, 7, 9, 11$ ).

Quadratic General Term

T_n = a n^2 + b n + c

Used when the second differences are constant, matching patterns like $T_n = n^2 + 5$ .

General Term of an Arithmetic Progression

a_n = a + (n-1)d

Used to find the $n^{\text{th}}$ term of an AP or determine the cutoff index $n$ where $a_n \ge 0$ .

Sum of First n Terms of an AP

S_n = \frac{n}{2}[2a + (n-1)d] = \frac{n}{2}(a + a_n)

Used to calculate the cumulative sum of the first $n$ terms of an arithmetic progression.

Examiner traps in Quantitative Aptitude

Assuming standard deviation increases when a constant is added to every data point (standard deviation is shift-invariant).
Averaging speeds directly rather than weighting by time (i.e. computing arithmetic mean instead of total distance divided by total time).
Confusing perimeter/edge assignments when rolling a 2D sheet into a 3D cylinder (joining longer edges makes the longer edge the height, not the circumference).
Forgetting to subtract the overlap term in two-set inclusion-exclusion problems.
Assuming equal selling price with +x\% and -x\% results in zero net profit/loss instead of a net loss.
Treating single-elimination tournament match counting as 2k instead of simply N-1 matches.
Off-by-one errors when establishing sample size for discrete intervals (e.g., counting 2-digit numbers between 1 and 100 as 99 instead of 99 - 10 + 1 = 90).
Omitting reflexive pairs in divisibility/multiple conditions (e.g., forgetting that a number is a multiple of itself, such as (k, k)).
Forgetting permutations/order in pair enumeration (e.g., counting (1, 4) but missing (4, 1) when finding sums).
Neglecting the binomial coefficient nk and only computing pk(1-p)n-k for ordered trials.
Unreduced fractions vs unsimplified fractions in options (some questions keep denominators unsimplified like 75/216 or 15/36 while others reduce to simplest terms).
Assuming a simple arithmetic progression rather than checking higher-order differences.
Finding an increment that matches the previous term without validating that the subsequent term also satisfies the rule.
Arithmetic errors when adding the increment to the preceding value.
Adding an extra negative term beyond the zero/positive boundary, which reduces the maximum sum.
Off-by-one errors when solving the inequality a + (n-1)d 0 for integer n.
Confusing the index n with the actual value of the term an during sum evaluation.

How questions are asked

Algebraic equivalence evaluation (which option is necessarily true)
Multi-step word problem with linear equation formulation
Probability calculation under non-uniform or dependent sequential rules
Graphical function matching (piecewise or ramp definitions)
Combinatorial selection/arrangement counting with restrictions
Geometric dimension and area/volume ratio calculation
Single-event discrete interval selection with number-theoretic filter
Simultaneous multi-item selection from multi-colored set
Repeated die roll with exact success count condition
Sequential two-die roll with pair relationship condition (sum, multiple, difference)
Find the missing term x in a given numerical sequence
Find the maximum or minimum sum of a given sequence

Paper trends

Shift from standard single-variable calculus optimization toward discrete structures, functional properties, and number theory parity/prime properties.
2025, 2023, 2012, 2011
Introduction of graphical interpretation items requiring translation between diagrams (trapezoids, ramps, histograms/tables) and algebraic formulas.
2026, 2025
Increased presence of clean elementary algebra and logarithm simplifications requiring minimal arithmetic but solid conceptual symmetry.
2025, 2024
Dice-based multi-stage experiments have become a primary recurring theme in recent General Aptitude sections, with both sets of 2026 focusing on successive 2-roll outcomes.
2026, 2025
Questions remain consistently placed as 2-mark MCQs in General Aptitude, emphasizing rapid, error-free case enumeration and standard fractional representation.
2026, 2025, 2013
Tested as a 1-mark multiple-choice question in General Aptitude to evaluate fast quantitative pattern matching without heavy computational overhead.
2024
Appeared as a straightforward 1-mark Multiple Choice Question in General Aptitude testing sequence maximization properties.
2013

Difficulty notes

Easy questions (1 mark) involve single-concept direct computation such as applying log laws, median calculation on small samples, single-elimination tournament rounds, or 1-variable linear equations. Medium questions (2 marks) require constructing a multi-variable system (such as truck backlog clearing over time, multi-stage travel, or combined trigonometry/geometry inside shapes) or conditional probability with varying replacement conditions.