GATE Electronics (EC): Digital Circuits (Boolean algebra, K-maps, logic gates, MUX, flip-flops, counters, timing, ADC/DAC, memory), previous-year questions solved

Every digital circuits question from the last five GATE Electronics and Communication papers: Boolean simplification and K-maps, multiplexer and gate circuits, CMOS logic, flip-flops, counters, shift registers, critical-path and setup/hold timing, ADC and DAC questions, memory addressing and instruction formats. Each solution matches the official answer key, was checked by code (full truth tables, clock-by-clock simulation, timing sums or the converter formula), names the trap that costs marks, and shows where the idea is used in real chip and embedded design.

Questions from official GATE EC papers (IIT Kharagpur 2022, IIT Kanpur 2023, IISc Bengaluru 2024, IIT Roorkee 2025, IIT Guwahati 2026); solutions by Skill-Lync. · Updated 17 Nov 2026 · 15 of 32 questions on this page

GATE 2022 · EC · Q.27MSQ · 1 markNumber systems, Boolean algebra and K-maps

Which Boolean functions are equivalent to x + yz?

Select the Boolean function(s) equivalent to , where , , and are Boolean variables, and denotes logical OR operation.
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (B) and (C) Official key: B,C

  1. (B): distributive law . Equivalent.
  2. (C): absorption , so . Equivalent.
  3. (A): , so . When this gives 1, but . Not equivalent.
  4. (D): by absorption, which misses . Not equivalent.
  5. Correct options: (B) and (C).

Trap: choosing (A) because it contains and and looks like a rearrangement. It simplifies to , a different function. We compared all 8 rows of the truth table for every option.

Where this shows up in industry

Equivalence of two logic expressions is exactly what a formal equivalence checker proves in a chip flow, after synthesis and before tape-out, to show the optimised netlist still matches the original RTL.

GATE 2024 · EC · Q.19MCQ · 1 markNumber systems, Boolean algebra and K-maps

F(A, B, C, D) = sum m(0,2,5,7,8,10,12,13,14,15): which are the essential prime implicants?

For the Boolean function the essential prime implicants are __________.
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (A) Official key: A

  1. Group the 1s on the 4-variable K-map ( is the MSB). The four corners form . The block forms . The block forms . The block forms . These four are all the prime implicants.
  2. A prime implicant is essential if it alone covers some 1. Minterm is covered only by . Minterm is covered only by . So both are essential.
  3. is not essential: its minterms are covered elsewhere, and by , and and also by . After the two essentials, only and are left, and or can finish.
  4. Essential prime implicants: and , option (A).

Trap: option (D), listing every large group. is a prime implicant but not an essential one, because covers the same leftover minterms and . We generated every implicant and kept the maximal ones (four primes), then checked which cover a minterm no other prime covers: exactly and .

Where this shows up in industry

Logic synthesis tools run this same prime-implicant and essential-cover step when they minimise the combinational logic of an FPGA or ASIC block, and the choice between equally good covers like and is where they trade area against timing.

GATE 2024 · EC · Q.29NAT · 1 markNumber systems, Boolean algebra and K-maps

In base r, x^2 - 12x + 37 = 0 has the root x = 8: what is r?

In a number system of base , the equation has as one of its solutions. The value of is ________.

Answer: Official key: 11 to 11

  1. The digits and are written in base : and . The digit exists only if .
  2. Substitute : .
  3. , so .

Trap: reading and as decimal numbers. Then , so would not be a root at all. We scanned every base from to : only makes the equation true.

Where this shows up in industry

Hardware people move between binary, octal and hexadecimal all day, for example reading a 12-digit hex address from a waveform dump or a debugger; the habit of expanding digits by powers of the base is exactly this calculation.

GATE 2025 · EC · Q.23MCQ · 1 markNumber systems, Boolean algebra and K-maps

3-input majority gate with inputs X, Y, Z: which is its Boolean expression?

