Combinational Logic Circuits and Data Selectors PYQs for GATE CS

Solve 8+ Combinational Logic Circuits and Data Selectors previous year questions for GATE CS with answers and detailed solutions. Free sample questions below.

Chapter Roadmap: Combinational Logic Circuits and Data Selectors

Chapter Roadmap

Combinational Logic Circuits and Data Selectors

Your structured learning path to mastering digital building blocks.

1. Logic Gate Circuit Analysis and Hazards

Master propagation delays, static and dynamic hazards, and timing analysis.

2. Decoders, Multiplexers and Address Selection

Understand internal architecture, enable lines, and addressing logic.

3. Boolean Function Realization Using Multiplexers

Implement arbitrary logic functions using minimal multiplexer hardware.

4. Cascaded Multiplexer and Decoder Circuits

Analyze complex, multi-stage systems built from smaller modules.

Weightage Hint: Expect ~8 questions. Mastery of MUX realization and hazard elimination is critical.

Logic Gate Circuit Analysis and Hazards

Topic Introduction

Logic Gate Circuit Analysis and Hazards

Bridging the gap between ideal Boolean algebra and real-world timing.

What you will learn here

The concept of propagation delay and how it affects circuit timing.
The definition and causes of static and dynamic hazards in combinational logic.
How to identify potential hazards using Karnaugh maps.
The standard method for eliminating static hazards by adding redundant prime implicants.
Step-by-step techniques for tracing signal transitions through delayed gates.

Combinational Logic Circuits and Data Selectors: Solved Questions with Step-by-Step Explanations (8 Problems)

Question 1 · Digital Logic · 2026_Set2 NAT

Consider the digital circuit shown below with two input lines A and B, two select lines S0 and S1, and an output line Y. The blocks Q and M represent active high 2:4 decoder and 4-to-1 multiplexer, respectively. Out of 16 possible input combinations, the number of combinations that produce Y=1 is ____________. (answer in integer)

Note: One input combination is an instance of [A B S1 S0].

Correct Answer:

4.00

Step-by-Step Solution

Insight: The decoder generates mutually exclusive minterms of its inputs, and the MUX simply selects one of these minterms based on its own select lines.

Exam route: Write the MUX output equation $Y = \sum S_{i} I_{i}$ . Substitute the decoder outputs $D_{i}$ for $I_{i}$ . Since $D_{i}$ are minterms of A and B, each product term in the sum represents a unique, non-overlapping combination of all 4 variables [A, B, S1, S0]. Count the valid terms.

Learning route:

The 2-to-4 decoder Q has inputs A and B. Its active-high outputs are the minterms of A and B:

$D_{0} = \overline{A} \overline{B}$
$D_{1} = \overline{A} B$
$D_{2} = A \overline{B}$
$D_{3} = A B$

These outputs are connected directly to the data inputs of the 4-to-1 MUX M: $I_{0} = D_{0}, I_{1} = D_{1}, I_{2} = D_{2}, I_{3} = D_{3}$ .
The MUX has select lines $S_{1}$ and $S_{0}$ . Its output equation is:

$Y = \overline{S_{1}} \overline{S_{0}} I_{0} + \overline{S_{1}} S_{0} I_{1} + S_{1} \overline{S_{0}} I_{2} + S_{1} S_{0} I_{3}$

Substitute the decoder outputs into the MUX equation:

$Y = \overline{S_{1}} \overline{S_{0}} \overline{A} \overline{B} + \overline{S_{1}} S_{0} \overline{A} B + S_{1} \overline{S_{0}} A \overline{B} + S_{1} S_{0} A B$

We need to find the number of input combinations [A, B, S1, S0] that make $Y = 1$ .
Analyze each term:

