GATE General Aptitude: quantitative questions solved (from the official ME papers)
General Aptitude is the first 10 questions of every GATE paper and 15 of its 100 marks, the same weight as a full core subject. The five keyed ME papers from 2022 to 2026 set 29 quantitative GA questions, worth 44 marks: averages, speed and timetables, primes and algebra, probability, geometry, clocks, calendars and a chart. Each is solved here with the shortcut, and the 3 that IISc and IIT Kharagpur scored as marks to all are explained.
Questions from the General Aptitude section of official GATE ME papers (IIT Kharagpur 2022, IISc Bengaluru 2024, IIT Roorkee 2025, IIT Guwahati 2026); solutions by Skill-Lync. · Updated 16 Nov 2026 · 29 questions
Average salary of M, N, S is ₹4000 and of N, S, P is ₹5000: M's salary as a percentage of P's?
What is the monthly salary of M as a percentage of the monthly salary of P?
- (A)50%
- (B)75%
- (C)100%
- (D)125%
Answer: (A) 50% Official key: A
- Turn averages into totals: and .
- With : , so .
- : option (A).
The shortcut: the two averages share , so subtracting the totals gives directly, and .
Average production of 100 units over m days rises to 110 after a 180-unit day: what is m?
If today's production of 180 units changes the average to 110 units per day, what is the value of ?
- (A)18
- (B)10
- (C)7
- (D)5
Answer: (C) 7 Official key: C
- Totals again: .
- , so and : option (C).
The way to see it without algebra: today's 180 is 80 above the old average. Spreading that 80 over all days lifts the average by 10, so and . Check: .
This is the arithmetic of a running average on a shop-floor dashboard: one exceptional shift moves the average by (shift value − old average) / (number of shifts). It is why a new line's average output swings wildly in its first week and barely moves after a quarter, and why plants track a rolling window rather than an all-time mean.
250 items sold at an average of Rs. 60 with S = 2T, R = 3T, Q = 4T: how many of product P?
(i) The quantity of S sold was twice that of T.
(ii) The quantity of R sold was thrice that of T.
(iii) The quantity of Q sold was four times that of T.
| Product | P | Q | R | S | T |
|---|---|---|---|---|---|
| Unit selling price (Rs.) | 100 | 50 | 40 | 60 | 60 |
- (A)40
- (B)50
- (C)60
- (D)70
Answer: (B) 50 Official key: B
- Let T sell units: then S, R, Q sell and P sells . Count: .
- Revenue: , and it must equal .
- Substitute : , so and : option (B).
Check: P 50, Q 80, R 60, S 40, T 20 items make 250, and . A quicker route: compare each product with the Rs. 60 average. Q, R, S, T together are below it, and P's must cancel that, so ; with that gives the same .
Four numbers: average 25, each at most 40, each at least 20. Which statements imply which?
(S1) The average of the four numbers is 25
(S2) Each number is at most 40
(S3) Each number is at least 20
Choose the option that is necessarily correct.
- (A)(S1) and (S2) together imply (S3)
- (B)(S2) and (S3) together imply (S1)
- (C)(S1) and (S3) together imply (S2)
- (D)(S1) implies (S3)
Answer: (C) Official key: C
- (S1) says the four numbers add to 100. With (S3), the other three are each at least 20, so together at least 60, and any one number is at most . That is (S2): option (C) holds for every possible set.
- The others each fail on one example. (A): averages 25 and none is above 40, but some are below 20. (B): are all between 20 and 40 but do not average 25. (D): averages 25 with a number below 20.
"Necessarily correct" means one counterexample is enough to kill an option, and a proof is needed to keep one. The model here searched every four-number set on a grid of 0 to 100 for counterexamples and found one for (A), (B) and (D) and none for (C).
80 km in 6 hours, part at 10 km/h and the rest at 18 km/h: what percentage of the distance at 10 km/h?
What percentage of the total distance is travelled at a uniform speed of 10 kmph?
- (A)28.25
- (B)37.25
- (C)43.75
- (D)50.00
Answer: (C) 43.75 Official key: C
- Let the person spend hours at 10 km/h and hours at 18 km/h: .
- , so h and the distance at 10 km/h is km.
- : option (C).
Shortcut: had all 6 hours been at 18 km/h the person would cover 108 km; every hour at 10 km/h instead loses 8 km, and 28 km were lost, so 3.5 hours. Trap: 3.5 of 6 hours is 58.33% of the time, not the distance.
Car P goes north at 25 km/h, car Q east at 30 km/h and stops a while: how long did Q stop?
- (A)10
- (B)12
- (C)15
- (D)18
Answer: (C) 15 Official key: C
- By 11:30 AM car P has driven 1.5 h: km from X.
- Car Q goes straight east, so its distance from X is just the distance it drove. To be 37.5 km out it drove h minutes.
- Of the 90 minutes, Q was stopped for minutes: option (C).
The directions (north and east) are there to tempt you into Pythagoras. Each car's distance from X is measured along its own straight road, so nothing needs combining; Pythagoras would give the distance between the two cars, which the question does not ask.
One-way trains between four cities: minimum time to go from R to S and back to R?
If the person starts from R at 7 AM and is required to visit S and return to R, what is the minimum time required?
- (A)6 hours 30 minutes
- (B)3 hours 45 minutes
- (C)4 hours 30 minutes
- (D)5 hours 15 minutes
Answer: (A) 6 hours 30 minutes Official key: A
- Read the arrows first. Out of R there is only one route, R → Q; out of Q only Q → P; S can be reached only from P. So every trip from R to S goes R → Q → P → S, and the return is S → R directly (one hop).
- R → Q: the 7:00 train, at Q 8:00. Q's trains leave at 5, 7, 9 … (every 2 h), so wait for 9:00, at P 10:00. P's trains leave at 8:00, 9:30, 11:00, so wait for 11:00, at S 12:00. S's trains leave every 45 min from 8:00: 11:45, 12:30, so wait for 12:30, back at R 13:30.
- 7:00 to 13:30 is 6 hours 30 minutes: option (A).
A search over every route of up to nine legs (taking the first train each time) finds the same minimum, 6 h 30 min. Only 4 of the 6.5 hours are spent travelling; the rest is waiting for connections, which is what the question tests.
Planning a route through fixed departure slots is the same problem a production scheduler solves when a part must visit machines that each run in batches: the lead time is mostly queueing, not processing. Value-stream maps make this visible by drawing waiting time and processing time on separate lines, and in most plants the waiting line is many times longer.
Find the odd one out in {19, 37, 21, 17, 23, 29, 31, 11}
- (A)21
- (B)29
- (C)37
- (D)23
Answer: (A) 21 Official key: A
Every number except one is prime: 11, 17, 19, 23, 29, 31 and 37 have no divisors other than 1 and themselves. is the only composite number, so it is the odd one out: option (A).
Quick primality test for two-digit numbers: check divisibility by 2, 3, 5 and 7 only (since ). For 21 the digit sum is 3, so it fails at the first odd test.
Which number must change to make 1, 1, 2, 3, 6, 8, 13, 21 a Fibonacci series?
1, 1, 2, 3, 6, 8, 13, 21,…
- (A)8
- (B)21
- (C)6
- (D)13
Answer: (C) 6 Official key: C
- In a Fibonacci series each term is the sum of the two before it: 1, 1, 2, 3, then .
- The series has 6 there. Change it to 5 and the rest fits: , , . Option (C).
Why not 8? Changing 8 to repairs that step but breaks the next one (). The model tried every replacement value for each option: only replacing 6 (with 5) makes the whole series consistent.
HIDE is 19-23-7-11 and CAGE is 5-2-17-11: what is the code for HIGH?
- (A)5-17-1-2
- (B)17-19-13-17
- (C)13-3-1-2
- (D)19-23-17-19
Answer: (D) 19-23-17-19 Official key: D
- All the code numbers are prime. List the primes in order: 2, 3, 5, 7, 11, 13, 17, 19, 23, …
- Letter positions: A = 1, C = 3, D = 4, E = 5, G = 7, H = 8, I = 9. The 1st prime is 2 (A), the 3rd is 5 (C), the 4th is 7 (D), the 5th is 11 (E), the 7th is 17 (G), the 8th is 19 (H), the 9th is 23 (I). Both given words fit: each letter becomes the prime at its alphabet position.
- HIGH = 8th, 9th, 7th, 8th primes = 19-23-17-19: option (D).
Spotting it fast: E maps to 11 in both words, so the code depends only on the letter. 2 for A and 5 for C rule out simple shifts (A = 1 would need +1, C = 3 would need +2), and every value being prime gives the rule away.
x/(pq − r²) = y/(qr − p²) = z/(rp − q²): what is px + qy + rz?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- Call the common ratio : , , .
- Then .
- The six terms cancel in pairs (, , ), so the sum is for every : option (A).
Checked on 500 random rational choices of : the sum was exactly zero every time. In an exam, plugging in one easy set such as (, , , sum ) gets there in seconds and already rules out (B), (C) and (D).
log₂ x + log√2 x = 48: what is x?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- Change the base: .
- So , and : option (A).
Check: and (since ); . Trap: is what you get if you halve instead of double when changing to base ; it gives .
Which number line shows all x satisfying 2 − 5x ≤ −(6x − 5)/3?
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- Multiply both sides by 3 (positive, so the sign stays): .
- Collect terms: , so .
- The solution is every number from (a point just right of 0, included) to : option (C).
Trap: collecting terms the other way gives , and dividing by without flipping the sign gives , which is (A). Testing two points settles it without algebra: gives , false, so the pictures with 0 in bold, (A) and (B), are wrong; gives , false, which rules out (D). Checked on 5,401 points between and : the inequality holds exactly when .
f(x) = 2 ln(√(eˣ)): what is the area under it from 0 to 2?
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- Simplify first: , so and .
- The area under from 0 to 2 is a triangle: : option (C).
Integrating the original expression numerically (Simpson's rule, 2,000 strips) gives 2.000000. Trap: dropping the 2 in front leaves and an area of 1, option (B).
f(p, q) multiplies p by itself q times, g(p, q) is a power tower of q p's: which comparison holds?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- (A): and . Equal, so (A) is correct.
- (B): , so the two sides are and . Equal, so is false.
- (C): by definition, so is false.
- (D): but , so is false.
Only option (A) holds. The towers grow fast after this: , ; for , and agree only at , which is why (A) works and (D) does not.
Ceiling and floor functions: which statement is NOT true for every x?
- (A)
- (B)
- (C)
- (D)
Answer: (D) Official key: D
- (A), (B) and (C) follow straight from the definitions: the ceiling is never below , the floor never above it, so the ceiling is never below the floor.
- (D) asks for a strict inequality. When is an integer, say , both functions return 3, and is false. So (D) is not correct for all : option (D).
Checked on every multiple of from to : (A) to (C) never fail, and (D) fails exactly at the integers. The general rule: is 1 for non-integers and 0 for integers.
Two long dice with faces 2, 3, 5, 7: probability that the sum is greater than 11?
If thrown together, what is the probability of getting the sum of the two long dice scores greater than 11?
- (A)
- (B)
- (C)
- (D)
Answer: (D) Official key: D
- There are equally likely outcomes.
- Sums above 11 need a 7 on at least one die: , and give 12, 12 and 14; is only 10.
- : option (D).
Traps: counting and as one outcome gives , option (B). The dice are different objects, so order matters, which is easiest to see by listing a 4 × 4 table.
P wins 80% of chess games against Q: probability of winning exactly 2 of the next 3?
If they play 3 more matches, what is the probability of P winning exactly 2 of these 3 matches?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- Each match is a win with probability and not a win (draw or loss together) with . The 15%/5% split does not matter.
- Exactly two wins can happen in 3 orders (WWN, WNW, NWW), each with probability .
- Total : option (A).
Trap: , option (B), is a single order. This is the binomial formula ; it assumes the matches are independent with the same win rate, which is what the question intends by using the past record as the probability.
The same binomial calculation is how a quality engineer sizes a sampling plan: if 2% of parts are defective, the chance a sample of 50 holds exactly bad parts is . Acceptance-sampling tables such as ANSI/ASQ Z1.4 rest on these binomial (and Poisson) sums.
Offer probabilities 0.8 and 0.6: what range must P(both offers) lie in?
- (A)
- (B)
- (C)
- (D)
Answer: (B) Official key: B
- Upper limit: both offers cannot be more likely than either one alone, so .
- Lower limit: cannot exceed 1, so .
- So : option (B).
Both ends are reachable: if every T offer comes with an S offer, if she always gets at least one. If the two offers were independent, , inside the range, but the question does not say they are, which is why it asks for a range. A grid search over every joint distribution with these two marginals gives the same limits, 0.4 and 0.6.
These bounds matter in reliability work. If two safety systems fail with probabilities a and b and you do not know whether their failures are linked (common power supply, same maintenance crew), the chance both fail can be anywhere from max(0, a + b − 1) to min(a, b), not just a × b. Treating them as independent is the classic optimistic error that common-cause failure analysis exists to catch.
How many chains A ⊆ B ⊆ C of non-null subsets of {2, 3, 5}? (official key: marks to all)
- (A)28
- (B)27
- (C)18
- (D)19
Answer: No option is correct (marks to all) Official key: MTA
- Decide each element's place independently: in A (and so in B and C), in B but not A, in C but not B, or not in C at all. That is 4 choices per element, chains in total.
- Remove the chains where A is empty: then each element has only the last 3 choices, chains. If A is non-null, B and C are automatically non-null.
- So there are chains, and none of the options is 37.
IISc awarded marks to all for this question (official key: MTA). Listing every triple of non-null subsets by computer confirms 37. Reading "subset" as proper subset at every step gives only 6 chains, also not an option. For reference, 27 (option B) is the number of chains in which A is empty.
Rhombus joining the midpoints of a unit square: diameter of the largest circle inside it?
What is the diameter of the largest circle that can be inscribed within the rhombus?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- Each side of the rhombus joins two midpoints, so its length is . All its angles are : it is a square of side , tilted by .
- The largest circle inside a square touches all four sides, so its diameter equals the side: : option (A).
Check with distances: the centre is from each side of the rhombus, which is the radius. Option (B) is that radius, the trap for anyone who stops one step early.
Equilateral triangle, square and circle of equal area: ratio of their perimeters?
What is the ratio of the perimeters of the equilateral triangle to square to circle?
- (A)
- (B)
- (C)
- (D)
Answer: (B) Official key: B
- Take the common area as 1. Square: side 1, perimeter 4. Circle: , , perimeter . Triangle: , , perimeter .
- Ratio . Halve everything: , and .
- So : option (B).
Numbers: the perimeters are 4.5590, 4 and 3.5449 for unit area. The circle has the shortest boundary and the triangle the longest, as it must: of all shapes with a given area the circle has the least perimeter. (C) has the right numbers with the square doubled, so it is out of proportion.
Four circles vs nine circles packed in a 1 cm square: ratio of the unshaded areas?
What is the ratio of the areas of unshaded regions of case M to that of case N?
- (A)2 : 3
- (B)1 : 1
- (C)3 : 2
- (D)2 : 1
Answer: (B) 1 : 1 Official key: B
- Case M: radius , shaded area .
- Case N: radius , shaded area .
- Both leave unshaded, so the ratio is 1 : 1: option (B).
The general reason: with touching circles the radius is , so the shaded area is whatever is. Smaller circles fill the same 78.5% of the square. A point-count check of case N on a 600 × 600 grid agrees to 0.2%.
This is why a square-grid nest of circular blanks wastes the same 21.5% of sheet whatever the blank size: stamping more, smaller washers from a sheet does not improve material use. Shifting alternate rows by half a pitch (hexagonal nesting) does, raising the fill to about 90.7% for large sheets, and that layout is the default in press-shop nesting software.
A semicircular string K on a straight string P: both shortened by x so K becomes a full circle. x/l?
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- Before: K is half a circle of diameter , so its length is .
- After: K is a full circle of diameter , so its length is . It was also shortened by :
- , so : option (C).
That is , between 0 and 1 as it must be. (A) and (D) exceed 1, which would mean cutting off more string than there is, so they can be ruled out at a glance.
Arrange isosceles triangle, equilateral triangle, square and circle by number of lines of symmetry
- (A)Circle; Square; Equilateral triangle; Isosceles triangle
- (B)Isosceles triangle; Equilateral triangle; Square; Circle
- (C)Equilateral triangle; Isosceles triangle; Square; Circle
- (D)Isosceles triangle; Square; Equilateral triangle; Circle
Answer: (B) Official key: B
- Isosceles triangle (two equal sides, not equilateral): 1, the line through the apex and the middle of the base.
- Equilateral triangle: 3, one through each vertex.
- Square: 4, two diagonals and two lines through midpoints of opposite sides.
- Circle: infinitely many, every diameter.
Increasing order 1, 3, 4, ∞: option (B). Reflecting sampled outlines of each polygon about 3,600 trial axes found 1, 3 and 4 mirror lines.
Angle between faces of a solid made of four equilateral triangles (official key: marks to all)
- (A)30°
- (B)60°
- (C)45°
- (D)90°
Answer: No option is correct (marks to all) Official key: MTA
- Four equilateral triangles close up into a regular tetrahedron.
- Place its vertices at , , , . The outward normals of two faces make an angle with , and the angle between the faces (the dihedral angle) is , so .
- Dihedral angle . None of the options is close.
IISc awarded marks to all (official key: MTA). The in option (B) is the angle between two edges of a face, a natural slip, but the angle between two faces is measured in the plane perpendicular to their shared edge, and it is about .
The tetrahedron's dihedral angle of about 70.5° is why regular tetrahedra cannot fill space on their own: five of them around an edge leave a gap of about 7.4°. It is also the shape of the 4-node tetrahedral element every FEA mesher uses on complex CAD, and mesh quality checks flag tets whose dihedral angles stray too far from 70.5° because very flat or sliver elements stiffen the solution and wreck accuracy.
How many times do all three clock hands coincide from 3 PM to 3 AM? (official key: marks to all)
- (A)11
- (B)12
- (C)144
- (D)2
Answer: No option is correct (marks to all) Official key: MTA
- The minute hand gains one full turn on the hour hand every h, so the hour and minute hands meet 11 times in 12 hours, at h after 12:00.
- At those moments, does the second hand join them? At h (about 1:05:27) the hour and minute hands point at , but the second hand is at s, pointing at . Checking all eleven meeting times in exact fractions, the second hand is on the other two only at 12:00.
- From 3 PM to 3 AM that is once, at midnight. None of the options says 1.
IIT Kharagpur awarded marks to all (official key: MTA). Option (A), 11, counts the hour-minute meetings and ignores the second hand; the model found 11 such meetings in the interval and 1 with all three hands.
A clock is a gear train: the hour hand turns at 1/12 of the minute hand's speed through a 12:1 motion work, which is why the meetings repeat every 12/11 h. The same relative-speed argument gives the beat period of any two rotating parts, such as two shafts in a gearbox whose marked teeth line up again only after a 'hunting tooth' cycle, which gear designers use to spread wear evenly.
Born on the fifth Monday of February: which statement about that February is correct?
Which one of the following statements is correct based on the above information?
- (A)The 2nd February of that year is a Tuesday
- (B)There will be five Sundays in the month of February in that year
- (C)The 1st February of that year is a Sunday
- (D)All Mondays of February in that year have even dates
Answer: (A) Official key: A
- A 28-day February has exactly four of every weekday. A fifth Monday needs 29 days, so it is a leap year, and the extra day (the 29th) must be a Monday.
- Then the Mondays are the 1st, 8th, 15th, 22nd and 29th. So 1 February is a Monday and 2 February is a Tuesday: option (A).
- The others fail: there are only four Sundays (7, 14, 21, 28), 1 February is a Monday, not a Sunday, and the Monday dates are odd.
Checked against the real calendar from 1901 to 2100: every February with five Mondays (1904, 1932, 1960, 1988, …) starts on a Monday and has 29 days.
Bar chart of VK and RS batting averages 2012-2022: which statement about world cup years is true?
- (A)RS has a higher yearly batting average than that of VK in every world cup year.
- (B)VK has a higher yearly batting average than that of RS in every world cup year.
- (C)VK's yearly batting average is consistently higher than that of RS between the two world cup years.
- (D)RS's yearly batting average is consistently higher than that of VK in the last three years.
Answer: (C) Official key: C
- "Between the two world cup years" means 2016, 2017 and 2018. VK is ahead in all three (about 92 vs 63, 76 vs 72, 133 vs 73): option (C).
- (A) fails in 2019 (VK about 60, RS about 57). (B) fails in 2015 (VK about 36, RS about 51). (D) fails in 2021 (VK about 43, RS about 30).
Each option is decided by one or two bars, so the fast method is to find the single bar that breaks each claim. The figure is redrawn from the official chart; values are read off it to about ±2, and every comparison that decides an option has a gap of at least 3, so the reading error cannot change the answer.
Reading a claim against a chart, and looking for the one bar that breaks it, is most of what a weekly quality or production review is: 'scrap was lower every month this quarter' is disproved by a single month. In Excel, a conditional format that highlights the exceptions does this check for you on the full table instead of by eye.