A 3-input majority logic gate has inputs , and . The output of the gate is logic '1' if two or more of the inputs are logic '1'. The output is logic '0' if two or more of the inputs are logic '0'.
Which one of the following options is a Boolean expression of the output ?
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (A) Official key: A

  1. exactly when at least two inputs are : the rows of .
  2. Write each pair that can make two ones: and , or and , or and .
  3. : option (A).

Trap: option (B), the three-input XOR. It is when an odd number of inputs are . It matches the majority on , but fails on 6 of the 8 rows (for example gives for XOR and for majority). That XOR is the sum output of a full adder, while the majority is its carry output. We compared all 8 rows for every option: only (A) matches.

Where this shows up in industry

The majority function is the carry logic of every adder, and triple modular redundancy in space and automotive electronics uses a 3-input majority voter to mask one faulty copy of a signal.

GATE 2026 · EC · Q.45MCQ · 2 marksNumber systems, Boolean algebra and K-maps

What is the 10's complement of (47) in decimal?

What is the 10's complement of ?
  1. (A)52
  2. (B)53
  3. (C)54
  4. (D)55

Answer: (B) Official key: B

  1. The 9's complement subtracts each digit from : .
  2. The 10's complement is the 9's complement plus : . Equivalently .
  3. : option (B).

Trap: option (A), , which is the 9's complement. Adding is the step that turns it into the 10's complement. The code checked .

Where this shows up in industry

The 10's complement is the decimal twin of the 2's complement that every CPU ALU uses for subtraction: invert the digits, add one, and then the subtractor is just an adder. Decimal versions appear in BCD arithmetic units.

GATE 2026 · EC · Q.56MSQ · 2 marksNumber systems, Boolean algebra and K-maps

f(w,x,y,z) = sum of m(0,2,5,7,8,10,13,14,15): which expressions are valid forms?

Consider the four-variable Boolean function, with 'w' as MSB and 'z' as LSB. Which of the following expressions is/are the valid form(s) of ?
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (A) and (D) Official key: A;D

  1. Plot the minterms on a K-map. The four corners form the group .
  2. The block forms .
  3. Minterm () is left. It can pair with to give , or with to give . Either choice covers it.
  4. So . Options (A) and (D) are valid.

Trap: (B) and (C) look like longer expansions of the same function, but both contain , which is minterm , and is not in the list. (B) also misses minterms and and (C) also misses . The code compared all 16 rows of each option: A and D match exactly, B differs at rows 0, 2, 6 and C at rows 5, 6, 7, 13.

Where this shows up in industry

Several different but equivalent sum-of-products forms of one function is what logic synthesis tools produce and compare. Equivalence checking in chip design formally proves, like the truth-table check here, that two such forms are the same function.

GATE 2022 · EC · Q.19MCQ · 1 markLogic gates, CMOS logic, multiplexers and encoders

2-bit MUX with C, D on the select lines: which A0 to A3 make OUTPUT = C XOR D?

Consider the 2-bit multiplexer (MUX) shown in the figure. For OUTPUT to be the XOR of C and D, the values for , , , and are ____________.
2-bit multiplexer with data inputs A0, A1, A2, A3 on lines 0 to 3, select S1 driven by C and select S0 driven by D, and one OUTPUTA00A11A22A33INPUTSELECTS1S0OUTPUTCD
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (C) Official key: C

  1. is on (the MSB) and is on , so the MUX passes input number : , , , .
  2. The output must equal in each row: , , , .
  3. So , , , : option (C).

Trap: picking an option that looks \"half right\". (A) gives alone, (B) gives alone and (D) gives alone. We checked all four select combinations for every option: only (C) gives .

Where this shows up in industry

A 4:1 multiplexer with its data pins tied to constants is a 2-input lookup table, the basic logic cell of an FPGA. Any 2-input function, XOR included, is made by choosing the four constants.