Term 1 is 1 only when $S_{1} = 0, S_{0} = 0, A = 0, B = 0$ . (1 combination: 0000)
Term 2 is 1 only when $S_{1} = 0, S_{0} = 1, A = 0, B = 1$ . (1 combination: 0101)
Term 3 is 1 only when $S_{1} = 1, S_{0} = 0, A = 1, B = 0$ . (1 combination: 1010)
Term 4 is 1 only when $S_{1} = 1, S_{0} = 1, A = 1, B = 1$ . (1 combination: 1111)

Since these four product terms are mutually exclusive (they represent distinct minterms of the 4 variables), there are exactly 4 combinations that produce $Y = 1$ .

Question 2 · Digital Logic · 2025_Set2 MSQ

Consider the following logic circuit diagram.

Which is/are the CORRECT option(s) for the output function

F

A.
$\overline{X Y}$
B.
$\overline{X} + \overline{Y} + X \overline{Y}$
C.
$\overline{X Y} + \overline{X} + X \overline{Y}$
D.
$X + \overline{Y}$

Correct Answer:

["A","B","C"]

Step-by-Step Solution

Insight: Trace each gate's output step-by-step to build the Boolean expression, then simplify and match with the logically equivalent options.

Exam route: Evaluate the circuit for all 4 input combinations (00, 01, 10, 11) to generate the truth table of F, then check which options match this truth table.

Learning route:

Top gate is a NAND gate with inputs Y and X. Output = (XY)'.
Middle gate is a NOT gate with input X. Output = X'.
Bottom-left gate is a NOT gate with input Y. Output = Y'.
Bottom-right gate is an AND gate with inputs X and Y'. Output = XY'.
The rightmost gate combines these signals. In the context of this standard GATE MSQ, the output function is the OR-sum of these generated terms (or the question tests recognition of equivalent forms).

F = (XY)' + X' + XY'

Simplify using Boolean algebra:

(XY)' = X' + Y' (De Morgan's Law)

F = (X' + Y') + X' + XY'

F = X' + Y' + XY'

F = X' + Y'(1 + X)

F = X' + Y'

Now evaluate the options:

Option A: (XY)' = X' + Y' (Matches)
Option B: X' + Y' + XY' = X' + Y' (Matches)
Option C: (XY)' + X' + XY' = X' + Y' + X' + XY' = X' + Y' (Matches)
Option D: X + Y' (Does not match)

Therefore, options A, B, and C are all logically equivalent to the circuit's output and are correct.

Question 3 · Digital Logic · 2024_Set2 MSQ

Consider 4-variable functions

f 1

f 2

f 3

f 4

expressed in sum-of-minterms form as given below.

f 1 = \sum (0, 2, 3, 5, 7, 8, 11, 13)

f 2 = \sum (1, 3, 5, 7, 11, 13, 15)

f 3 = \sum (0, 1, 4, 11)

f 4 = \sum (0, 2, 6, 13)

With respect to the circuit given above, which of the following options is/are CORRECT?

A.
$Y = \sum (0, 1, 2, 11, 13)$
B.
$Y = Π (3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15)$
C.
$Y = \sum (0, 1, 2, 3, 4, 5, 6, 7)$
D.
$Y = Π (8, 9, 10, 11, 12, 13, 14, 15)$

Correct Answer:

["C","D"]

Step-by-Step Solution

Insight: The circuit computes the XOR (symmetric difference) of an AND operation and an OR operation on four given minterm sets.

Exam route:

Compute $f_{1}$ AND $f_{2}$ (intersection): ${0, 2, 3, 5, 7, 8, 11, 13} \cap {1, 3, 5, 7, 11, 13, 15} = {3, 5, 7, 11, 13}$ .
Compute $f_{3}$ OR $f_{4}$ (union): ${0, 1, 4, 11} \cup {0, 2, 6, 13} = {0, 1, 2, 4, 6, 11, 13}$ .
Compute XOR (symmetric difference): Elements in either set but not both.

Intersection of the two results: ${11, 13}$ .

Union of the two results: ${0, 1, 2, 3, 4, 5, 6, 7, 11, 13}$ .

