GATE Instrumentation (IN): Digital Electronics (logic gates and families, Boolean minimisation, multiplexers, flip-flops and counters, ADCs and DACs, microprocessors), previous-year questions solved
Every digital electronics question from the last five GATE Instrumentation Engineering papers, solved: number systems and Boolean minimisation, logic-family speed, multiplexers, flip-flops, counters and shift registers, the data-acquisition chain from sample-and-hold to ADCs and DACs, and microprocessor memory maps and instruction formats. Each answer matches the official key and was recomputed by code: truth tables enumerated, sequential circuits stepped clock by clock and converters modelled with the values printed in the paper.
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 · 17 of 27 questions on this page
Logic block of two inverters and three NOR gates with inputs A and B: output F
- (A)
- (B)
- (C)
- (D)
Answer: (D) Official key: D
- A NOR gate is an OR gate followed by an inversion: . Work through the network gate by gate, from the inputs towards .
- The two inverters give and .
- First NOR gate, inputs and : (De Morgan).
- Second NOR gate, inputs and : .
- Third NOR gate: . Option (D).
Truth table of for = 00, 01, 10, 11: 00 gives 1, 01 gives 0, 10 gives 1, 11 gives 0, which is every time, whatever is. Trap: reading the last gate as a plain OR gives , the complement of the right answer (0101 against 1010). We evaluated the network gate by gate for all four input pairs and tested every option: only matches.
Redundant logic like this shows up in real designs when blocks are reused: synthesis tools reduce a gate cluster to a single inverter, and reading the netlist the same way helps when you debug a board. Always check the bubbles on the gate symbols, because a missing bubble swaps an OR for a NOR.
Match the XOR operations X with X, X with X-bar, X with 0 and X with 1 to their results
(i) (p)
(ii) (q)
(iii) (r)
(iv) (s)
- (A)(i) - (q), (ii) - (r), (iii) - (s), (iv) - (p)
- (B)(i) - (q), (ii) - (r), (iii) - (p), (iv) - (s)
- (C)(i) - (p), (ii) - (s), (iii) - (q), (iv) - (r)
- (D)(i) - (q), (ii) - (p), (iii) - (s), (iv) - (r)
Answer: (D) Official key: D
- XOR gives 1 when its two inputs are different and 0 when they are the same. Use that and test each case for and .
- (i) : the inputs are always equal, so the result is . Match (q).
- (ii) : the inputs are always different, so the result is . Match (p).
- (iii) : the output is 1 only when differs from 0, that is when . So it equals . Match (s). XOR with 0 is a buffer.
- (iv) : the output is 1 only when . So it equals . Match (r). XOR with 1 is an inverter.
- The pairing (i)-(q), (ii)-(p), (iii)-(s), (iv)-(r) is option (D).
Trap: swapping (i) and (ii). is 0 because the inputs match; is 1 because they never match. We enumerated both values of for all four expressions and compared each option's pairing with the enumerated result: only (D) matches.
An XOR with one input tied to a control line is a programmable inverter, used to flip the polarity of a signal in software. The same gate computes parity for error checking on serial instrument links and sits in the adder circuits of every arithmetic unit.
Choose the fastest logic family among TTL, ECL, CMOS and RTL
- (A)Transistor-Transistor Logic
- (B)Emitter-Coupled Logic
- (C)CMOS Logic
- (D)Resistor-Transistor Logic
Answer: (B) Official key: B
- Logic speed is limited by how fast a transistor can switch and by whether it saturates. A saturated bipolar transistor stores charge in its base, and removing that charge takes time.
- Emitter-coupled logic (ECL) uses a differential pair that steers a fixed current between two paths. The transistors never go into saturation and the voltage swing is small (about 0.8 V), so charging stray capacitance is quick. Typical gate delay: about 1 to 2 ns.
- Standard TTL saturates its transistors: about 10 ns per gate. Classic CMOS charges load capacitance through a resistive transistor and is slower still in the older series, though CMOS wins on power. RTL, with resistor-coupled inputs, is the slowest of the four, about 12 ns or more.
- The fastest family is ECL, option (B).
Trap: picking CMOS because modern CMOS processors run at gigahertz clocks. That comes from tiny transistor geometries, not from the logic style; in the classic family comparison this question tests, ECL is faster but burns much more power. We compared typical textbook propagation delays (ECL about 2 ns, 74HC CMOS about 8 ns, TTL about 10 ns, RTL about 12 ns). This one is a recalled fact, not a computed result.
ECL was the choice for the fastest mainframes, high-speed counters and oscilloscope timebases because it switches in about a nanosecond, at the cost of high power and cooling. Today its descendants, PECL and LVDS, still carry the fastest clocks and data lines on instrumentation boards.
Simplify the Boolean function F = (A + A'B) + A'(A + B')C
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- Simplify with the absorption law (a variable plus its complement times something drops the complement).
- First bracket: .
- Second term: , because . Times gives .
- So . Group the last two: (same law), and then .
- . Option (A).
Check without algebra: only when and , which forces . So is 0 only for , the truth table of a three-input OR. We enumerated all eight input rows ( column 01111111) and tested every option: only matches. Trap: option (C) forgets the term and is wrong for .
Boolean simplification is how a designer shrinks a logic function before it goes into a programmable logic device or a gate-level netlist, so the same behaviour needs fewer gates, less power and less delay. Synthesis tools do it automatically, but reading a simplified form is how you check that a trigger or interlock condition in a controller means what you think it means.
4-bit signed 2's complement form of (5) + (5): overflow wraps the result
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- In 4-bit two's complement the range is to . The top bit is the sign bit with weight .
- . Add (the carry out of the fourth bit is thrown away).
- Read as a signed number: . Option (A).
- The true sum is outside the 4-bit range, so this is an overflow: two positive numbers produced a negative answer, which is how hardware detects it (the carry into the sign bit differs from the carry out of it).
Trap: expecting a mathematically correct , which cannot be written in 4 bits. We added the two codes modulo 16 and decoded the result as signed: , the only option that matches.
Fixed-width integer arithmetic in microcontrollers and DSP firmware wraps around in exactly this way. A sensor reading that overflows a signed register flips to a large negative value, so firmware checks ranges or uses saturating arithmetic.
Two cascaded 2x1 multiplexers with constants 1 and 0, selects B and A: forms of the output F
- (A)
- (B)
- (C)
- (D)
Answer: (A) and (B) Official key: A, B
- A 2x1 multiplexer outputs when its select input is 0 and when it is 1: .
- First multiplexer: , , select . .
- Second multiplexer: , , select . (the absorption law with turns into ).
- De Morgan: . So (A) and (B) are the same function, a NAND gate.
- Truth table of for = 00, 01, 10, 11: 00 gives 1, 01 gives 1, 10 gives 1, 11 gives 0. Option (C), , would give 1 only for , and option (D), , is that same NOR function, so both are wrong. Answer: (A) and (B).
Trap: selecting only (A) or only (B). Both are correct because they are two written forms of one function. We simulated the two multiplexers for all four input pairs and tested each option against the result: options A and B pass, C and D fail.
Multiplexers are the building block of FPGA look-up tables, and a NAND function can be built from them just like this, which is why programmable logic can implement any gate. In instrumentation, analog and digital multiplexers route one of many sensor channels to a single converter.
Three D flip-flops with a NOR of Q1 and Q2 fed back to D0: counter modulus or disjoint cycles?
- (A)is a divide-by-5 counter
- (B)is a divide-by-7 counter
- (C)is a divide-by-8 counter
- (D)does not function as a counter due to disjoint cycles of states
Answer: (A) Official key: A
- On each clock edge every D flip-flop copies its input. So the next state is , with (the NOR gate). It is a shift register with a NOR feedback.
- Start from : , so the sequence is .
- That is 5 states in a loop. The three unused states , and do not form a loop of their own: , , so each one falls back into the 5-state loop within two clocks. There are no disjoint cycles.
- One output cycle per 5 clock pulses: a divide-by-5 counter. Option (A).
Trap: assuming three flip-flops must count to 8, or to 7 as an ordinary ring counter with one fewer state. Check the unused states: a counter fails only if some of them cycle among themselves without ever reaching the main loop. We ran the circuit clock by clock from all eight starting states: every one reaches the same 5-state loop.
Shift-register counters with a feedback gate are a compact way to divide a clock by an odd number, for example to derive a slower sampling clock from a crystal. The unused-state check is part of real design reviews, since a counter that powers up in a stray state must still start counting correctly.
2-bit unsigned numbers A = a1 a0 and B = b1 b0: minimised Boolean form of F = 1 only when A > B
- (A)
- (B)
- (C)
- (D)
Answer: (B) Official key: B
- Compare the high bits first. when , or when the high bits are equal and .
- That is , where is the equality of the high bits.
- Expand: .
- On a Karnaugh map of the four variables, has 6 cells equal to 1 (the pairs out of 16). The three prime implicants that cover them are (4 cells), (2 cells) and (2 cells), with no cell left over: . Option (B).
Trap: dropping a term. Option (A) misses the case ; option (C) misses the whole group; option (D) has uncomplemented in the last term, so it covers , which includes cases where . We built the full 16-row truth table of (6 ones) and compared each option: it misses 1 rows for (A), 3 for (C) and 2 for (D); only (B) matches all 16.
Magnitude comparators decide whether a measured value has crossed a limit, for example in digital alarms, window comparators and sorting of converter readings. The same sum-of-products form maps onto gates or look-up tables when it is built in hardware.
Flip-flop table: Q(t) 0,0,1,1 and Q(t+1) 0,1,0,1 with one control input 0,1,1,0: which flip-flop?
| Q (t) | Q (t+1) | Input |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
- (A)T flip-flop
- (B)D flip-flop
- (C)SR flip-flop
- (D)JK flip-flop
Answer: (A) Official key: A
- An excitation table tells you what input is needed to make a given state change. Read the Input column against the change from to .
- When the state does not change ( and ) the input is 0. When the state changes ( and ) the input is 1. So .
- That is a toggle: input 1 flips the output, input 0 holds it. This is the characteristic of the T flip-flop, option (A).
- The others do not fit. A D flip-flop copies its input, , so the row with input 1 would be impossible. SR and JK flip-flops have two control inputs, but the table has only one.
Trap: a JK flip-flop with J and K tied together behaves like a T flip-flop. Since the table lists one control input, T is the direct answer. We tested each flip-flop against the four rows of the table: only the T flip-flop matches with a single control input.
T flip-flops, each toggling on every clock edge when enabled, are the building blocks of binary counters and frequency dividers. A chain of them halves the frequency at each stage, which is how a crystal oscillator is divided down to a timer tick in embedded instruments.
Simplify F(W,X,Y,Z) = sum of minterms 4, 5, 10, 11, 12, 13, 14, 15 with fewest terms and literals
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- Write the minterms in binary (): 4 = 0100, 5 = 0101, 10 = 1010, 11 = 1011, 12 = 1100, 13 = 1101, 14 = 1110, 15 = 1111.
- On a four-variable K-map, group adjacent 1s in blocks of 2, 4 or 8. Larger blocks mean fewer literals.
- Block 1: minterms 4, 5, 12, 13. In all four, and ( and change). This gives .
- Block 2: minterms 10, 11, 14, 15. In all four, and . This gives .
- Together, the two blocks cover all eight minterms, so . That is two terms of two literals each: option (C).
Trap: options (A) and (B) also equal as functions, but they carry extra terms. In (B) the term (minterms 12 to 15) is already covered by the other two, so it is redundant; the question asks for the minimum number of terms. Option (D) is a different function. We enumerated all 16 input combinations for each option: A, B and C match the minterm list, D does not, and only C has the fewest terms (2) and literals (4).
Boolean minimisation is what logic synthesis tools do to fit a design into the fewest gates or FPGA lookup tables. The same reduction makes interlock and alarm logic in instrument panels smaller, faster and easier to verify.
Feedback circuit with NOT 5 ns, OR 10 ns, AND 10 ns delays, A = B = 1: frequency of oscillation of Y
- (A)20 MHz
- (B)15 MHz
- (C)40 MHz
- (D)50 MHz
Answer: (A) Official key: A
- Simplify with . The NOT gate on outputs 0, so the OR gate passes only its other input: . The AND gate with passes it on. So , and since is wired to , the circuit says . An odd number of inversions in a loop cannot settle, so it oscillates.
- One trip round the loop takes the delays of the gates on the path: NOT 5 ns + OR 10 ns + AND 10 ns . After that, flips.
- One full period needs two flips (high then low): .
- 20 MHz. Option (A).
Trap: using the one-way delay as the period gives (option C). The output flips once per trip, so the period is twice the loop delay. We simulated the circuit in 1 ns steps with the stated delays and measured the time between rising edges of : 50 ns, or 20 MHz.
A ring of an odd number of inverters is the simplest oscillator on a chip, and its frequency is set by the loop delay. Chip designers use ring oscillators to measure process speed, and the same effect explains why a logic loop with an accidental inversion makes a board oscillate.
Shift registers A = 1101 and B = 1010 with XOR and NOT feedback, shift control high: contents after 4 clocks
When the shift control is high, what will be the binary content of the shift registers A and B after four clock pulses?
- (A)A = 1101, B = 1101
- (B)A = 1110, B = 1001
- (C)A = 0101, B = 1101
- (D)A = 1010, B = 1111
Answer: (C) Official key: C
- On every clock edge both registers shift one place to the right. The new first bit of A is (the NOT of the second bit, XORed with the last bit). The last bit of A moves into the first place of B, and the last bit of B is lost.
- Start: A = 1101, B = 1010. Pulse 1: new bit , so A = 1110, and B = 1101 (the 1 that left A came in at the left of B).
- Pulse 2: new bit , so A = 0111 and B = 0110.
- Pulse 3: new bit , so A = 1011 and B = 1011.
- Pulse 4: new bit , so A = 0101 and B = 1101. Option (C).
Trap: forgetting that the XOR uses the inverted second bit, or shifting A left instead of right. We simulated both registers clock by clock for four pulses and tested every option: only A = 0101, B = 1101 matches.
Shift registers with XOR feedback are linear-feedback shift registers, used to generate pseudo-random test patterns, CRC checks on serial links and scrambling codes. The shift-through structure is also how serial data from a sensor or ADC is collected into a parallel word.
Three D flip-flops with hold multiplexers and a NAND decode: output Y from the 3rd to the 5th clock
- (A)001
- (B)010
- (C)000
- (D)011
Answer: (A) Official key: A
- Read the circuit. Each multiplexer has selecting input 1 (the previous stage: DIN for the first, for the second, for the third) and selecting input 0, which is the stage's own . So the three flip-flops form a shift register that shifts when and holds when .
- Output: , a NAND of the two AND gates.
- Read and DIN at each rising clock edge (they change before the edge): and for clocks 1 to 8.
- Step through, writing after each clock: 100 110 011 011 101 101 110 011. Clock 1: shift in 1. Clock 2: shift in 1. Clock 3: shift in 0. Clock 4: , hold. Clock 5: , shift in 1.
- after clocks 3, 4 and 5: after clock 3 the state is 011, , so . After clock 4 it holds at 011 and . After clock 5 the state is 101, so both AND gates are 0 and .
- . Option (A).
Trap: ignoring the hold () and always shifting gives 011, which is option (D). We simulated the register clock by clock from the timing diagram and tested every option: only 001 matches.
A shift register with a hold input is the basic building block of serial-to-parallel conversion and of the shift registers used in SPI peripherals and display drivers. Gating its outputs, as in the NAND here, detects a specific bit pattern, which is how simple frame detectors and sequence checkers are built.
Minimised Boolean function Y(P, Q, R) of two cascaded multiplexers (4-to-1 into 2-to-1)
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- A multiplexer passes the data input chosen by its select lines, so its output is a sum of products: each data input AND its select pattern.
- Inner 4-to-1 MUX: select picks data inputs for . That table is 1 when exactly one of is 1, so the inner output is .
- Outer 2-to-1 MUX: select . When it passes input 0, the inner output . When it passes input 1, which is tied to logic 1.
- So . Since , this reduces to . Option (A).
Trap: reading the outer MUX as AND-ing with the inner output (option B), or forgetting that the select line picks the constant 1 when . We evaluated the two-MUX circuit for all eight rows of and tested every option against that table: only matches.
Multiplexers route one of several signals onto a shared line, for example one of 8 sensor channels into a single converter. Treating a MUX as a lookup table of its data inputs is also how small programmable logic blocks implement arbitrary functions.
Boolean function X = A'B' + A'C': reduced form of the complement of X
- (A)
- (B)
- (C)
- (D)
Answer: (B) Official key: B
- Minimising a Boolean function means using the laws of Boolean algebra (or a K-map) to get fewer literals. De Morgan's theorem complements a sum of products into a product of sums.
- First factor : .
- Complement it: .
- Option (B): .
Trap: complementing each literal but leaving the AND and OR operators unchanged, which gives option (A) or (C). We built the truth table of , complemented it, and compared it with every option over all eight input rows: only matches.
Boolean minimisation is done every time logic is squeezed into fewer gates, whether on a PLD, an FPGA or a hand-wired interlock. Fewer literals mean fewer gates, lower power and fewer places for a fault.
Two D flip-flops with OR/AND feedback on a 12 MHz clock: output F frequency for Control = 0 and 1
- (A)4 MHz and 6 MHz
- (B)6 MHz and 4 MHz
- (C)3 MHz and 4 MHz
- (D)3 MHz and 6 MHz
Answer: (A) Official key: A
- A D flip-flop copies its D input to on every clock edge. Write the next-state equations from the figure. Call the left flip-flop , the right , and .
- Left: . Right: .
- Control = 0: . Start at : next , then , then again. Three clock periods per cycle. goes 1, 1, 0 and repeats, one rising edge every 3 clocks: .
- Control = 1: the OR output is always 1, so . The right flip-flop toggles on every clock, one cycle per 2 clocks: .
- The pair is 4 MHz and 6 MHz. Option (A).
Trap: reading F as the Q output instead of Q-bar. Then the AND gate multiplies by and the circuit locks at 0 or 1 and never oscillates. We simulated the circuit clock by clock from reset: Control = 0 gave F = 101101101101 (period 3) and Control = 1 gave F = 010101010101 (period 2). Counting rising edges gave 4 MHz and 6 MHz.
Dividing a fast clock by 2, 3 or a selectable ratio is routine in microcontroller timers and clock-generation blocks. A control input that changes the divide ratio gives a simple programmable divider.
Four D flip-flops with XOR feedback, initial state 1011: state after two rising clock edges
- (A)1101
- (B)0101
- (C)1010
- (D)1011
Answer: (C) Official key: C
- A D flip-flop copies its D input to Q on each rising clock edge, all at the same instant. So the four flip-flops form a shift register: , , .
- The first flip-flop takes its input from the XOR gate: . This is a linear feedback shift register.
- Edge 1: start . , then the others shift right: new state .
- Edge 2: , shift right: new state . Option (C).
Trap: using the old and new values mixed in one edge. All flip-flops read their inputs just before the edge, so the XOR uses the state before the shift. We simulated the four flip-flops clock by clock from 1011 and tested each option against the state after two edges.
Shift registers with XOR feedback generate pseudo-random bit sequences used for test patterns, scramblers and CRC checks in digital instruments. The same structure with parallel load and serial output is how a microcontroller talks to many sensors over a few pins.