GATE 2022 · EC · Q.28MSQ · 1 markLogic gates, CMOS logic, multiplexers and encoders

Which statements about CMOS implementation of NOT gates are correct?

Select the correct statement(s) regarding CMOS implementation of NOT gates.
  1. (A)Noise Margin High () is always equal to the Noise Margin Low (), irrespective of the sizing of transistors.
  2. (B)Dynamic power consumption during switching is zero.
  3. (C)For a logical high input under steady state, the nMOSFET is in the linear regime of operation.
  4. (D)Mobility of electrons never influences the switching speed of the NOT gate.

Answer: (C) Official key: C

  1. (A) is false. and depend on where the switching point sits, and that depends on the ratio of the pMOS against the nMOS. Only a matched inverter has . In our square-law model an inverter with the nMOS 4 times stronger has and .
  2. (B) is false. Each switching cycle charges and discharges the load, , which is not zero. Only the static power is almost zero.
  3. (C) is true. With input high the nMOS is on and the pMOS is off, so the output sits near 0 V. Then , which is the linear (triode) region.
  4. (D) is false. Electron mobility sets the nMOS drive current, so it sets the high-to-low delay. Doubling it made the falling edge faster in our model.
  5. Correct option: (C).

Trap: choosing (A) or (B) from the textbook picture of an ideal symmetric inverter that dissipates nothing. Equal noise margins need matched strength, and every transition draws charge from the supply. Our model gave for an unmatched inverter, and a non-zero .

Where this shows up in industry

Standard-cell libraries ship inverters in many drive strengths, and pMOS devices are drawn about 2 to 3 times wider than nMOS to offset the lower hole mobility. Dynamic power, , is the number power-estimation tools report first.

GATE 2022 · EC · Q.49MSQ · 2 marksLogic gates, CMOS logic, multiplexers and encoders

Gate D computes Y = A + B' (bar on B). With only D gates and constants 0 and 1, which logic can be built?

Consider a Boolean gate (D) where the output is related to the inputs and as, , where denotes logical OR operation. The Boolean inputs '0' and '1' are also available separately. Using instances of only D gates and inputs '0' and '1', __________ (select the correct option(s)).
  1. (A)NAND logic can be implemented
  2. (B)OR logic cannot be implemented
  3. (C)NOR logic can be implemented
  4. (D)AND logic cannot be implemented

Answer: (A) and (C) Official key: A,C

  1. NOT: tie . . One D gate.
  2. NAND: feed (from the NOT) to the first input and to the second. . Two D gates.
  3. OR: feed to the first input and to the second. . Two D gates.
  4. NOR: invert the OR output with one more D gate: . Three D gates. AND: invert the NAND output: . Three D gates.
  5. So NAND, NOR, OR and AND can all be implemented. The true statements are (A) and (C). (B) and (D) say something cannot be built, so they are false.

Trap: reading (B) and (D) as true because the gate looks like \"OR with a bubble\". With the constant 0 the gate becomes a NOT, and NOT with OR is a complete set. We built each function from D gates and checked its truth table, and the closure of under D reaches all 16 two-input functions.

Where this shows up in industry

This is functional completeness, the reason a standard-cell library can be tiny: NAND or NOR alone is enough to build any logic. Technology mapping tools rely on the same idea to cover a netlist with whichever cells the library offers.

GATE 2023 · EC · Q.23MCQ · 1 markLogic gates, CMOS logic, multiplexers and encoders

2 x 1 MUX with I0 grounded, I1 = P and select = Q: which function does it realise?

In the circuit shown below, P and Q are the inputs. The logical function realized by the circuit shown below is
2 by 1 multiplexer: input I0 connected to ground (logic 0), input I1 connected to P, select input connected to Q, output Y2 × 1MUXI0PI1SelQY
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (A) Official key: A

  1. A 2:1 MUX gives .
  2. Here (ground), and .
  3. : option (A).