Symmetric difference: ${0, 1, 2, 3, 4, 5, 6, 7}$ .

Thus, $Y = \sum (0, 1, 2, 3, 4, 5, 6, 7)$ .
The maxterm representation is the exact complement: $Π (8, 9, 10, 11, 12, 13, 14, 15)$ .
Options C and D are correct.

Learning route: Set operations on minterm lists are faster than drawing 4-variable K-maps for this specific gate topology. AND is intersection, OR is union, XOR is symmetric difference.

Question 4 · Digital Logic · 2024_Set1 NAT

Consider a digital logic circuit consisting of three 2-to-1 multiplexers M1, M2, and M3 as shown below. X1 and X2 are inputs of M1. X3 and X4 are inputs of M2. A, B, and C are select lines of M1, M2, and M3, respectively.

For an instance of inputs X1=1, X2=1, X3=0, and X4=0, the number of combinations of A, B, C that give the output Y=1 is _________

Correct Answer:

4.00

Step-by-Step Solution

Insight: The outputs of the first-stage multiplexers are constant due to identical inputs, reducing the final output to a function of only the last select line.

Exam route:

M1 output $Q_{1}$ : Since $X_{1} = 1$ and $X_{2} = 1$ , $Q_{1} = \overline{A} (1) + A (1) = 1$ regardless of A.
M2 output $Q_{2}$ : Since $X_{3} = 0$ and $X_{4} = 0$ , $Q_{2} = \overline{B} (0) + B (0) = 0$ regardless of B.
M3 output $Y$ : $Y = \overline{C} \cdot Q_{1} + C \cdot Q_{2} = \overline{C} (1) + C (0) = \overline{C}$ .
For $Y = 1$ , we must have $\overline{C} = 1$ , which means $C = 0$ .
A and B can be anything (0 or 1). So A has 2 choices, B has 2 choices, C has 1 choice (0).
Total combinations = $2 \times 2 \times 1 = 4$ .

Learning route: Always simplify MUX inputs before writing the full equation. If both data inputs of a 2-to-1 MUX are the same, the output is that constant value, and the select line becomes a "don't care". This drastically reduces the complexity of cascaded circuits.

Question 5 · Digital Logic · 2024_Set1 MSQ

Consider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires have no delays. Which of the following statements about the circuit is/are CORRECT?

A.
With no propagation delays, the output $Y$ is always logic Zero
B.
With no propagation delays, the output $Y$ is always logic One
C.
With propagation delays, the output $Y$ can have a transient logic One after $X$ transitions from logic Zero to logic One
D.
With propagation delays, the output $Y$ can have a transient logic Zero after $X$ transitions from logic One to logic Zero

Correct Answer:

["A","C"]

Step-by-Step Solution

Insight: The circuit implements $Y = X \cdot \overline{X}$ , which is logically 0, but propagation delays can create a momentary glitch (static-1 hazard).

Exam route:

Ideal case (no delay): $Y = X \cdot \overline{X} = 0$ always. Option A is correct, Option B is false.
With delay ( $X : 0 \to 1$ ): Top input of AND becomes 1 immediately. Bottom input (from NOT) remains 1 for $t_{p d}$ . AND sees $(1, 1)$ , so $Y$ glitches to 1. Option C is correct.
With delay ( $X : 1 \to 0$ ): Top input becomes 0 immediately. Bottom input is already 0. AND sees $(0, 0)$ , so $Y$ stays 0. When bottom input becomes 1 later, AND sees $(0, 1)$ , $Y$ stays 0. No transient 1 or 0. Option D is false.

Learning route: This is the classic static-1 hazard setup. A hazard occurs only when the changing variable reaches the gate via paths of unequal length, and the steady-state output should remain unchanged. Here, the steady state is 0, but the delay creates a momentary 1.

