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
Which Boolean functions are equivalent to x + yz?
- (A)
- (B)
- (C)
- (D)
Answer: (B) and (C) Official key: B,C
- (B): distributive law . Equivalent.
- (C): absorption , so . Equivalent.
- (A): , so . When this gives 1, but . Not equivalent.
- (D): by absorption, which misses . Not equivalent.
- 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.
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.
F(A, B, C, D) = sum m(0,2,5,7,8,10,12,13,14,15): which are the essential prime implicants?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- 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.
- 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.
- 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.
- 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 .
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.
In base r, x^2 - 12x + 37 = 0 has the root x = 8: what is r?
Answer: Official key: 11 to 11
- The digits and are written in base : and . The digit exists only if .
- Substitute : .
- , 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.
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.
3-input majority gate with inputs X, Y, Z: which is its Boolean expression?
Which one of the following options is a Boolean expression of the output ?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- exactly when at least two inputs are : the rows of .
- Write each pair that can make two ones: and , or and , or and .
- : 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.
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.
What is the 10's complement of (47) in decimal?
- (A)52
- (B)53
- (C)54
- (D)55
Answer: (B) Official key: B
- The 9's complement subtracts each digit from : .
- The 10's complement is the 9's complement plus : . Equivalently .
- : 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 .
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.
f(w,x,y,z) = sum of m(0,2,5,7,8,10,13,14,15): which expressions are valid forms?
- (A)
- (B)
- (C)
- (D)
Answer: (A) and (D) Official key: A;D
- Plot the minterms on a K-map. The four corners form the group .
- The block forms .
- Minterm () is left. It can pair with to give , or with to give . Either choice covers it.
- 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.
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.
2-bit MUX with C, D on the select lines: which A0 to A3 make OUTPUT = C XOR D?
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- is on (the MSB) and is on , so the MUX passes input number : , , , .
- The output must equal in each row: , , , .
- 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 .
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.
Which statements about CMOS implementation of NOT gates are correct?
- (A)Noise Margin High () is always equal to the Noise Margin Low (), irrespective of the sizing of transistors.
- (B)Dynamic power consumption during switching is zero.
- (C)For a logical high input under steady state, the nMOSFET is in the linear regime of operation.
- (D)Mobility of electrons never influences the switching speed of the NOT gate.
Answer: (C) Official key: C
- (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 .
- (B) is false. Each switching cycle charges and discharges the load, , which is not zero. Only the static power is almost zero.
- (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.
- (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.
- 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 .
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 D computes Y = A + B' (bar on B). With only D gates and constants 0 and 1, which logic can be built?
- (A)NAND logic can be implemented
- (B)OR logic cannot be implemented
- (C)NOR logic can be implemented
- (D)AND logic cannot be implemented
Answer: (A) and (C) Official key: A,C
- NOT: tie . . One D gate.
- NAND: feed (from the NOT) to the first input and to the second. . Two D gates.
- OR: feed to the first input and to the second. . Two D gates.
- NOR: invert the OR output with one more D gate: . Three D gates. AND: invert the NAND output: . Three D gates.
- 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.
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.
2 x 1 MUX with I0 grounded, I1 = P and select = Q: which function does it realise?
- (A)
- (B)
- (C)
- (D)
Answer: (A) Official key: A
- A 2:1 MUX gives .
- Here (ground), and .
- : 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.
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.
4-bit priority encoder, D3 highest, AB = 00, 01, 10, 11: what is the expression for B?
- (A)
- (B)
- (C)
- (D)
Answer: (B) Official key: B
- for the codes and . These are the cases where the winner is or .
- wins when and (whatever and are): term .
- 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.
- : 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 .
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.
2x1 MUX with 10 ns delay, input 0 tied to Y and input 1 to NOT Y: what is Y when S = 1?
- (A)a square wave of frequency 100 MHz
- (B)a square wave of frequency 50 MHz
- (C)constant at 0
- (D)constant at 1
Answer: (B) Official key: B
- With the MUX passes input , which is the inverter output. The inverter input is the node tied to , so input .
- So follows after the MUX delay: . There is no stable value, because is impossible.
- flips every , so one full cycle (low, then high) takes .
- , 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).
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.
Full adder plus XOR on Y and Z, Z tied to carry-in: what does it do when Z = 1?
If the input is set to logic '1', then the circuit functions as ________ with and as inputs.
- (A)an adder
- (B)a subtractor
- (C)a multiplier
- (D)a binary to Gray code converter
Answer: (B) Official key: B
- With the XOR gives . The full adder receives , and carry-in .
- It computes . That is the two's-complement way to subtract: (plus the carry flag).
- Check with the sum bit and carry-out. Sum , the difference bit. Carry-out when , so it is the inverse of the borrow.
- 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.
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.
CMOS gate with two series PMOS and two parallel NMOS: which logic operation is realised?
- (A)NOR
- (B)OR
- (C)XOR
- (D)AND
Answer: (A) Official key: A
- 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 .
- 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 .
- 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.
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.
4:1 MUX with data inputs 1, 0, 1, y and selects x, z: what is f(x, y, z)?
- (A)
- (B)
- (C)
- (D)
Answer: (C) Official key: C
- Read the figure: , (the 0 wire hops over the vertical wire, it does not join it), (a branch of the 1 wire), . Selects: , .
- The multiplexer passes : , , , .
- (since by the absorption law).
- : 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.
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.