ICAR AICE-JRF/SRF Statistical Computing: Simulation, Resampling & Algorithms: 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
47written 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.
Checked against the exam body's published information. Formats and fees change; confirm the current edition there before you book.
Statistical Computing: Simulation, Resampling & Algorithms in ICAR AICE-JRF/SRF
The algorithms inside modern statistics: random-number generation, Monte Carlo integration, the bootstrap and jackknife, permutation tests, the EM algorithm, MCMC and numerical linear algebra, with attention to accuracy and reproducibility.
Our 47 ICAR AICE-JRF/SRF questions in this subject: 7 easy, 29 medium, 11 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
In acceptance–rejection, the proposal density g must satisfy:
f(x) ≤ c g(x) for all x
g(x) ≤ f(x) for all x in the support
g has lighter tails than f
g equals f at the mode only
Answer and working
A. f(x) ≤ c g(x) for all x
The envelope must cover the target everywhere; lighter tails would violate it.
Question 2 · easy
The probability that a given observation is absent from a bootstrap sample of size n = 100 is about:
0.63
0.01
0.50
0.37
Answer and working
D. 0.37
(1 − 1/100)¹⁰⁰ ≈ 0.366, close to e⁻¹; 0.63 is the chance it appears.
Question 3 · medium
The jackknife estimate of bias is:
θ̂₍.₎ − θ̂
(n − 1)(θ̂₍.₎ − θ̂)
n(θ̂ − θ̂₍.₎)
(θ̂₍.₎ − θ̂)/n
Answer and working
B. (n − 1)(θ̂₍.₎ − θ̂)
θ̂₍.₎ is the mean of the leave-one-out estimates.
Question 4 · hard
The jackknife variance estimate is inconsistent for:
The sample mean
A ratio estimator
The sample median
A correlation coefficient
Answer and working
C. The sample median
Leave-one-out medians change in jumps; use the bootstrap or delete-d jackknife.
Question 5 · medium
Jackknife pseudo-values are defined as:
(θ̂₍ᵢ₎ − θ̂)
nθ̂₍ᵢ₎
θ̂/θ̂₍ᵢ₎
nθ̂ − (n − 1)θ̂₍ᵢ₎
Answer and working
D. nθ̂ − (n − 1)θ̂₍ᵢ₎
Their mean gives the bias-corrected estimate.
Question 6 · medium
EM convergence is slow when:
The data are complete with no gaps
The model has one parameter
Starting values are exact
Much information is missing
Answer and working
D. Much information is missing
The rate is linear, governed by the missing information.
Question 7 · medium
Theory suggests a target acceptance rate for random-walk Metropolis in high dimensions of about:
0.90
0.23
0.05
0.50
Answer and working
B. 0.23
About 0.44 in one dimension.
Question 8 · medium
Column pivoting in QR is used in regression software to:
Speed up printing (of output)
Generate random numbers
Detect aliased columns
Remove outliers
Answer and working
C. Detect aliased columns
Aliased columns are reported as not estimable.
Question 9 · medium
How many replicates are needed for a Monte Carlo SE of 0.005 on 95% coverage?
1,000
1,900
400
19,000
Answer and working
B. 1,900
0.95 × 0.05/0.005² = 1,900.
Question 10 · medium
A useful check of a parallel simulation is that, with the same random streams, its results:
A study plan for Statistical Computing: Simulation, Resampling & Algorithms 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.
First, the heavy units (43% of the 47 questions): EM algorithm and its applications (missing data, mixtures) (5, 11%); MCMC algorithms in practice (5, 11%); Monte Carlo integration and variance reduction (5, 11%); Numerical linear algebra for statistics: QR and Cholesky (5, 11%).
Read the manual chapters for these first and do every worked question you can find on them.
Then the middle band: Bootstrap: percentile and BCa intervals (4, 9%); Generating random variates: inversion, acceptance-rejection and transformation methods (4, 9%); Jackknife (4, 9%); Parallel and high-performance computing for statistics (4, 9%).
Aim for one sitting per unit, then mixed questions across them.
Then the lighter units: Permutation and randomisation tests (4, 9%); Pseudo-random number generation and tests of randomness (4, 9%); Simulation studies: design and reporting (3, 6%).
Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.
Leave time for the hard ones: Monte Carlo integration and variance reduction (2 hard of 5), Bootstrap: percentile and BCa intervals (1 hard of 4), Generating random variates: inversion, acceptance-rejection and transformation methods (1 hard of 4).
Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.
Bank the easy marks: Simulation studies: design and reporting (1 easy of 3); Bootstrap: percentile and BCa intervals (1 easy of 4).
Do these early in revision so they are fast on the day.
Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.