Indian Statistical Institute admission tests (BStat, MStat, JRF in Statistics) · India · Indian Statistical Institute
Original practice questions written to the published syllabus · not past papersIndian Statistical Institute admission tests (BStat, MStat, JRF in Statistics) is a postgraduate admission exam run by Indian Statistical Institute, for candidates in India. Written tests in two parts: an objective mathematics/statistics test and a descriptive subject test, followed by interview for some programmes (reported). JRF selection by written test and interview.
Official site: isical.ac.in.
We have not been able to confirm these details against the exam body's own specification, so fees, dates and pass marks are left out on purpose. Check the current format, eligibility, fees and dates on the official site.
The optimisation theory statisticians use: linear programming with simplex and duality, transportation and assignment, integer and goal programming for farm and crop planning, non-linear optimisation with Kuhn-Tucker conditions, and the numerical optimisers inside likelihood estimation. The Agribusiness track teaches operations research for managers; this goes to the theory.
Our 41 Indian Statistical Institute admission tests questions in this subject: 4 easy, 28 medium, 9 hard, across 10 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 Indian Statistical Institute admission tests and are not shown on any other exam's page.
In the entering column, no entry is positive. What does this show?
B. The problem is unbounded
The entering variable can increase without any basic variable becoming negative.
When is a branch-and-bound node fathomed?
A. Infeasible, integral, or no better bound
Each of the three conditions shows that no better integer solution can lie in that branch.
Why are KKT points not enough to find maximum-likelihood estimates of a normal mixture?
A. Non-concavity: local optima
Non-concave likelihoods have several stationary points; multiple starts or global methods are needed.
Which statistical algorithm is an application of dynamic programming?
D. The Viterbi algorithm
Viterbi finds the most probable hidden state path by a DP recursion; sequence alignment is another example.
What does the BFGS method approximate?
D. The Hessian, from gradients
Quasi-Newton updates build curvature information without computing second derivatives.
Let the feasible set of a linear program be non-empty and bounded. Which statement is always true?
B. An optimal solution is attained at an extreme point of the feasible set
A linear function on a non-empty compact polyhedron attains its maximum, and since the polyhedron is the convex hull of its finitely many extreme points, the maximum is attained at one of them. The optimum need not be unique: an objective parallel to an edge gives a whole edge of optima. Extreme points generally have different objective values. Containing the origin says nothing about the optimal value.
For the primal problem max cᵀx subject to Ax ≤ b, x ≥ 0, suppose the objective is unbounded above on the feasible set. Then the dual problem:
C. Is infeasible
By weak duality every dual feasible y gives bᵀy ≥ cᵀx for all primal feasible x; if the primal is unbounded no finite bᵀy can bound it, so the dual can have no feasible point. An unbounded dual would force the primal to be infeasible, not unbounded. A unique dual optimum or a zero value would give a finite bound on the primal, which is a contradiction.
For max 3x₁ + 2x₂ subject to x₁ + x₂ ≤ 4, x₁ + 3x₂ ≤ 6, x₁, x₂ ≥ 0, the primal optimum is x = (4, 0). By complementary slackness the optimal dual solution (y₁, y₂) is:
D. (3, 0)
At x = (4, 0) the second constraint is slack (4 < 6), so y₂ = 0; x₁ > 0 makes the first dual constraint tight, y₁ + y₂ = 3, so y₁ = 3, and bᵀy = 12 = cᵀx confirms optimality. (0, 1) gives y₁ + y₂ = 1 < 3, infeasible. (2, 1/3) has y₂ > 0 on a slack constraint. (7/2, −1/2) solves both dual constraints as equations but has a negative y₂.
An n × n assignment problem is written as a transportation problem with unit supplies and demands. For n ≥ 2, every basic feasible solution is:
A. Degenerate, as only n of its 2n − 1 basic variables are positive
Each row and column receives exactly one unit, so exactly n cells are positive while a basis has 2n − 1 variables; the other n − 1 are basic at zero, which is why the Hungarian method is used in place of the transportation simplex. All 2n − 1 cannot be positive because only n assignments exist. Feasibility does not need symmetry. Non-negative costs do not make every basic solution optimal.
For which values of k is f(x, y) = x² + kxy + y² a convex function on ℝ²?
C. |k| ≤ 2
The Hessian is [[2, k], [k, 2]], which is positive semidefinite when its diagonal is non-negative and its determinant 4 − k² ≥ 0, so |k| ≤ 2. Negative k down to −2 is allowed, so 'k ≥ 0 only' is wrong. For |k| > 2, for example k = 3, f(1, −1) = −1 < 0 = f(0, 0) shows non-convexity. |k| ≤ 1 is sufficient but leaves out 1 < |k| ≤ 2.
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.