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

GATE 2024 · EE · Q.24MCQ · 1 markBoolean algebra, logic gates and multiplexers

F(P, Q, R, S) = P̄Q̄ + P̄QS + PQ̄R̄S̄ + PQ̄RS̄: what is the simplified form?

Simplified form of the Boolean function is
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (A) Official key: A

  1. First two terms: .
  2. Last two terms: . drops out.
  3. .
  4. 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.

Where this shows up in industry

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.

GATE 2025 · EE · Q.37MCQ · 2 marksBoolean algebra, logic gates and multiplexers

Product of four maxterms in u, v, w, x: which gate circuit is the simplified function?

A Boolean function is given as The simplified form of this function is represented by
  1. (A)u and w, each through a NOT gate, into a two-input OR gate whose output is fuwf
  2. (B)u and w straight into a two-input OR gate whose output is fuwf
  3. (C)v and x, each through a NOT gate, into a two-input OR gate whose output is fvxf
  4. (D)v and x straight into a two-input OR gate whose output is fvxf

Answer: (A) Official key: A

  1. Every factor contains . Write each factor as , where runs over , , , .
  2. (distributive law), with .
  3. : the four factors cover every combination of and .
  4. : 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.

Where this shows up in industry

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.

GATE 2026 · EE · Q.45MCQ · 2 marksBoolean algebra, logic gates and multiplexers

NOR, NOT, AND and OR gates on x, y, z: what is the simplified output?

The digital circuit shown has 3 inputs (, , and ). The simplified logical expression for the output (OUT) is:
Inputs x, y, z all feed a three-input NOR gate. x also goes through a NOT gate; x-bar AND y and x-bar AND z feed an OR gate. The NOR output and the OR output feed a final AND gate whose output is OUTNORxyzNOTANDANDORANDOUT
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (B) Official key: B

  1. NOR gate: .
  2. The NOT gate gives ; the two AND gates give and ; the OR gate gives .
  3. Final AND: , because and .
  4. 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.

Where this shows up in industry

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.

GATE 2026 · EE · Q.46MCQ · 2 marksBoolean algebra, logic gates and multiplexers

Ideal MOSFET switches with 5 kΩ and 10 kΩ pull-ups: what is OUT, and the maximum power?

The MOSFET switches shown in the circuit are ideal. Which of the following is the correct option for Boolean logical expression of the output (OUT), and the maximum possible power (P) consumed by the circuit?
5 V supply. A 5 kilo-ohm resistor pulls OUT up; two n-MOSFETs with gates A and B in series pull OUT to ground; a third n-MOSFET also connects OUT to ground and its gate is node N. A 10 kilo-ohm resistor pulls N up to 5 V and an n-MOSFET with gate C pulls N to ground5 V5 kΩ10 kΩOUTABNC
  1. (A),
  2. (B),
  3. (C),
  4. (D),

Answer: (D) Official key: D

  1. Right branch: the switch pulls node to ground when , otherwise the 10 kΩ pulls to 5 V. So .
  2. drives the gate of the middle MOSFET, which shorts OUT to ground when , that is when .
  3. OUT is also pulled low by the series pair when . So OUT is low when : (De Morgan).
  4. Power: current flows only through a resistor whose bottom end is grounded. OUT low costs ; low costs .
  5. 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.

Where this shows up in industry

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.

GATE 2024 · EE · Q.26MCQ · 1 markBoolean algebra, logic gates and multiplexers

4:1 MUX with X, Y on the select lines: what inputs PQRS give F = XȲ + X̄?

To obtain the Boolean function , the inputs in the figure should be ( and are the select lines.)
4:1 multiplexer with data inputs P, Q, R, S on lines 0, 1, 2, 3; select line S1 (MSB) = X and S0 (LSB) = Y; output F(X, Y)4:1 multiplexerP0Q1R2S3F(X, Y)MSBS1XLSBS0Y
  1. (A)1010
  2. (B)1110
  3. (C)0110
  4. (D)0001

Answer: (B) Official key: B

  1. With on the MSB select and on the LSB, the multiplexer passes input number : , , , .
  2. Each input must equal for its row: , (the term), (the term), .
  3. : 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.

Where this shows up in industry

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.

GATE 2022 · EE · Q.26NAT · 1 markFlip-flops, counters and sequential circuits

A MOD 2 and a MOD 5 counter in cascade: what MOD counter results?

A MOD 2 and a MOD 5 up-counter when cascaded together results in a MOD ______ counter. (in integer)

Answer: MOD Official key: 10 to 10

  1. 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.
  2. The pair returns to its starting state after clocks.
  3. 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.

Where this shows up in industry

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.

