The GATE Grind

GATE Digital Logic: Combinational Circuits – Previous Year Questions

20 GATE previous year questions on Combinational Circuits (Digital Logic, Computer Science) with answers and explanations, from every paper.

20 questions worth 31 marks in all (9 1-mark, 11 2-mark). Asked between 2007 and 2026, so you can see how the topic has been tested over time.

  1. GATE 2007 CS Q8 (1 mark, Multiple choice) – How many3-to-8 decoders with an enable input construct a6-to-64 decoder without other logic gates?
  2. GATE 2007 CS Q34 (2 marks, Multiple choice) – Only one multiplexer and one inverter may implement any n-variable Boolean function. What minimum multiplexer size is needed?
  3. GATE 2007 CS Q35 (2 marks, Multiple choice) – For carry lookahead, P i=A i B i, G i=A iB i, S i=P i C i, C i+1=G i+P iC i; C0 is input carry. Assume all Pi, Gi are available and unlimited-fan-in…
  4. GATE 2021 CS (CS2) Q15 (1 mark, Multiple choice) – Which 4-to-1 multiplexer implements f(x,y,z)=Σm(0,1,3,4,5,6), with select lines s1=y,s0=z?
  5. GATE 2015 CS (CS2) Q65 (2 marks, Numerical answer) – A half adder uses XOR and AND gates. A full adder uses two half adders and one OR gate. XOR delay is twice AND/OR delay; AND and OR each take 1.2 μs.…
  6. GATE 2010 CS Q19 (1 mark, Multiple choice) – The shown 4:1 multiplexer has select inputs P (MSB),Q (LSB). What is f?
  7. GATE 2013 CS Q15 (1 mark, Multiple choice) – Inputs D₀,D₁,D₂,D₃ and outputs X₀,X₁,V have rows: 0000→xx0; 1000→001; x100→011; xx10→101; xxx1→111. x is don’t-care, and V=1 iff input is valid. What…
  8. GATE 2013 CS Q56 (2 marks, Multiple choice) – A RAM chip stores 1024 eight-bit words. How many 2-to-4 decoders with enable are needed to build 16K×16 RAM from 1K×8 chips?
  9. GATE 2012 CS Q29 (1 mark, Multiple choice) – How much ROM implements a four-bit multiplier?
  10. GATE 2014 CS (CS3) Q18 (1 mark, Multiple choice) – A combinational block has Boolean inputs x,a,b and output y: f(x,y,a,b) if (x is 1) y = a; else y = b; Which digital block is most suitable?
  11. GATE 2014 CS (CS1) Q55 (2 marks, Multiple choice) – For the 4-to-1 multiplexer shown, with select lines S 1 and S 0, find the minimal sum-of-products form of output F.
  12. GATE 2016 CS (CS1) Q40 (2 marks, Multiple choice) – Consider the two cascaded 2-to-1 multiplexers as shown in the figure. The minimal sum of products form of the output X is
  13. GATE 2019 CS Q40 (2 marks, Multiple choice) – Consider three 4-variable functions f 1, f 2, and f 3, which are expressed in sum-of-minterms as f 1=(0,2,5,8,14), f 2=(2,3,6,8,14,15), f…
  14. GATE 2026 CS (CS2) Q59 (2 marks, Numerical answer) – Consider the digital circuit shown below with two input lines A and B, two select lines S 0 and S 1, and an output line Y. The blocks Q and M…
  15. GATE 2025 CS (CS2) Q31 (1 mark, Multiple select) – Consider the following logic circuit diagram. Which is/are the CORRECT option(s) for the output function F?
  16. GATE 2024 CS (CS1) Q28 (1 mark, Multiple select) – Consider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires…
  17. GATE 2024 CS (CS1) Q64 (2 marks, Numerical answer) – Consider three 2-to-1 multiplexers M1, M2, M3. X1 and X2 are inputs of M1, X3 and X4 are inputs of M2, and A, B, C are the select lines of M1, M2, M3…
  18. GATE 2023 CS Q44 (2 marks, Multiple choice) – A Boolean digital circuit is composed using two 4-input multiplexers (M1 and M2) and one 2-input multiplexer (M3) as shown in the figure. X0–X7 are…
  19. GATE 2022 CS Q40 (2 marks, Multiple choice) – Consider a digital display system (DDS) shown in the figure that displays the contents of register X. A 16-bit code word is used to load a word in X,…
  20. GATE 2020 CS Q29 (1 mark, Numerical answer) – A multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any given point in time the content…