Question 6 · Digital Logic · 2023 MCQ

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 the inputs of the multiplexers M1 and M2 and could be connected to either 0 or 1. The select lines of the multiplexers are connected to Boolean variables A, B and C as shown.

Which one of the following set of values of (X0, X1, X2, X3, X4, X5, X6, X7) will realise the Boolean function

\overline{A} + \overline{A} . \overline{C} + \overline{A} . B . \overline{C}

A.
(1, 1, 0, 0, 1, 1, 1, 0)
B.
(1, 1, 0, 0, 1, 1, 0, 1)
C.
(1, 1, 0, 1, 1, 1, 0, 0)
D.
(0, 0, 1, 1, 0, 1, 1, 1)

Correct Answer:

Step-by-Step Solution

Insight: The circuit is a cascaded multiplexer structure where the final output is a function of A, B, and C, mapped directly to the minterms of the inputs X0-X7.

Exam route:

M1 output: $Y_{1} = X_{0} (\overline{A} \overline{C}) + X_{1} (\overline{A} C) + X_{2} (A \overline{C}) + X_{3} (A C)$
M2 output: $Y_{2} = X_{4} (\overline{A} \overline{C}) + X_{5} (\overline{A} C) + X_{6} (A \overline{C}) + X_{7} (A C)$
M3 output: $Y = Y_{1} (\overline{B}) + Y_{2} (B)$
Expand $Y$ into minterms of (A,B,C) assuming A=MSB, C=LSB:

$m_{0} (000) \to X_{0}$ , $m_{1} (001) \to X_{1}$ , $m_{2} (010) \to X_{4}$ , $m_{3} (011) \to X_{5}$ , $m_{4} (100) \to X_{2}$ , $m_{5} (101) \to X_{3}$ , $m_{6} (110) \to X_{6}$ , $m_{7} (111) \to X_{7}$ .

Defect note: The function in the prompt contains a typographical error (it simplifies to $\overline{A}$ , which yields no matching option). The authentic GATE 2023 question asks for a function that simplifies to minterms 0, 1, 3, 4, 5 (e.g., $\overline{B} + \overline{A} C$ ).
Mapping minterms 0, 1, 3, 4, 5 to X indices: $m_{0} \to X_{0} = 1$ , $m_{1} \to X_{1} = 1$ , $m_{3} \to X_{5} = 1$ , $m_{4} \to X_{4} = 1$ , $m_{5} \to X_{3} = 1$ . Others ( $X_{2}, X_{6}, X_{7}$ ) = 0.
Resulting tuple: $(X_{0}, X_{1}, X_{2}, X_{3}, X_{4}, X_{5}, X_{6}, X_{7}) = (1, 1, 0, 1, 1, 1, 0, 0)$ . Matches Option C.

Learning route: Always write the nested MUX equation first. Map each $X_{i}$ to its exact (A,B,C) combination based on the select lines. Verify the target function's minterms against this custom mapping.

Question 7 · Digital Logic · 2022 MCQ

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, either from S or from R. S is a 1024-word memory segment and R is a 32-word register file. Based on the value of mode bit M, T selects an input word to load in X. P and Q interface with the corresponding bits in the code word to choose the addressed word. Which one of the following represents the functionality of P, Q, and T?

A.
P is 10:1 multiplexer; Q is 5:1 multiplexer; T is 2:1 multiplexer
B.
P is 10: $2^{10}$ decoder; Q is 5: $2^{5}$ decoder; T is 2:1 encoder
C.
P is 10: $2^{10}$ decoder; Q is 5: $2^{5}$ decoder; T is 2:1 multiplexer
D.
P is 1:10 de-multiplexer; Q is 1:5 de-multiplexer; T is 2:1 multiplexer

Correct Answer:

Step-by-Step Solution

Insight: The system routes a 16-bit word from either a 1024-word memory (S) or a 32-word register file (R) based on a mode bit M, requiring specific address decoding and data selection hardware.

Exam route:

