GATE IN General Aptitude: spatial and picture questions solved (2022-2026)
The GATE IN papers of 2022, 2023, 2025 and 2026 set 13 General Aptitude questions you answer from a picture or a step-by-step rule, worth 19 marks: floor-plan doors, puzzle pieces, a hill's contours, a cylinder's shadows, two cube nets, river bridges, gallery guards, coin swaps and a letter code. Figures are redrawn and every answer was checked with a model in code. The 2 GATE 2024 questions of this type are linked at the end.
Questions from the General Aptitude section of official GATE IN papers (IIT Kharagpur 2022, IIT Kanpur 2023, IIT Roorkee 2025, IIT Guwahati 2026; the IISc Bengaluru 2024 set is shared with CE2 and solved on the Civil pages); figures redrawn and solutions by Skill-Lync. · Updated 19 Nov 2026 · 13 questions
Which set of three pieces assembles into a square with a single round hole near the centre?
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- A round hole in the middle of a square cut into three pieces appears where the three pieces meet. Each piece must carry a small round notch there, and the three notches together must make one full circle.
- (D) has no round notch on any piece, so it cannot make a round hole.
- (A) and (B) do have notches, but their pieces do not fit together into a square. In (A) the top-right slope of the right piece is flatter than the slope of the underside of the middle piece, so the middle piece cannot sit on it. In (B) the middle piece does not match the right piece edge for edge: the rebuilt square has pieces overlapping.
- In (C) the middle piece sits on the right piece's sloped edge, the left piece fills the top-left, and the three notches meet at one point: left notch on the left, middle notch on top, right notch on the bottom right. Together they form one round hole near the centre.
Trap: (A) looks like (C) at a glance because it also has curved notches, but only two pieces carry them and the right piece's slope is different, so the pieces do not close into a square.
The code traced each option's three pieces from the figure, filled them on a pixel grid, and tried every translation of two pieces against the third. (C) closes into a square about 285 px wide with an overlap of 837 px², leaving one hole of about 2700 px² (radius 25 to 31 px) at 40% across and 43% down. (D) tiles but leaves no round hole. (A) has no placement that closes a square, and (B) overlaps by at least 11529 px² even in its best placement. Only (C) passes. These figures come from tracing the figure by eye, so allow a few pixels of error.
Checking that parts mate edge to edge with no overlap and one clearance hole in the right place is the same check as a mechanical fit test before an enclosure or sensor mount is cut.
Horizontal cross-sections of a hill: which top view P, Q, R or S matches?
- (A)
- (B)
- (C)
- (D)
Answer: (B) Q Official key: B
- In the side view, the lowest oval is the widest (about 0.04 to 0.74 km) and every higher oval sits inside it, ending at a small oval at the peak.
- The peak is at 0.23 km, about 0.27 of the way along the widest oval, so the centre of the top view sits near the left end.
- The hill is steep on the left and gentle on the right: the left edges of the ovals move only 0.15 km, the right edges move 0.46 km. So in the top view the contours bunch together on the left and spread out on the right.
- Only Q has nested ovals with the peak near the left end and bunched left edges.
Trap: (C) R is the tidy picture of a hill with a centred peak, but this hill's peak is not centred. (P) has the right idea of a lopsided peak, but on the wrong side.
The code compared how far along the outer oval the peak dot sits: 0.27 for the hill, against P 0.77, Q 0.24, R 0.49, S 0.55 (measured from the page), and rejected S because its contours cross; only Q is within 0.08.
Contour (iso-line) maps are how level and temperature profiles are drawn from point measurements, and tight spacing always marks a steep gradient, the same way closely spaced isotherms mark a sharp thermal edge.
An opaque cylinder in a parallel beam of light: which shadow P, Q, R or S is not possible?
- (A)P
- (B)Q
- (C)R
- (D)S
Answer: (D) S Official key: D
- A parallel beam gives a straight projection. The shadow is the outline of the two end circles of the cylinder, joined by straight lines.
- Light along the axis: both ends coincide and the shadow is a circle. That is P.
- Light square to the axis (side view): the shadow is a rectangle, the cylinder's length by its diameter. That is R.
- Light at a slant: each end circle becomes an ellipse with the same width as the cylinder, and the outline is the two straight sides joined by a rounded cap at each end. That is Q.
- All ends are curved, so a slanted view never gives a sharp corner. The only corners come from the side view, and they are 90 degrees. S has slanted sides with corners of about 50 and 130 degrees, so it cannot be cast. Option (D).
Trap: (B) Q looks odd for a round object, but it is the ordinary slanted view with rounded ends. S looks like a rectangle "leaning over", which tempts you to think a tilted cylinder leans its shadow, but tilting changes the ends, not the sides.
The code built the outline of a cylinder of length 5.55 radii (set by the side view R) at many tilts and found: P is an exact circle, R an exact rectangle with four 90 degree corners, Q at a tilt of 10.8 degrees has length to width 1.50 (the paper shows 1.50) and no corner, and every tilt from 0 to 80 degrees gives an outline whose sharpest turn is under 3 degrees. S has corners of 50, 51, 129, 130 degrees, so only S fails.
A parallel beam gives an orthographic projection, the same as a view on an engineering drawing or the shadow a shadowgraph or optical comparator throws of a round pin.
A paper net with four symbols is folded into a cube: which cube view is correct?
Note: The figures shown are representative.
- (A)
- (B)
- (C)
- (D)
Answer: (A) front open triangle, top filled circle, right blank Official key: A
- Take the square with the open triangle as the front face.
- The square above it folds back to be the top: filled circle. The square below it is the bottom: open circle.
- The squares to the left and right of the triangle square fold to the left and right faces. Both are blank.
- The last square, with the filled triangle, sits beyond the right face, so it wraps round to the back.
- So the visible faces are front: open triangle, top: filled circle, right: blank, which is (A).
Trap: the filled triangle looks as if it should be on the side next to the open triangle, as in (B) or (D). It is actually two squares away in the net, so it ends up on the back, where it cannot be seen from this angle.
The code folded the net into six faces (front open triangle, top filled circle, bottom open circle, left blank, right blank, back filled triangle) and compared the three visible faces of each option; only (A) matches. It checked the symbols on each face, not their tilt.
Reading a flat layout and picturing it folded is the same skill as reading an unfolded sheet-metal drawing or a PCB panel with fold lines for an instrument enclosure.
Folding a shaded cross-shaped net into a cube: which of cubes (i) and (ii) can match?
- (A)Only (i) can correspond to the unfolded cube in Panel I.
- (B)Only (ii) can correspond to the unfolded cube in Panel I.
- (C)Both (i) and (ii) can correspond to the unfolded cube in Panel I.
- (D)Neither (i) nor (ii) can correspond to the unfolded cube in Panel I.
Answer: (B) Only (ii) can correspond to the unfolded cube in Panel I. Official key: B
- Name the six faces of the net: a column of four (top square with a corner triangle, a square with a vertical bar, a square with a horizontal bar, a square with a shaded lower half), and on the sides of the second square, a left square with three shaded quarters and a right square with one shaded quarter.
- Cube (i) shows a face with three shaded quarters. Only the left square of the net looks like that. The faces that meet it at a corner can be the fourth square (shaded half) and the third square (thin bar), and the half and the three-quarter face do fit. But the thin bar of the third square runs from the left square's side to the right square's side, so on the folded cube it is at right angles to the edge it shares with the three-quarter face. In cube (i) the bar runs along that edge. So (i) is impossible.
- Cube (ii) shows a corner triangle, a shaded half on top and one shaded quarter on the right side. These are the top square, the fourth square and the right square of the net. All three meet at one corner of the folded cube, and the patterns sit the right way round.
- So only (ii) can be the folded cube: option (B).
Trap: (C), because both cubes use patterns that appear on the net, so each looks plausible. The patterns have to also be next to each other, and turned the right way.
The code folded the net in 3-D coordinates, turned the cube in all 24 ways, and compared the three visible faces of each Panel II cube on a 20 by 20 grid of points per face. Cube (i) matched in 0 orientations, cube (ii) in 1.
Folding a flat pattern into a solid and checking which faces touch is the skill behind reading a sheet-metal flat pattern or a PCB panel before it is folded or assembled.
Six persons around a circular table: who sits next to Q?
- P sits next to S and T.
- Q sits diametrically opposite to P.
- The shortest distance between S and R is equal to the shortest distance between T and U.
- (A)U and S
- (B)R and T
- (C)R and U
- (D)P and S
Answer: (C) R and U Official key: C
- Number the seats 0 to 5 round the table and put P in seat 0. S and T are P's two neighbours, so they take seats 1 and 5.
- Q is opposite P, so Q is in seat 3. The only people left are R and U, in seats 2 and 4. These are Q's two neighbours.
- The distance rule is only about how R and U are shared out. If R is in seat 2, S (seat 1) to R is 1 step, and U in seat 4 is 1 step from T (seat 5). If R is in seat 4 instead, both distances are 3. Either way R and U stay on the two sides of Q.
- So Q is a neighbour of R and U.
Trap: (A) and (D) put S or P next to Q, but S is next to P and Q is opposite P, so S and P can never touch Q.
The code tried all 720 seatings with P fixed at seat 0, kept the 4 that satisfy all three statements, and read off the two neighbours of Q in each: always R and U. Only (C) matches.
Working out which items sit next to which, from a few constraints, is the same reasoning as tracing a signal chain or a sensor bus when only some connections are labelled.
Minimum number of doors to open to go from P to Q in a floor plan
What is the minimum number of doors that need to be opened in order to go from the point P to the point Q?
- (A)4
- (B)3
- (C)2
- (D)1
Answer: (C) 2 Official key: C
- P is in the bottom strip. The only way out of it is the door in the long horizontal wall, on the left (door 1 in the redraw).
- That door opens into the large hall. The short vertical wall in the middle has its own door (door 2). Opening it lets you move into the right part of the hall.
- The right wall stub does not reach the outer wall, so there is a gap. Walk through the gap, up the right side, and you are at Q. No third door is needed.
- So two doors are enough, and one door cannot do it: the first door only reaches the hall's left part, which is shut off from the right part by the vertical wall.
Trap: (B) 3 is the route through the middle room: door 1, the gap into the top-left room, then the two doors of the middle room to reach Q. It works, but it is longer than the route through the right side.
The code drew the walls on a 1-pixel grid, made every wall solid except at the four doors, and ran a least-doors path search from P to Q. The fewest doors is 2; the only pair that works is d1 and d2 (door 1 is the one in the long wall, door 2 is in the short vertical wall); with all doors closed there is no path. Only (C) matches.
Finding the smallest number of valves or interlocks to open to connect two points on a piping or access layout is the same shortest-path idea used in plant walkdowns.
Seven river segments split land into five zones: which bridges connect all zones with the fewest?
Note: The figure shown is representative.
- (A)Bridges on P, Q, and T
- (B)Bridges on P, Q, S, and T
- (C)Bridges on Q, R, T, and V
- (D)Bridges on P, Q, S, U, and V
Answer: (C) Bridges on Q, R, T, and V Official key: C
- Read which two zones each river segment separates: P: Z1 and Z2. R: Z2 and Z3. Q: Z1 and Z3. S: Z1 and Z5. T: Z3 and Z5. V: Z3 and Z4. U: Z4 and Z5.
- Five zones need at least four bridges to be joined into one network, because each bridge can join only two zones.
- (A) uses three bridges and never reaches Z4, so it fails. (B) has four bridges but all of them lie among Z1, Z2, Z3 and Z5, so Z4 is cut off. (D) does join every zone, but with five bridges: one of them is spare, because P, Q and S already join Z1 to Z2, Z3 and Z5, and U then reaches Z4, so V adds nothing.
- (C) Q, R, T, V joins Z3 to Z1, Z2, Z5 and Z4, so all five zones are linked with four bridges. That is the least possible, so option (C).
Trap: (B) has four bridges, the right count, but they leave Z4 on its own. Counting bridges alone is not enough, each one has to reach a new zone.
The code treated zones as nodes and segments as links, and found the smallest number of bridges that joins all five zones is 4. It then checked every option for both conditions, all zones joined and exactly 4 bridges: only (C) passes. (A) and (B) leave a zone cut off, and (D) is connected but uses 5.
Joining every node with the fewest links is the spanning-tree idea behind laying out the cabling of a sensor network, where each extra cable adds cost without adding a new connection.
Minimum number of guards to watch all walkways of a five-junction gallery loop
- (A)2
- (B)3
- (C)4
- (D)5
Answer: (B) 3 Official key: B
- The figure is a loop of 5 junctions and 5 walkways: roof apex, two upper corners, two lower corners.
- A guard at one junction covers the 2 walkways that meet there. Two guards cover at most 4 walkways, but there are 5. So 2 is not enough.
- Three guards work. Put guards at the roof apex, the left upper corner and the right lower corner. The apex watches both roof walkways, the left upper corner watches the left wall, and the right lower corner watches the right wall and the floor. All 5 walkways are watched.
- So the minimum is 3: option (B).
Trap: (A) 2, from thinking that each guard watches “a side”. In a loop of an odd number of junctions, every guard covers only two walkways and one walkway is always left over.
The code tried every set of junctions of every size. No set of 2 covers all 5 walkways. The smallest set that does has 3 guards, for example at top, ll, lr.
Choosing the fewest sensors that together cover every link in a pipe or cable network is the same covering problem.
Ways to climb 5 stairs taking one or two steps at a time
- At any stage, Ankita can move either one or two stairs up.
- At any stage, Ankita cannot move to a lower step.
The value of is ________.
- (A)8
- (B)7
- (C)6
- (D)5
Answer: (A) 8 Official key: A
- To land on stair , the last move came from stair (one step) or (two steps). So .
- Starting from and : (matches the example), , .
- Check by listing: 11111, 1112, 1121, 1211, 2111, 122, 212, 221 are the 8 ways.
Trap: (D) 5 is , and stopping one term early is the usual slip with a Fibonacci-type recurrence.
The code counted all step sequences by recursion and by listing: F(1) to F(5) = 1, 2, 3, 5, 8, with 8 listed ways for 5 stairs, and it reproduced the three examples in the question; only (A) matches.
Counting paths where each step has a limited set of moves is the same recurrence used to count state sequences in a finite-state controller, such as the ways a sequencer can reach a given state in N clock ticks.
IMAGE is coded FHBNJ and FIELD is coded EMFJG: what is the code for BEACH?
- (A)CEADP
- (B)IDBFC
- (C)JGIBC
- (D)IBCEC
Answer: (B) IDBFC Official key: B
- Write IMAGE backwards: E G A M I. The code is F H B N J.
- Compare letter by letter: E to F, G to H, A to B, M to N, I to J. Each letter moves one place forward in the alphabet.
- Check FIELD: backwards D L E I F, each one forward gives E M F J G. This matches.
- Apply it to BEACH: backwards H C A E B, each one forward gives I D B F C.
Trap: (D) IBCEC starts with the same I but is not a consistent shift of the reversed word. Doing the shift without the reversal gives CFBDI, which is not an option either.
The code applied "reverse, then +1" to IMAGE and FIELD and got both given codes exactly. For BEACH it gives IDBFC; only (B) equals it.
Working out a rule from known input and output pairs, then testing it on a second pair before using it, is how you identify an unknown transfer behaviour from logged data.
Tile sequence with 0, 1, 1, 2, 3, 5 dots: which tile comes next?
- (A)
- (B)
- (C)
- (D)
Answer: (C) 8 dots, a ring of three, two and three Official key: C
- Count the dots on the six tiles: 0, 1, 1, 2, 3, 5.
- Each count is the sum of the two before it: , , . This is the Fibonacci rule.
- The next count is . Option (C) is the only tile with 8 dots: option (C).
Trap: (D), a full 3 by 3 grid with 9 dots. It looks like the “next bigger” pattern after the 5-dot tile, but 9 is not the sum of 3 and 5.
The code checked that every count from the third on is the sum of the previous two, got the next count 8, and counted the dots in each option: A 4, B 6, C 8, D 9.
Spotting that each reading is the sum of the previous two is the same habit as checking a sensor log for a recurrence or a drift pattern before you trust the next value.
Minimum adjacent swaps to turn HHHTTT into TTTHHH
Six coins are placed in the Starting Arrangement, as shown in the figure below. A “step” is defined as interchanging a pair of adjacent coins without flipping them. The minimum number of steps needed to go from the Starting Arrangement to the Final Arrangement, as shown in the figure, is ________.
- (A)3
- (B)6
- (C)9
- (D)12
Answer: (C) 9 Official key: C
- Each head must end up to the right of every tail. At the start every one of the 3 heads is to the left of all 3 tails.
- So each of the head-tail pairs is in the wrong order.
- One adjacent swap fixes exactly one pair, so at least 9 swaps are needed. Moving the last head past the three tails, then the next head, and so on, does it in exactly 9.
- So the minimum is 9: option (C).
Trap: (A) 3 or (B) 6, from thinking that each coin only needs one move or that swapping blocks is quick. A swap exchanges only two neighbours, so a head cannot jump over several tails at once.
The code searched breadth-first over every arrangement reachable by adjacent swaps (20 arrangements of 3 heads and 3 tails) and found that the shortest route to TTTHHH takes 9 steps.
Counting the swaps needed to sort a list is how you bound the cost of re-ordering channels in a multiplexer scan or a sorting stage on a sample line.
GATE 2024 IN aptitude questions of this type
GATE 2024 IN was held in the same session as Civil set 2 (CE2), so the two papers had the same General Aptitude section, word for word, with the same keys. These 2 are solved on the Civil pages:
- Five cubes and a small cube: Figure B is the view from X. Which picture is the view from Y? GATE 2024 IN Q.9 = CE2 Q.9
- A cube is held with a body diagonal vertical: the smallest rotation about it that leaves the view unchanged? GATE 2024 IN Q.10 = CE2 Q.10