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 papersICAR 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.
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.
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.
Which result needs countable additivity of P and cannot be proved from finite additivity alone?
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.
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?
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).
For the standard Cauchy distribution, with density 1/(π(1 + x²)), which statement is true?
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.
(X, Y) has joint density f(x, y) = 8xy on 0 < y < x < 1. Are X and Y independent?
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.
X₁, ..., Xₙ are iid uniform on (0, 1) and Mₙ is their maximum. What is the limiting distribution of n(1 − Mₙ)?
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.
For iid X₁, X₂, ..., Kolmogorov's strong law states that X̄ₙ converges almost surely to a finite constant if and only if:
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.
Fₙ is the empirical CDF of n iid observations from a CDF F. The Glivenko-Cantelli theorem states that:
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.
X̄ is the mean of n iid Poisson counts with mean λ = 4. What is the asymptotic variance of √n(log X̄ − log 4)?
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′².
f₁, f₂, ... are measurable real functions and fₙ(x) → f(x) for every x. Which statement is correct?
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.
X is standard normal, and Xₙ = −X for every n. Which statement is correct?
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.
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.
Read the manual chapters for these first and do every worked question you can find on them.
Aim for one sitting per unit, then mixed questions across them.
Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.
Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.
Do these early in revision so they are fast on the day.
Last updated · How Laisha writes and checks its pages · Report a mistake
US$10 a month · one price worldwide · cancel any time
| Free | Smarter | |
|---|---|---|
| Grow guides, pest pages, articles | Read all | Read all |
| Ask Laisha | 5 a day | Up to 1,000 a month |
| Exam practice | The sample on each page | Every question, timed papers |
| Crop calendar and pest alerts | — | For your own fields |
| Calculators and tools | — | All |
| Uploads and reports | — | 100 a month, real files |
An AI operating system for agriculture: free guides, manuals and tools written for every country.