In words: when the MUX passes the grounded input, so . When it passes . Trap: (B), (C) and (D) all give 1 for some row where the output should be 0, for example with gives 1 in (B). A MUX whose only inputs are 0 and can never output more than . We checked all 4 rows: only (A) matches.

Where this shows up in industry

Gating a signal with an enable through a MUX with one input tied low is the commonest use of a MUX in FPGA fabric, where the tool maps it into a lookup table. The same AND-as-gate idea blocks a bus when a device is not selected.

GATE 2024 · EC · Q.40MCQ · 2 marksLogic gates, CMOS logic, multiplexers and encoders

4-bit priority encoder, D3 highest, AB = 00, 01, 10, 11: what is the expression for B?

A 4-bit priority encoder has inputs , and in descending order of priority. The two-bit output is generated as , and corresponding to inputs , and , respectively. The Boolean expression of the output bit is ________.
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (B) Official key: B

  1. for the codes and . These are the cases where the winner is or .
  2. wins when and (whatever and are): term .
  3. wins when and . Since is already part of the case , this folds into (with free), and the extra case gives too, which is correct because wins there.
  4. : option (B).

Trap: option (D), . It misses the case , where wins and must be but (D) gives . We compared every option with the encoder on all 15 inputs where at least one line is active: only (B) matches (the others fail on 6, 9 and 2 of the 15 inputs). The all-zero input is not a valid request, so the question does not define it; the keyed expression gives there, the same as the code for .

Where this shows up in industry

Priority encoders pick the highest-priority request: they sit inside interrupt controllers, bus arbiters and leading-zero counters in CPUs, and synthesis tools infer them from an if-else-if chain in Verilog or VHDL.

GATE 2024 · EC · Q.41MCQ · 2 marksLogic gates, CMOS logic, multiplexers and encoders

2x1 MUX with 10 ns delay, input 0 tied to Y and input 1 to NOT Y: what is Y when S = 1?

The propagation delay of the MUX shown in the circuit is . Consider the propagation delay of the inverter as . If S is set to 1 then the output Y is ________.
A 2 by 1 multiplexer with input 0 and input 1. Input 0 is tied to the output Y. An inverter takes Y and its output feeds input 1. The select line S is the only external input2 X 1MUX01YS
  1. (A)a square wave of frequency 100 MHz
  2. (B)a square wave of frequency 50 MHz
  3. (C)constant at 0
  4. (D)constant at 1

Answer: (B) Official key: B

  1. With the MUX passes input , which is the inverter output. The inverter input is the node tied to , so input .
  2. So follows after the MUX delay: . There is no stable value, because is impossible.
  3. flips every , so one full cycle (low, then high) takes .
  4. , a square wave: option (B).

Trap: option (A), , which treats the delay as the whole period. It is only half the period. We simulated the loop event by event: the output toggles at every step, the rising edges are apart, and never settles, which rules out (C) and (D).

Where this shows up in industry

A loop with an odd number of inversions is a ring oscillator. Chip makers put them on test chips to measure gate delay and process speed, and a ring of inverters with a tunable delay is a common voltage-controlled oscillator inside on-chip PLLs.

GATE 2025 · EC · Q.24MCQ · 1 markLogic gates, CMOS logic, multiplexers and encoders

Full adder plus XOR on Y and Z, Z tied to carry-in: what does it do when Z = 1?

A full adder and an XOR gate are used to design a digital circuit with inputs , and , and output , as shown below. The input is connected to the carry-in input of the full adder.
If the input is set to logic '1', then the circuit functions as ________ with and as inputs.
A full adder with inputs X, the output of an XOR gate, and a carry-in. The XOR gate takes Y and Z. Z also goes straight to the carry-in of the full adder. The output F is a 2-bit bus (sum and carry-out)XYZfulladder2F
  1. (A)an adder
  2. (B)a subtractor
  3. (C)a multiplier
  4. (D)a binary to Gray code converter

