LAISHA
Open Laisha

ICAR AICE-JRF/SRF Probability Theory: practice questions

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) · India · National Testing Agency for ICAR

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

About ICAR AICE-JRF/SRF

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) is a PhD, fellowship and lectureship exam run by National Testing Agency for ICAR, for candidates in India. Computer-based test, 2 hours, 120 MCQs, +4 / -1 (Part A general, Part B core group, Part C subject). 2026 exam held with AIEEA-PG in July 2026.

Source: icar.org.in.

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

Probability Theory in ICAR AICE-JRF/SRF

Axioms and Bayes' theorem, generating functions, Chebyshev's inequality, modes of convergence, WLLN and SLLN conditions, Lindeberg-Lévy and Liapounov CLTs: theorem statements, conditions and one-step applications.

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 45 ICAR AICE-JRF/SRF questions in this subject: 6 easy, 22 medium, 17 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 ICAR AICE-JRF/SRF and are not shown on any other exam's page.

Question 1 · hard

Which result needs countable additivity of P and cannot be proved from finite additivity alone?

  1. If A₁ ⊃ A₂ ⊃ ... then P(Aₙ) converges to P(∩Aₙ)
  2. P(A) ≤ P(B) for any two events with A contained in B
  3. P(Aᶜ) = 1 − P(A) for every event A in the σ-field
  4. P(A ∪ B) = P(A) + P(B) − P(A ∩ B) for any two events
Answer and working

A. If A₁ ⊃ A₂ ⊃ ... then P(Aₙ) converges to P(∩Aₙ)

Continuity along monotone sequences is equivalent (given finite additivity) to countable additivity; there are finitely additive set functions for which it fails. The complement rule, the addition rule and monotonicity use only two disjoint pieces at a time, so finite additivity suffices for them.

Question 2 · hard

A seed lot is 'good' with prior probability 0.9 and 'poor' otherwise. Seeds from a good lot germinate independently with probability 0.9, from a poor lot with probability 0.5. Two seeds are tested and both germinate. What is the posterior probability that the lot is good?

  1. 0.7290
  2. 0.9419
  3. 0.9668
  4. 0.9000
Answer and working

C. 0.9668

Likelihoods: good 0.9² = 0.81, poor 0.5² = 0.25. Posterior = 0.9 × 0.81/(0.9 × 0.81 + 0.1 × 0.25) = 0.729/0.754 = 0.9668. 0.9419 uses only one seed; 0.7290 is the joint probability, not divided by P(both germinate).

Question 3 · medium

For the standard Cauchy distribution, with density 1/(π(1 + x²)), which statement is true?

  1. Its MGF M(t) exists near zero, but its variance is infinite
  2. Its characteristic function does not exist, because no moments exist
  3. Its mean is 0 by symmetry, and its variance is infinite
  4. Its characteristic function e^(−|t|) exists, but its mean does not
Answer and working

D. Its characteristic function e^(−|t|) exists, but its mean does not

∫|x|/(π(1 + x²)) dx diverges, so E(X) does not exist; symmetry does not rescue it because E|X| = ∞. E(e^(tX)) is infinite for every t ≠ 0, so there is no MGF. The CF always exists; here it is e^(−|t|), not differentiable at 0.

Question 4 · medium

(X, Y) has joint density f(x, y) = 8xy on 0 < y < x < 1. Are X and Y independent?

  1. No: the support is a triangle, not a product set, so they are dependent
  2. Yes: their covariance is zero, which proves independence directly
  3. Yes: the density factorises as 8x times y, so they are independent
  4. No: a joint density with constant 8 always indicates dependence
Answer and working

A. No: the support is a triangle, not a product set, so they are dependent

Factorisation is necessary but must hold on a rectangular support. Here y < x links the variables: given X = 0.2, Y cannot exceed 0.2. So they are dependent. In fact Cov(X, Y) is positive here, and the constant 8 is only the normalising factor.

Question 5 · hard

X₁, ..., Xₙ are iid uniform on (0, 1) and Mₙ is their maximum. What is the limiting distribution of n(1 − Mₙ)?

  1. Uniform on (0, 1)
  2. Degenerate at 0
  3. Exponential with mean 1
  4. Standard normal
Answer and working

C. Exponential with mean 1

P(n(1 − Mₙ) > x) = P(Mₙ < 1 − x/n) = (1 − x/n)ⁿ → e^(−x) for x > 0, the exponential with mean 1. Without the factor n, 1 − Mₙ itself is degenerate at 0; the CLT does not apply to maxima.

Question 6 · medium

