LAISHA
Open Laisha

GATE ST Probability Theory: practice questions

GATE - Statistics (ST) · India · IITs and IISc on rotation (2027: IIT Madras)

Original practice questions written to the published syllabus · not past papers
10worked here, free
77written to this exam in this subject
11syllabus units

About GATE ST

GATE - Statistics (ST) is a postgraduate admission exam run by IITs and IISc on rotation (2027: IIT Madras), for candidates in India. Computer-based, 3 hours, 100 marks (15 General Aptitude + 85 subject). MCQ, MSQ and NAT; negative marking on MCQ only; on-screen virtual calculator.

Source: gate2026.iitg.ac.in.

Checked against the exam body's published information. Formats and fees change; confirm the current edition there before you book.

Probability Theory in GATE ST

Probability from its axioms to the limit theorems: random variables, expectation, generating functions, inequalities and modes of convergence, ending with the laws of large numbers and the central limit theorem that justify most of applied statistics.

Our 77 GATE ST questions in this subject: 20 easy, 38 medium, 19 hard, across 11 units.

10 practice questions, worked

Choose an answer, then open the working. Each explanation says why the right answer is right and why the others are not.

These 10 were written to GATE ST and are not shown on any other exam's page.

Question 1 · hard

X and Y are independent exponential variables with the same rate λ. Let U = X + Y and V = X/(X + Y). Which statement is correct?

  1. U is exponential with rate 2λ, V is uniform on (0, 1), and they are dependent
  2. U is gamma with shape 2, V is uniform on (0, 1), and U and V are independent
  3. U is gamma with shape 2, V is uniform on (0, 1), and they are dependent
  4. U is gamma with shape 2, V is beta(2, 2), and U and V are independent
Answer and working

B. U is gamma with shape 2, V is uniform on (0, 1), and U and V are independent

Inverse: x = uv, y = u(1 − v), |J| = u. Joint density λ²e^(−λu) u for u > 0, 0 < v < 1 factorises into a gamma(2, λ) density in u times 1 on (0, 1) in v: independent, V uniform (= beta(1, 1)). Rate 2λ describes the minimum, not the sum.

Question 2 · medium

X and Y are independent standard normals and R = √(X² + Y²). What is P(R > 2)?

  1. 0.0455
  2. 0.3679
  3. 0.0183
  4. 0.1353
Answer and working

D. 0.1353

R² = X² + Y² is chi-square(2), i.e. exponential with mean 2: P(R² > 4) = e^(−4/2) = e^(−2) = 0.1353. e^(−4) forgets the mean of 2; 0.0455 is P(|Z| > 2) for a single normal.

Question 3 · medium

Lyapunov's inequality states that (E|X|ʳ)^(1/r) is non-decreasing in r > 0. Which consequence follows?

  1. E|X|ʳ is finite for all r if it is finite for one r
  2. E|X| ≥ √E(X²) for every random variable
  3. If E(X²) is finite then E|X|³ is finite
  4. If E|X|³ is finite then E(X²) is finite
Answer and working

D. If E|X|³ is finite then E(X²) is finite

(E|X|²)^(1/2) ≤ (E|X|³)^(1/3), so a finite third absolute moment forces a finite second. The converse fails (a t-distribution with 3 df has finite variance but infinite third moment). The correct direction is E|X| ≤ √E(X²).

Question 4 · hard

X has mean μ and standard deviation σ, with no other information. By Cantelli's one-sided inequality, what is the sharpest bound on P(X − μ ≥ 2σ)?

  1. 0.125
  2. 0.25
  3. 0.0228
  4. 0.20
Answer and working

D. 0.20

Cantelli: P(X − μ ≥ kσ) ≤ 1/(1 + k²) = 1/5 = 0.20. Chebyshev's two-sided 1/k² = 0.25 is valid but weaker; halving it to 0.125 is not justified because the distribution need not be symmetric; 0.0228 is the normal tail.

Question 5 · medium

Xₙ converges in distribution to N(0, 1), and Yₙ converges in probability to 2. To what does XₙYₙ + 1 converge in distribution?

  1. N(3, 4)
  2. N(2, 4)
  3. N(1, 2)
  4. N(1, 4)
Answer and working

D. N(1, 4)

Slutsky: XₙYₙ → 2Z with Z ~ N(0, 1), i.e. N(0, 4); adding 1 gives N(1, 4). N(1, 2) forgets that the multiplier squares in the variance.

Question 6 · medium

∫₀¹ g(x) dx is estimated by (1/n)Σg(Uᵢ), where U₁, U₂, ... are iid uniform on (0, 1) and ∫₀¹|g(x)| dx < ∞. Which theorem guarantees that the estimate converges to the integral with probability one?

  1. Kolmogorov's strong law of large numbers
  2. The Lindeberg-Lévy central limit theorem
  3. The first Borel-Cantelli lemma alone
  4. Chebyshev's inequality on its own
Answer and working

A. Kolmogorov's strong law of large numbers

g(Uᵢ) are iid with mean ∫₀¹g and finite E|g(U)|, so by the SLLN their average converges almost surely. The CLT describes the size of the error (order 1/√n) and needs a finite variance; Chebyshev alone gives only convergence in probability.

Question 7 · easy