Answer: (B) Official key: B

  1. With the XOR gives . The full adder receives , and carry-in .
  2. It computes . That is the two's-complement way to subtract: (plus the carry flag).
  3. Check with the sum bit and carry-out. Sum , the difference bit. Carry-out when , so it is the inverse of the borrow.
  4. The circuit is a subtractor: option (B).

Trap: option (A). It would be right for , when the XOR passes unchanged and the carry-in is , so the circuit adds. With the output for is , but an adder would give . We worked out the four rows for : , , , as . They equal of a subtractor, and differ from an adder, a multiplier () and a Gray encoder.

Where this shows up in industry

This is the add/subtract unit inside every ALU: one control bit XORs the second operand and feeds the carry-in, so the same adder does both and . The same trick sets up the carry and overflow flags that a CPU uses for comparisons.

GATE 2026 · EC · Q.20MCQ · 1 markLogic gates, CMOS logic, multiplexers and encoders

CMOS gate with two series PMOS and two parallel NMOS: which logic operation is realised?

In the circuit shown in the Figure, A and B are logic inputs and Y is the logic output. Which of the following logic operations is realized by the circuit?
Static CMOS gate. Two p-channel MOSFETs in series between the supply V DD and the output Y, with gates A and B; two n-channel MOSFETs in parallel between Y and ground, with gates A and B. The wire from input B to the right n-channel gate hops over the output wire without connecting to itVDDABY
  1. (A)NOR
  2. (B)OR
  3. (C)XOR
  4. (D)AND

Answer: (A) Official key: A

  1. The two p-channel MOSFETs at the top are in series. A p-channel device conducts when its gate is , so the pull-up path to exists only when and .
  2. The two n-channel MOSFETs at the bottom are in parallel. An n-channel device conducts when its gate is , so Y is pulled to ground when or .
  3. So only for , and for , , . That is : NOR, option (A).

Trap: choosing AND or OR because of the series transistors, or reading the stack as an AND. A single static CMOS stage always inverts, and rules out OR, XOR and AND, which all give there. We evaluated all 4 input rows at switch level: exactly one of the pull-up and pull-down networks conducts every time, and only NOR matches.

Where this shows up in industry

This is the standard 2-input CMOS NOR cell found in every standard-cell library. Because the PMOS devices sit in series, a NOR is slower and larger than a NAND of the same drive, which is why synthesis tools prefer NAND-based mappings where they can.

GATE 2026 · EC · Q.48MCQ · 2 marksLogic gates, CMOS logic, multiplexers and encoders

4:1 MUX with data inputs 1, 0, 1, y and selects x, z: what is f(x, y, z)?

A Boolean function, with as MSB and as LSB is realized by 4:1 multiplexer (MUX) with select lines, and ( is MSB, is LSB) and inputs, as shown in the Figure. Which of the following options is the correct expression of ?
4-to-1 multiplexer with select S1 (MSB) connected to x and S0 (LSB) connected to z. Data inputs: I0 is tied to 1, I1 is tied to 0, I2 is tied to 1 (a branch of the same wire as I0, with the 0 wire hopping over it), and I3 is connected to y. Output f(x, y, z)4:1MUXI0I1I2I310yS1S0xzf(x, y, z)
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (C) Official key: C

  1. Read the figure: , (the 0 wire hops over the vertical wire, it does not join it), (a branch of the 1 wire), . Selects: , .
  2. The multiplexer passes : , , , .
  3. (since by the absorption law).
  4. : option (C).

Trap: reading the arc as a junction makes and gives , and swapping the select lines gives . Neither matches any option. We compared the 8-row truth table of the circuit with all four options: only (C) matches.

Where this shows up in industry

A multiplexer with some data pins tied to constants and one to a signal is a small lookup table. This is exactly how an FPGA logic cell implements a function, and the synthesis tool finds the constants the same way, by reading each select combination.

From GATE prep to a VLSI or embedded 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.