GATE Electrical: Digital Electronics (Boolean algebra, logic gates, multiplexers, flip-flops, counters, ADC), previous-year questions solved
Every digital electronics question from the last five GATE Electrical papers: Boolean simplification, reading gate circuits, MOSFET switch logic, multiplexers, flip-flop circuits, counters, an ADC staircase and microcontroller flags. Each solution matches the official answer key, was checked against the full truth table or a clock-by-clock simulation, names the trap that costs marks, and shows where the idea is used in real hardware.
Questions from official GATE EE papers (IIT Kharagpur 2022, IIT Kanpur 2023, IISc Bengaluru 2024, IIT Roorkee 2025, IIT Guwahati 2026); solutions by Skill-Lync. · Updated 16 Nov 2026 · 11 questions
F(P, Q, R, S) = P̄Q̄ + P̄QS + PQ̄R̄S̄ + PQ̄RS̄: what is the simplified form?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- First two terms: .
- Last two terms: . drops out.
- .
- So , and is the consensus of and (it is covered by them), so : option (A).
Trap: stopping at , option (B), after merging the obvious pairs. That misses the minterm (for example gives but (B) gives 0). We compared all 16 rows of the truth table: only (A) matches.
Logic minimisation is what synthesis tools do for every FPGA and ASIC design, and what a firmware engineer does by hand when a fault-detection or interlock condition in a motor controller has to be written as a short, testable expression.
Product of four maxterms in u, v, w, x: which gate circuit is the simplified function?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- Every factor contains . Write each factor as , where runs over , , , .
- (distributive law), with .
- : the four factors cover every combination of and .
- : NOT gates on and into an OR gate, option (A).
Shortcut: each factor is a maxterm, a row where . The four rows are with any , so exactly when , which is . Trap: dropping the bars and picking (B). The truth table has 12 ones out of 16 rows, and only (A) matches it.
Reading a product-of-sums from the zeros of a truth table is how safety interlocks are written: the output is forced off only for the listed fault combinations. PLC and FPGA designers check such logic against the full truth table before it goes on hardware.
NOR, NOT, AND and OR gates on x, y, z: what is the simplified output?
- (A)
- (B)
- (C)
- (D)
Answer: (B) Official key: B
- NOR gate: .
- The NOT gate gives ; the two AND gates give and ; the OR gate gives .
- Final AND: , because and .
- OUT for every input: option (B).
In words: the NOR output is 1 only when , and the OR branch is 1 only when or is 1. They are never 1 together. Trap: answering (C), which is the OR gate's output, and forgetting the final AND with the NOR. We evaluated the circuit for all 8 inputs: always 0.
A gate whose output can never be 1 is a real design bug: it shows up in FPGA synthesis reports as logic optimised away, and in safety logic as an alarm that can never fire. Static checks for constant outputs are part of every digital design review.
Ideal MOSFET switches with 5 kΩ and 10 kΩ pull-ups: what is OUT, and the maximum power?
- (A),
- (B),
- (C),
- (D),
Answer: (D) Official key: D
- Right branch: the switch pulls node to ground when , otherwise the 10 kΩ pulls to 5 V. So .
- drives the gate of the middle MOSFET, which shorts OUT to ground when , that is when .
- OUT is also pulled low by the series pair when . So OUT is low when : (De Morgan).
- Power: current flows only through a resistor whose bottom end is grounded. OUT low costs ; low costs .
- Both happen at once for : , with : option (D).
Trap: (A) has the right logic too (it is the same function before De Morgan) but only 5 mW, the power when just the OUT branch conducts. With the 10 kΩ branch always conducts, so the maximum is 7.5 mW. We checked all 8 input combinations at switch level.
Resistor pull-up (NMOS) logic burns power whenever an output is low, which is why chips moved to CMOS. The same sum of V²/R per conducting branch is how engineers budget the static current of open-drain buses such as I²C, and of pull-up resistors on microcontroller pins.
4:1 MUX with X, Y on the select lines: what inputs PQRS give F = XȲ + X̄?
- (A)1010
- (B)1110
- (C)0110
- (D)0001
Answer: (B) Official key: B
- With on the MSB select and on the LSB, the multiplexer passes input number : , , , .
- Each input must equal for its row: , (the term), (the term), .
- : option (B).
Shortcut: , a NAND, which is 0 only on the last row. Trap: swapping MSB and LSB; here it gives the same answer only because is symmetric in and , so always check which select line is the MSB.
A multiplexer with its data pins tied to 0 or 1 is a lookup table, the basic logic cell of every FPGA. Microcontrollers use the same idea to route one ADC to many sensor channels.
A MOD 2 and a MOD 5 counter in cascade: what MOD counter results?
Answer: MOD Official key: 10 to 10
- In a cascade, the first counter's output clocks the second. The MOD 2 stage completes one cycle every 2 input clocks, so the MOD 5 stage advances once every 2 clocks.
- The pair returns to its starting state after clocks.
- MOD
Rule: cascaded moduli multiply, they do not add (the trap answer is 7). This is how a decade counter such as the 7490 is built: a divide-by-2 and a divide-by-5 stage. A clock-by-clock simulation of the cascade repeats after exactly 10 clocks.
Cascaded dividers generate every slow timing signal from one crystal: a 32.768 kHz watch crystal divided by gives the 1 Hz tick of a real-time clock, and microcontroller timers chain prescalers the same way.
4-stage ripple counter, 20 ns per flip-flop: what is the maximum clock frequency?
Answer: Official key: 12.3 to 12.7
- In a ripple (asynchronous) counter each flip-flop is clocked by the previous one, so in the worst case a clock edge has to ripple through all stages before the count is valid.
- Settling time .
Trap: using one flip-flop delay, . That is the limit for a synchronous counter, where all flip-flops switch on the same edge. The ripple delay is why fast counters are synchronous.
Ripple delay is why designers read asynchronous counters only after they settle, and why timing analysis in FPGA tools adds up every stage in a path. A counter reading taken mid-ripple can show a value that never existed.
D flip-flop with S = X ⊕ Y ⊕ Z fed back: what are S and Z after one clock?
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- Before the clock: . This is the value waiting at the D input.
- The clock edge copies to : becomes .
- The combinational circuit has no delay, so updates at once with the new : .
- , : option (C).
Trap: answering , option (A), by reporting from before the clock. The question asks for both values after the clock, and depends on the new . With the circuit is a toggle: flips on every clock.
A flip-flop with its output fed back through an XOR is a toggle flip-flop, the building block of counters, frequency dividers and parity generators, and the same next-state reasoning is what a timing simulator does every clock cycle.
NOR, XOR and two D flip-flops: which initial ABCD never changes with the clock?
Answer: () Official key: 8 to 8
- Read the circuit: , , , . On each clock, and .
- For the state not to change, the next values must equal the present ones: means , and means .
- forces , so ; then .
- , . So , decimal .
Trap: treating as a free input. It is the output of the first flip-flop, so only the two flip-flop states are free and and follow from them. We simulated all four flip-flop states for one clock: only stays put.
Finding the states a sequential circuit can get stuck in is part of every state-machine design: lock-up states in counters and controllers are found this way, and a reset is added to force the circuit out of them.
8-bit ADC, 0 to 5 V, with the staircase shown: what hex code for Vin = 1.9922 V?
- (A)64H
- (B)65H
- (C)66H
- (D)67H
Answer: (C) Official key: C
- From the staircase, one step (1 LSB) is (), and the first transition is at half a step, . So the ADC rounds to the nearest code: code .
- , which rounds to .
- 66H: option (C).
Trap: truncating to 65H, option (B). That would be right for an ADC whose first step is at 1 LSB, but this staircase is shifted by half an LSB, so values round to the nearest code. Using per step instead gives , the same code.
The half-LSB offset is deliberate in real converters: it centres every code on its voltage, so the quantisation error is at most ±½ LSB instead of 0 to 1 LSB. Reading a sensor through a microcontroller ADC, this is the difference between a 10 mV and a 20 mV worst-case error.
MOV R0, 0x60; MOV R1, 0x46; ADD R0, R1: what is the flag pattern [CAOP] in decimal?
MOV R0, +0x60 MOV R1, +0x46 ADD R0, R1
Answer: () Official key: 2 to 2
- (decimal ).
- Carry C: , no carry out of bit 7, so .
- Auxiliary carry A: low nibbles , no carry out of bit 3, so .
- Overflow O: as signed numbers both operands are positive (, ) but the result has bit 7 set (it reads as ). The true sum 166 exceeds , so .
- Parity P: has four 1s, even, so (as defined in the question).
Trap: mixing up carry and overflow. Carry is the unsigned overflow (out of bit 7); overflow is the signed one (two positives giving a negative). Here only the signed result is wrong. We ran the addition through an 8-bit adder model with the four flag rules.
Firmware on 8-bit and 16-bit microcontrollers checks exactly these flags for saturating arithmetic in motor-control and battery-management code. A missed signed overflow in a PI controller integrator is a classic cause of a motor suddenly reversing.