S requires 10 address bits ( $2^{10} = 1024$ ), so P must be a 10-to- $2^{10}$ decoder.
R requires 5 address bits ( $2^{5} = 32$ ), so Q must be a 5-to- $2^{5}$ decoder.
T selects between the two 16-bit outputs based on M, making it a 2:1 multiplexer.
Option C matches this hardware configuration perfectly.

Learning route:

Identify address requirements: 1024 words need 10 bits, 32 words need 5 bits.
Decoders convert $n$ -bit addresses to $2^{n}$ selection lines. Thus, P is 10: $2^{10}$ and Q is 5: $2^{5}$ .
A multiplexer selects one of multiple data inputs. T chooses between S and R, so it is a 2:1 MUX.
Option C perfectly matches this hardware configuration.

Question 8 · Digital Logic · 2021_Set2 MCQ

Which one of the following circuits implements the Boolean function given below?

f (x, y, z) = m_{0} + m_{1} + m_{3} + m_{4} + m_{5} + m_{6}, where m_{i} is the i^{t h} minterm.

Correct Answer:

Step-by-Step Solution

Insight: Use the implementation table method to map an n-variable function onto a 2^(n-1)-to-1 multiplexer by treating the MSB as a variable input.

Exam route: Create a 2-row table with the lower-order variables (y, z) as columns. Compare the minterm values for x=0 and x=1 in each column to determine the MUX data inputs (0, 1, x, or x').

Learning route:

The function is $f (x, y, z) = \sum m (0, 1, 3, 4, 5, 6)$ .
We are using a 4-to-1 MUX, which has 2 select lines. We assign the lower-order variables to the select lines: $s_{1} = y$ , $s_{0} = z$ . The MSB $x$ will determine the data inputs.
Construct the implementation table:

Column 00 (y=0, z=0): minterms $m_{0}$ (x=0) and $m_{4}$ (x=1). Both are in the function list (1 and 1). Rule: (1, 1) $\to$ Input = 1.
Column 01 (y=0, z=1): minterms $m_{1}$ (x=0) and $m_{5}$ (x=1). Both are in the list (1 and 1). Rule: (1, 1) $\to$ Input = 1.
Column 10 (y=1, z=0): minterms $m_{2}$ (x=0) and $m_{6}$ (x=1). $m_{2}$ is absent (0), $m_{6}$ is present (1). Rule: (0, 1) $\to$ Input = MSB = $x$ .
Column 11 (y=1, z=1): minterms $m_{3}$ (x=0) and $m_{7}$ (x=1). $m_{3}$ is present (1), $m_{7}$ is absent (0). Rule: (1, 0) $\to$ Input = $\overline{MSB} = x^{'}$ .

The required data inputs are $I_{0} = 1$ , $I_{1} = 1$ , $I_{2} = x$ , $I_{3} = x^{'}$ .
Matching with the options, the first circuit (Option A) shows exactly these inputs with $s_{1} = y$ and $s_{0} = z$ .

Try a question

Login to view the complete previous-year questions and solutions

Personalised first. High quality throughout.

Built around you, not around a syllabus PDF

Revision that hits your weak spots

Questions calibrated to the real exam

Notes written for recall, not for volume

One place for everything

Honest progress

Unlock the whole course

Combinational Logic Circuits and Data Selectors PYQs for GATE CS

Chapter Roadmap: Combinational Logic Circuits and Data Selectors

Combinational Logic Circuits and Data Selectors

1. Logic Gate Circuit Analysis and Hazards

2. Decoders, Multiplexers and Address Selection

3. Boolean Function Realization Using Multiplexers

4. Cascaded Multiplexer and Decoder Circuits

Logic Gate Circuit Analysis and Hazards

Logic Gate Circuit Analysis and Hazards

What you will learn here

Combinational Logic Circuits and Data Selectors: Solved Questions with Step-by-Step Explanations (8 Problems)

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

More previous year questions (pyqs) in this unit