GATE Instrumentation (IN): Engineering Mathematics (linear algebra, calculus, differential equations, complex variables, probability, numerical methods), previous-year questions solved, part 5
Part 5 of 5 of the Engineering Mathematics hub: 11 more official GATE IN questions on probability and statistics and numerical methods, each solved step by step and checked against the official answer key. The other parts cover linear algebra: rank, eigenvalues and linear systems, calculus and vector calculus, differential equations and complex variables.
Questions from official GATE IN papers (IIT Kharagpur 2022, IIT Kanpur 2023, IISc Bengaluru 2024, IIT Roorkee 2025, IIT Guwahati 2026); solutions by Skill-Lync. · Updated 19 Nov 2026 · 11 of 44 questions on this page
Six red and four blue balls, three drawn without replacement: P(second and third are red)
A bag contains six red balls and four blue balls. If three balls are drawn in succession without replacement, the probability that the second and third balls drawn are red is ________ (round off to two decimal places)
Answer: Official key: 0.32 to 0.34
- Without replacement, each draw changes the bag, so multiply conditional probabilities along the sequence. The first ball is not restricted, so split on whether it is red or blue: the two cases are mutually exclusive and cover everything.
- First ball red: .
- First ball blue: .
- Add the cases: . (Draw order does not matter for probabilities of a fixed position, so the second and third being red has the same chance as the first and second being red, .)
Trap: giving by counting only the case where the first ball is also red. Enumerating all ordered triples of the ten distinct balls with exact fractions gives ; the slip value is .
Sampling without replacement is how a batch of sensors or transmitters is inspected: pulling units from a lot changes the odds for the next pull. The same conditional-probability bookkeeping gives the chance that two units in a row from a lot with a known number of faulty parts are good.
E[X] - E[X^2] for X taking values 0, 1, 2 with P(X = 0) = 0.25 and P(X = 1) = 0.5
Answer: Official key: -0.5 to -0.5
- Probabilities of all outcomes add to 1, so the missing one is .
- The expectation of a discrete variable is . For : .
- For : .
- .
Trap: finding as , which gives . The two are different, and their gap is the variance. We recomputed with exact fractions: , , .
Expectations of a variable and of its square give the mean and the variance of a sensor reading. The variance, the gap between the mean square and the square of the mean, is the number used to quote noise and repeatability of a measurement.
Five-digit numbers from the integers 3, 4, 5 and 6 with exactly one digit appearing twice
Answer: Official key: 240 to 240
- Five places and four available digits. If one digit appears twice, the remaining three places are filled with the other three digits, one each, so all four digits are used: the multiset of digits is .
- Choose which digit is repeated: ways.
- Arrange the five digits in the five places. With a repeated digit, the number of distinct arrangements is , because swapping the two identical digits gives the same number.
- Total .
Trap: using per choice and getting , forgetting that the two equal digits are interchangeable. We enumerated all strings of the four digits in code and counted those whose digit counts are 2, 1, 1, 1: exactly 240. The official key follows this reading, in which the other digits appear once each. (A looser reading, 'exactly one digit appears exactly twice', would add the strings with counts 2 and 3, 120 more, for 360, which is not the keyed value.)
Counting arrangements with repeated symbols is how test engineers size exhaustive test sets and code spaces, for example how many distinct codes a sensor with a few symbol values can transmit. It is also the first step in working out the probability of a particular pattern in a data stream.
One team from each of two pools reaches the final: probability of one blue and one red jersey
If one team from each pool reaches the final, the probability that one team has a blue logo jersey and another has a red logo jersey is ______ (rounded off to one decimal place).
Answer: Official key: 0.5 to 0.5
- Each pool has 8 teams, and one finalist is taken from each. Assuming every team is equally likely, the colour of the Pool-A finalist is independent of the colour of the Pool-B finalist, so the probabilities multiply.
- Pool-A: and . Pool-B: and .
- The two colours differ in exactly two ways that cannot happen together: A blue with B red, or A red with B blue. Add them: 0.5.
Trap: counting only one of the two mixed cases ( or ). Check by the complement: both blue is and both red is , so the mixed case is . We enumerated all team pairs with exact fractions: 1/2 of them mix the colours.
Adding the probabilities of the separate ways an event can happen, and multiplying along independent stages, is how the chance of a combined fault is worked out, for example one of two redundant sensors reading high while the other reads low. It is the first step in a failure-mode count for a measurement chain.
Random variable with density f(x) = e^(-x) for x >= 0: probability that X > 2
Answer: Official key: 0.130 to 0.140
- The probability that a continuous random variable lies in a range is the area under its density over that range. For this is the tail area from to infinity.
- .
- 0.135 (more precisely 0.13534).
Trap: giving the cumulative value , which is the other side of the line. We evaluated the integral exactly with sympy (0.13534) and by a numerical sum out to (0.13534), and checked it equals . The official key accepts 0.130 to 0.140.
The exponential density describes the waiting time between random events, such as the time between failures of a sensor with a constant failure rate. The tail probability then gives the chance that the device survives beyond a given time, which is the reliability figure used in maintenance planning.
Probability that a student misses at most one of 10 classes when each is missed with probability 0.1
Answer: Official key: 0.72 to 0.76
- Each class is an independent trial with a miss probability . The number of misses out of is binomial: .
- Not missing more than one class means : zero misses or exactly one miss.
- .
- .
- Add: .
Trap: giving only the one-miss case, , or only the zero-miss case, . The complement, at least two misses, is , so missing more than one would have probability , not what was asked. We checked by adding up the probability of all attendance patterns with at most one miss, using exact fractions: , which agrees with the binomial sum.
The same binomial arithmetic gives the chance that at most one of ten sensors in a redundant bank fails during a maintenance interval. It is the basic calculation behind spare-sensor counts and voting schemes in safety instrumentation.
Median of the data set 1, 2, 0, -1, -3, 1, 2, 0, 1 (nearest integer)
The median of the data set is ____. (rounded off to the nearest integer)
Answer: median Official key: 1 to 1
- The median is the middle value of the data once it is sorted. With an odd number of values it is the value in position .
- Sort the 9 values: .
- The 5th value is the middle one: positions 1 to 4 hold and positions 6 to 9 hold .
- The median is .
Trap: finding the mean instead. The mean is , which rounds to 0, a different answer. The median ignores how large the extreme values and are and only looks at the middle of the ordered list. We sorted the data in code and took the middle entry, then confirmed the mean differs.
The median is used to reject spikes in sensor data: a median filter over the last few readings removes a single bad sample without smearing edges, unlike an average. It is a standard first step on noisy pressure, flow and level signals.
3 apples and 2 oranges, two drawn in succession: probability first is an apple and second an orange
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- Principle: the probability of a sequence of dependent events is the product of the first probability and the conditional probability of the second given the first. The fruit is removed, so it is not replaced.
- First fruit is an apple: .
- After one apple is gone, the box holds 2 apples and 2 oranges, so .
- . Option (C).
Trap: using for the second draw, as if the first fruit had been put back, which gives (not an option), or stopping at (option A). We listed all 20 ordered pairs of distinct fruits with itertools and counted those with an apple first and an orange second: 6 of 20, which is 3/10.
Sampling without replacement is how acceptance testing of a batch of instruments works: pulling units one after another from a small lot changes the chance of finding a defective one at each draw. The same conditional-probability chain is used to estimate fault probabilities in redundant sensor sets.
Newton-Raphson on f(x) = x - cos(x) with initial guess x0 = 0: find x1
The Newton-Raphson method is applied to determine the solution of where . If the initial guess of the solution is , the value of the next approximation is ________ (round off to two decimal places)
Answer: Official key: 0.99 to 1.01
- Newton-Raphson replaces the curve by its tangent at the current guess and uses where the tangent crosses zero as the next guess: .
- Here . At : and .
- So .
Trap: forgetting the sign of and writing . Our code took one Newton step with a numerical slope () and with the exact derivative (); both give . The root itself is , so the first step overshoots, as a tangent often does.
Newton-Raphson is the workhorse inside solvers that linearise a nonlinear sensor curve or a thermocouple polynomial to recover a reading from a voltage. Each step costs one function value and one slope, and a few steps usually reach the accuracy the instrument needs.
Improved Euler method, one step h = 0.1 for dy/dt = y + 2t - t^2, y(0) = 1: value of y at t = 0.1
Answer: Official key: 1.10 to 1.12
- The improved Euler (Heun) method takes a trial step with the slope at the start, then moves the real step with the average of the slope at the start and the slope at the trial point. Think of it as checking where the road is heading before committing to a direction.
- Slope at the start: .
- Trial value: .
- Slope at the trial point: .
- Corrected value: .
- Rounded to two decimals, 1.11.
Trap: stopping after the trial step, which is plain Euler and gives , or averaging the wrong pair of slopes. The exact solution of this equation is , so ; one improved Euler step lands within 0.001 of it. We ran the two stages in exact fractions and compared with the closed form to confirm . The official key accepts 1.10 to 1.12.
Stepping an ordinary differential equation forward with a predictor and a corrector is how simulators advance a process model, a thermal model of a sensor or a simple controller test in software. The two-slope average is the simplest step that is noticeably more accurate than plain Euler for the same step size.
Newton-Raphson for the inverse of 1.6: which initial guess fails to converge
- (A)0.55
- (B)0.75
- (C)1.15
- (D)1.25
Answer: (D) Official key: D
- To compute without dividing, solve . Newton-Raphson updates .
- Here , so . Only multiplication is left.
- Let the error be (zero at the root ). Then , so . The error squares each step, and it shrinks to zero only if , that is .
- sits exactly on the boundary: , , and the iteration is stuck at for ever, which is not the answer. Option (D).
- The other three are inside the interval, so they converge: , and all have .
Trap: assuming that any guess close to the root works, or that a larger guess is safe. A guess above is worse still: it gives a negative that runs away to . We ran the iteration 80 times from each option: from , and it reached to within , and from it went . We also checked that guesses of , , , , and converge and that , and do not.
Instruments and DSP chips compute reciprocals with this very iteration because it needs only multiplications and subtractions. The convergence interval is why a hardware reciprocal first scales its input into a known range before starting.