Which conditions does the Lindeberg-Lévy central limit theorem require of X₁, X₂, ...?

  1. Independent, identically distributed, with finite positive variance
  2. Independent, not necessarily identical, with a Liapounov moment condition
  3. Independent and normal, with means and variances allowed to vary
  4. Identically distributed with finite mean, any dependence allowed
Answer and working

A. Independent, identically distributed, with finite positive variance

Lindeberg-Lévy: iid with 0 < σ² < ∞. The non-identical case with a (2 + δ)-th moment condition is Liapounov's theorem. Normal summands need no limit theorem at all, since their sum is exactly normal.

Question 8 · hard

N is Poisson with mean 3 and, given N, S = X₁ + ... + X_N where the Xᵢ are iid Bernoulli(0.4), independent of N. What is the distribution of S?

  1. Negative binomial with mean 1.2
  2. Binomial with n = 3 and p = 0.4
  3. Poisson with mean 1.2
  4. Poisson with mean 3
Answer and working

C. Poisson with mean 1.2

G_S(s) = G_N(G_X(s)) = exp(3((0.6 + 0.4s) − 1)) = exp(1.2(s − 1)): Poisson with mean 3 × 0.4 = 1.2 (Poisson thinning). A binomial needs a fixed number of trials; the mean 3 ignores the thinning.

Question 9 · medium

An analyst back-transforms the mean of log-transformed yields by exponentiating it. Compared with the arithmetic mean yield, the result is:

  1. Never larger, because E(log Y) ≤ log E(Y) by Jensen's inequality
  2. Exactly equal, because exp and log are inverse functions
  3. Equal on average over repeated samples, with no systematic difference
  4. Never smaller, because exp(x) is convex and pushes the mean upward
Answer and working

A. Never larger, because E(log Y) ≤ log E(Y) by Jensen's inequality

exp(mean of log Y) is the geometric mean. Since log is concave, E(log Y) ≤ log E(Y), so the geometric mean never exceeds the arithmetic mean; they are equal only if Y is constant. Being inverse functions does not let exp and log pass through an expectation.

Question 10 · hard

X and Y are independent gamma variables with a common scale and shapes 3 and 2. What is the distribution of X/(X + Y)?

  1. Gamma with shape 5, independent of X + Y
  2. Beta(2, 3), independent of X + Y
  3. F with (6, 4) degrees of freedom
  4. Beta(3, 2), independent of X + Y
Answer and working

D. Beta(3, 2), independent of X + Y

For independent Gamma(α) and Gamma(β) with a common scale, X/(X + Y) ~ Beta(α, β) independent of X + Y ~ Gamma(α + β). Here α = 3, β = 2. Beta(2, 3) swaps the parameters; (X/6)/(Y/4) on chi-square scale would give an F, which is a different ratio.

A study plan for Probability Theory in GATE ST

This plan follows where our questions actually fall, so the time goes where the marks are likely to be. It is our reading of the syllabus, not the exam body's weighting.

  1. First, the heavy units (48% of the 77 questions): Functions of random variables and transformations (Jacobian method) (10, 13%); Expectation, moments and moment-generating, probability-generating and characteristic functions (9, 12%); Joint, marginal and conditional distributions; conditional expectation (9, 12%); Modes of convergence and their relations; Slutsky's lemma; Borel-Cantelli lemma (9, 12%).

    Read the manual chapters for these first and do every worked question you can find on them.

  2. Then the middle band: Inequalities: Markov, Chebyshev, Jensen and Cauchy-Schwarz (7, 9%); Random variables, distribution functions, mass and density functions (7, 9%); Weak and strong laws of large numbers (7, 9%); Central limit theorems (Lindeberg-Levy, Liapounov) and the delta method (6, 8%).

    Aim for one sitting per unit, then mixed questions across them.

  3. Then the lighter units: Sample spaces, sigma-fields and the axioms of probability (6, 8%); Elements of measure theory: measurable functions and Lebesgue integral (4, 5%); Conditional probability, independence and Bayes' theorem (3, 4%).

    Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.

  4. Leave time for the hard ones: Joint, marginal and conditional distributions; conditional expectation (3 hard of 9), Modes of convergence and their relations; Slutsky's lemma; Borel-Cantelli lemma (3 hard of 9), Central limit theorems (Lindeberg-Levy, Liapounov) and the delta method (2 hard of 6).

    Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.

  5. Bank the easy marks: Central limit theorems (Lindeberg-Levy, Liapounov) and the delta method (3 easy of 6); Random variables, distribution functions, mass and density functions (3 easy of 7).

    Do these early in revision so they are fast on the day.

  6. Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.

Last updated · How Laisha writes and checks its pages · Report a mistake

Ask Laisha about this

Opens Laisha's chat with your question ready to send. Sign in or start free.

Unlock every question — GATE ST Probability Theory

US$10 a month · one price worldwide · cancel any time

  • Every practice question in this subject, with full working
  • Timed exam papers and progress by unit
  • Ask Laisha to explain any answer — up to 1,000 questions a month
Free or Smarter
FreeSmarter
Grow guides, pest pages, articlesRead allRead all
Ask Laisha5 a dayUp to 1,000 a month
Exam practiceThe sample on each pageEvery question, timed papers
Crop calendar and pest alerts—For your own fields
Calculators and tools—All
Uploads and reports—100 a month, real files
10 days free for every new account, no card.