GATE 2022 · EE · Q.29NAT · 1 markFlip-flops, counters and sequential circuits

4-stage ripple counter, 20 ns per flip-flop: what is the maximum clock frequency?

The maximum clock frequency in MHz of a 4-stage ripple counter, utilizing flip-flops, with each flip-flop having a propagation delay of 20 ns, is ___________. (round off to one decimal place)

Answer: Official key: 12.3 to 12.7

  1. 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.
  2. 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.

Where this shows up in industry

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.

GATE 2024 · EE · Q.25MCQ · 1 markFlip-flops, counters and sequential circuits

D flip-flop with S = X ⊕ Y ⊕ Z fed back: what are S and Z after one clock?

In the circuit, the present value of is 1. Neglecting the delay in the combinatorial circuit, the values of and , respectively, after the application of the clock will be
A combinational circuit computes S = X xor Y xor Z from X = 1, Y = 0 and the fed-back Z; S drives the D input of a D flip-flop; the flip-flop's Q output is Z, which is also fed back to the combinational circuitS = X ⊕ Y ⊕ ZCombinational circuitZX = 1Y = 0DQQSCLKZD flip-flop
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (C) Official key: C

  1. Before the clock: . This is the value waiting at the D input.
  2. The clock edge copies to : becomes .
  3. The combinational circuit has no delay, so updates at once with the new : .
  4. , : 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.

Where this shows up in industry

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.

GATE 2023 · EE · Q.56NAT · 2 marksFlip-flops, counters and sequential circuits

NOR, XOR and two D flip-flops: which initial ABCD never changes with the clock?

Neglecting the delays due to the logic gates in the circuit shown in figure, the decimal equivalent of the binary sequence [ABCD] of initial logic states, which will not change with clock, is ____________.
Input A drives both inputs of a NOR gate whose output is B; B and C feed an XOR gate whose output is D. Flip-flop 2 takes D at its D input and its Q output is node C, which also feeds the D input of flip-flop 1. The Q-bar output of flip-flop 1 is node A. Both flip-flops share the clock CLKANORXORBCDD flip-flopD flip-flopDQQDCLK

Answer: () Official key: 8 to 8

  1. Read the circuit: , , , . On each clock, and .
  2. For the state not to change, the next values must equal the present ones: means , and means .
  3. forces , so ; then .
  4. , . 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.

Where this shows up in industry

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.

GATE 2023 · EE · Q.40MCQ · 2 marksADC and microcontroller

8-bit ADC, 0 to 5 V, with the staircase shown: what hex code for Vin = 1.9922 V?

An 8 bit ADC converts analog voltage in the range of 0 to +5 V to the corresponding digital code as per the conversion characteristics shown in figure. For , which of the following digital output, given in hex, is true?
8-bit ADC conversion staircase: output 00H from 0 to 9.8 mV, 01H from 9.8 mV, 02H from 29.4 mV, 03H from 49 mV and so on; each code is centred (marked by a caret) at 0, 19.6, 39.2, 58.8 mV, so one step is 19.6 mV00H01H02H03H09.819.639.258.8Vin (mV)Digital output (hex)
  1. (A)64H
  2. (B)65H
  3. (C)66H
  4. (D)67H

Answer: (C) Official key: C

  1. 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 .
  2. , which rounds to .
  3. 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.

Where this shows up in industry

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.

GATE 2023 · EE · Q.57NAT · 2 marksADC and microcontroller

MOV R0, 0x60; MOV R1, 0x46; ADD R0, R1: what is the flag pattern [CAOP] in decimal?

In a given 8-bit general purpose micro-controller there are following flags. C-Carry, A-Auxiliary Carry, O-Overflow flag, P-Parity (0 for even, 1 for odd). R0 and R1 are the two general purpose registers of the micro-controller. After execution of the following instructions, the decimal equivalent of the binary sequence of the flag pattern [CAOP] will be __________.
MOV R0, +0x60
MOV R1, +0x46
ADD R0, R1

Answer: () Official key: 2 to 2

  1. (decimal ).
  2. Carry C: , no carry out of bit 7, so .
  3. Auxiliary carry A: low nibbles , no carry out of bit 3, so .
  4. 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 .
  5. 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.

Where this shows up in industry

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.

From GATE prep to a embedded systems career

Talk to a counsellor.

Talk to a career counsellor

Free 20-minute call. We'll map the right course to where you want to work.

By submitting you agree to our Terms and Privacy Policy.

Talk to a career counsellor

Talk to a career counsellor

Free 20-minute call. We'll map the right course to where you want to work.

By submitting you agree to our Terms and Privacy Policy.