For iid X₁, X₂, ..., Kolmogorov's strong law states that X̄ₙ converges almost surely to a finite constant if and only if:

  1. Var(X₁) > 0, and then the constant is the median
  2. the Xᵢ are bounded, and then the constant is 0
  3. E(X₁²) < ∞, and then the constant is E(X₁)
  4. E|X₁| < ∞, and then the constant is E(X₁)
Answer and working

D. E|X₁| < ∞, and then the constant is E(X₁)

Kolmogorov's SLLN: X̄ₙ → μ a.s. iff E|X₁| < ∞, with μ = E(X₁). A finite second moment is sufficient but not necessary; boundedness is far stronger than needed.

Question 7 · medium

Fₙ is the empirical CDF of n iid observations from a CDF F. The Glivenko-Cantelli theorem states that:

  1. Fₙ(x) = F(x) exactly once n exceeds the number of jumps of F
  2. sup over x of |Fₙ(x) − F(x)| → 0 almost surely
  3. √n(Fₙ(x) − F(x)) → N(0, 1) for each x
  4. Fₙ(x) → F(x) in probability, but only at continuity points of F
Answer and working

B. sup over x of |Fₙ(x) − F(x)| → 0 almost surely

Glivenko-Cantelli gives uniform almost-sure convergence of the empirical CDF, for any F. For fixed x, √n(Fₙ(x) − F(x)) → N(0, F(x)(1 − F(x))), not N(0, 1). Convergence holds at every x, including jumps.

Question 8 · hard

X̄ is the mean of n iid Poisson counts with mean λ = 4. What is the asymptotic variance of √n(log X̄ − log 4)?

  1. 0.25
  2. 4.00
  3. 1.39
  4. 0.0625
Answer and working

A. 0.25

√n(X̄ − λ) → N(0, λ). Delta method with g = log, g′(λ) = 1/λ: variance (1/λ)² × λ = 1/λ = 0.25. 0.0625 forgets to multiply by the Poisson variance λ; 4 forgets to multiply by g′².

Question 9 · medium

f₁, f₂, ... are measurable real functions and fₙ(x) → f(x) for every x. Which statement is correct?

  1. f is a simple function
  2. f is continuous
  3. f is integrable
  4. f is measurable
Answer and working

D. f is measurable

Pointwise limits of measurable functions are measurable, because f = lim sup fₙ and {lim sup fₙ ≤ x} is built from countable unions and intersections of measurable sets. Continuity and integrability are not preserved by pointwise limits.

Question 10 · hard

X is standard normal, and Xₙ = −X for every n. Which statement is correct?

  1. Xₙ → X in probability, because both are standard normal
  2. Xₙ → X almost surely, because the sequence is constant
  3. Xₙ → X in distribution but not in probability
  4. Xₙ does not converge to X in any of the usual modes
Answer and working

C. Xₙ → X in distribution but not in probability

Each Xₙ is standard normal, so Fₙ = F and Xₙ → X in distribution. But |Xₙ − X| = 2|X|, and P(2|X| > ε) does not tend to 0, so there is no convergence in probability (and hence none almost surely). Convergence in law concerns distributions only, not the variables themselves.

A study plan for Probability Theory in ICAR AICE-JRF/SRF

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 (60% of the 45 questions): Elements of measure theory: measurable functions and Lebesgue integral (9, 20%); Modes of convergence and their relations; Slutsky's lemma; Borel-Cantelli lemma (8, 18%); Central limit theorems (Lindeberg-Levy, Liapounov) and the delta method (5, 11%); Weak and strong laws of large numbers (5, 11%).

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

  2. Then the middle band: Expectation, moments and moment-generating, probability-generating and characteristic functions (4, 9%); Sample spaces, sigma-fields and the axioms of probability (4, 9%); Random variables, distribution functions, mass and density functions (3, 7%); Conditional probability, independence and Bayes' theorem (2, 4%).

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

  3. Then the lighter units: Functions of random variables and transformations (Jacobian method) (2, 4%); Inequalities: Markov, Chebyshev, Jensen and Cauchy-Schwarz (2, 4%); Joint, marginal and conditional distributions; conditional expectation (1, 2%).

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

  4. Leave time for the hard ones: Central limit theorems (Lindeberg-Levy, Liapounov) and the delta method (3 hard of 5), Sample spaces, sigma-fields and the axioms of probability (2 hard of 4), Conditional probability, independence and Bayes' theorem (1 hard of 2).

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

  5. Bank the easy marks: Weak and strong laws of large numbers (2 easy of 5); Sample spaces, sigma-fields and the axioms of probability (1 easy of 4).

    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 — ICAR AICE-JRF/SRF 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.