Boolean Algebra
Practice Questions
Marks 1
1

The following two signed 2's complement numbers (multiplicand M and multiplier Q ) are being multiplied using Booth's algorithm :

M : 1100110111101101 and Q : 1010010010101010

The total number of addition and subtraction operations to be performed is ________ (Answer in integer)

GATE CSE 2025 Set 2
2

Let $X$ be a 3-variable Boolean function that produces output as ' 1 ' when at least two of the input variables are ' 1 '. Which of the following statement(s) is/are CORRECT, where $a, b, c, d, e$ are Boolean variables?

GATE CSE 2025 Set 1
3

For a Boolean variable x, which of the following statements is/are FALSE?

GATE CSE 2024 Set 2
4
Which one of the following is NOT a valid identity?
GATE CSE 2019
5
Let, $${x_1} \oplus {x_2} \oplus {x_3} \oplus {x_4} = 0$$ where $${x_1},\,{x_2},\,{x_3},\,{x_4}$$ are Boolean Variables, and $$ \oplus $$ is the $$XOR$$ operator.

Which one of the following must always be TRUE?

GATE CSE 2016 Set 2
6
Consider the Boolean operator $$ \ne $$ with the following properties:
$$x \ne 0 = x,\,\,x \ne 1 = \overline x ,\,\,x \ne x = 0$$ and $$x \ne \overline x = 1.$$ Then $$x \ne y$$ is equivalent to
GATE CSE 2016 Set 1
7
Let $$ \ne $$ be a binary operator defined as $$X \ne Y = X' + Y'$$ where $$𝑋$$ and $$𝑌$$ are Boolean variables. Consider the following two statements. $$$\eqalign{ & \left( {S1} \right)\,\,\,\,\,\,\,\left( {P \ne Q} \right) \ne R = P \ne \left( {Q \ne R} \right) \cr & \left( {S2} \right)\,\,\,\,\,\,\,Q \ne R = R \ne Q \cr} $$$

Which of the following is/are true for the Boolean variables $$𝑃, 𝑄$$ and $$𝑅$$?

GATE CSE 2015 Set 3
8
Consider the following combinational function block involving four Boolean variables $$x, y, a,$$
$$b$$ where $$x, a, b$$ are inputs and $$y$$ is the output. GATE CSE 2014 Set 3 Digital Logic - Boolean Algebra Question 44 English
Which one of the following digital logic blocks is the most suitable for implementing this function?
GATE CSE 2014 Set 3
9
The dual of a Boolean function $$F\left( {{x_1},{x_2},\,....,\,{x_n},\, + , \cdot ,'} \right),$$ written as $${F^D}$$, is the same expression as that of $$F$$ with $$+$$ and $$ \cdot $$ swapped. $$F$$ is said to be self-dual if $$F = {F^D} \cdot $$. The number of self-dual functions with $$n$$ Boolean variables is
GATE CSE 2014 Set 2
10
Consider the following Boolean expression for $$F:$$
$$F\left( {P,\,Q,\,R,\,S} \right) = PQ + \overline P QR + \overline P Q\overline R S.$$
The minimal sum-of-products form of $$F$$ is
GATE CSE 2014 Set 1
11
Which one of the following expressions does NOT represent exclusive NOR of $$x$$ and $$y?$$
GATE CSE 2013
12
Which one of the following circuits is NOT equivalent to a $$2$$-input $$XNOR$$ (exclusive NOR) gate
GATE CSE 2011
13
The simplified $$SOP$$ (Sum of product) form of the Boolean expression
$$\left( {P + \overline Q + \overline R } \right).\left( {P + \overline Q + R} \right).\left( {P + Q + \overline R } \right)$$ is
GATE CSE 2011
14
The minters expansion of $$f\left( {P,Q,R} \right) = PQ + Q\overline R + P\overline R $$ is
GATE CSE 2010
15
What is the minimum number of gates required to implement the Boolean function $$(AB+C)$$ if we have to use only $$2$$-input NOR gates?
GATE CSE 2009
16
Given $${f_1},$$ $${f_3},$$ and $$f$$ in canonical sum of products form (in decimal) for the circuit. $$${f_1} = \sum {m\left( {4,5,6,7,8} \right)} $$$ $$${f_3} = \sum {m\left( {1,6,15} \right)} $$$ $$$f = \sum {m\left( {1,6,8,15} \right)} $$$
Then $${f_2}$$ is GATE CSE 2008 Digital Logic - Boolean Algebra Question 52 English
GATE CSE 2008
17
Consider the following Boolean function with four variables
$$F\left( {w,\,x,\,y,\,z} \right) = \sum {\left( {1,\,3,\,4,\,6,\,9,\,11,\,12,\,14} \right)} $$ the function is
GATE CSE 2007
18
The Boolean function $$x'y' +xy +x'y$$ is equivalent to
GATE CSE 2004
19
Let $$^ * $$ be defined as $${x^ * }y = \overline x + y,$$ Let $$z = {x^ * }y.$$ Value of $${z^ * }x$$ is
GATE CSE 1997
Marks 2
1

Which of the following Boolean algebraic equation(s) is/are CORRECT?

GATE CSE 2025 Set 2
2

Consider 4-variable functions $f1, f2, f3, f4$ expressed in sum-of-minterms form as given below.

$f1 = \sum(0,2,3,5,7,8,11,13)$

$f2 = \sum(1,3,5,7,11,13,15)$

$f3 = \sum(0,1,4,11)$

$f4 = \sum(0,2,6,13)$

GATE CSE 2024 Set 2 Digital Logic - Boolean Algebra Question 4 English

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

GATE CSE 2024 Set 2
3

Consider a Boolean expression given by $F(X, Y, Z) = \Sigma(3,5,6,7)$.

Which of the following statements is/are CORRECT?

GATE CSE 2024 Set 1
4

Consider a Boolean function f(w, x, y, z) such that 

f(w, 0, 0, z) = 1

f(1, x, 1, z) = x + z

f(w, 1, y, z) = wz + y

The number of literals in the minimal sum-of-products expression of f is ______

GATE CSE 2021 Set 2
5

Consider the following Boolean expression.

$$F = (X + Y + Z)(\overline X + Y)(\overline Y + Z)$$

Which of the following Boolean expressions is/are equivalent to $$\overline F$$ (complement of F)?

GATE CSE 2021 Set 1
6
Consider the Boolean function z(a,b,c). GATE CSE 2020 Digital Logic - Boolean Algebra Question 9 English
Which one of the following minterm lists represents the circuit given above?
GATE CSE 2020
7
Consider three 4-variable functions f1, f2 and f3, which are expressed in sum-of-minterms as

f1 = Σ(0, 2, 5, 8, 14),

f2 = Σ(2, 3, 6, 8, 14, 15),

f3 = Σ(2, 7, 11, 14)

For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as : GATE CSE 2019 Digital Logic - Boolean Algebra Question 10 English
GATE CSE 2019
8
Let $$ \oplus $$ and $$ \odot $$ denote the Exclusive OR and Exclusive NOR operations, respectively.

Which one of the following is NOT CORRECT?

GATE CSE 2018
9
Consider a carry lookahead adder for adding two $$n$$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
GATE CSE 2016 Set 1
10
The total number of prime implicants of the function
$$f\left( {w,x,y,z} \right) = \sum {\left( {0,2,4,5,6,10} \right)} $$ _________________.
GATE CSE 2015 Set 3
11
Given the function $$F = P′ + QR,$$ where $$F$$ is a function in three Boolean variables $$P,Q$$ and $$R$$ and $$P'=!P,$$ consider the following statements.

$$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S1} \right)\,\,\,\,F = \sum {\left( {4,5,6} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S2} \right)\,\,\,\,F = \sum {\left( {0,1,2,3,7} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S3} \right)\,\,\,\,F = \sum {\Pi \left( {4,5,6} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S4} \right)\,\,\,\,F = \sum {\Pi \left( {0,1,2,3,7} \right)} \cr} $$

Which of the following is true?

GATE CSE 2015 Set 3
12
A half adder is implemented with $$XOR$$ and $$AND$$ gates. A full adder is implemented with two half adders and one $$OR$$ gate. The propagation delay of an $$XOR$$ gate is twice that of an $$AND/OR$$ gate. The propagation delay of an $$AND/OR$$ gate is $$1.2$$ microseconds. A $$4$$-bit ripple-carry binary adder is implemented by using four full adders. The total propagation time of this $$4$$-bit binary adder in microseconds is____________ .
GATE CSE 2015 Set 2
13
The number of min-terms after minimizing the following Boolean expression is _______________ . $$$\left[ {D' + AB' + A'C + AC'D + A'C'D} \right]'$$$
GATE CSE 2015 Set 2
14

Consider the operations

$$f\left( {x,y,z} \right) = X'YZ + XY' + Y'Z'$$ and
$$g\left( {x,y,z} \right) = X'YZ + X'YZ' + XY$$.

Which one of the following is correct?

GATE CSE 2015 Set 1
15

The binary operator $$ \ne $$ is defined by the following truth table.

p q p$$ \ne $$q
0 0 0
0 1 1
1 0 1
1 1 0

Which one of the following is true about the binary operator $$ \ne $$?

GATE CSE 2015 Set 1
16
Let $$ \oplus $$ denote the exclusive $$OR\left( {XOR} \right)$$ operation. Let $$'1'$$ and $$'0'$$ denote the binary constants. Consider the following Boolean expression for $$F$$ over two variables $$P$$ and $$Q$$:
$$F\left( {P,Q} \right) = \left( {1 \oplus P} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {Q \oplus 0} \right)$$

The equivalent expression for $$F$$ is

GATE CSE 2014 Set 3
17
What is the Boolean expression for the output f of the combinational logic circuit of NOR gates given below? GATE CSE 2010 Digital Logic - Boolean Algebra Question 32 English
GATE CSE 2010
18
If $$P, Q, R$$ are Boolean variables, then $$\left( {P + \overline Q } \right)$$ $$\left( {P.\overline Q + P.R} \right)\left( {\overline P .\overline R + \overline Q } \right)$$ Simplifies to
GATE CSE 2008
19
Let $$f\left( {w,x,y,z} \right) = \sum {\left( {0,4,5,7,8,9,13,15} \right).} $$ Which of the following expressions are NOT equivalent to $$f?$$
$$(P)\,\,\,$$ $$x'y'z' + w'xy' + wy'z + xz$$
$$(Q)\,\,\,$$ $$w'y'z' + wx'y' + xz$$
$$(R)\,\,\,$$ $$w'y'z' + wx'y' + xyz + xy'z$$
$$(S)\,\,\,$$ $$x'y'z' + wx'y' + w'y$$
GATE CSE 2007
20
Consider a Boolean function $$f(w, x, y, z).$$ Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $${i_1} = < {w_1},{x_1},{y_1},{z_1} > $$ and $${i_2} = < {w_2},{x_2},{y_2},{z_2} > ,$$ we would like the function to remain true as the input changes from $${i_1}$$ to $${i_2}$$ ($${i_1}$$ and $${i_2}$$ differ in exactly one bit position), without becoming false momentarily. Let $$f\left( {w,x,y,z} \right) = \sum {\left( {5,7,11,12,13,15} \right)} .$$ Which of the following cube covers of $$f$$ will entire that the required property is satisfied?
GATE CSE 2006
21
Which are the essential prime implicants of the following Boolean function? $$F\left( {a,b,c} \right) = {a^1}c + a{c^1} + {b^1}c$$
GATE CSE 2004
22
$$f\left( {A,B} \right) = A' + B$$ Simplified expression for function $$f((x+y,y),z)$$ is
GATE CSE 2002
23
Transform the following logic circuit (without expressing its switching function) into an equivalent logic circuit that employs only $$6$$ $$NAND$$ gates each with $$2$$-inputs. GATE CSE 2002 Digital Logic - Boolean Algebra Question 39 English
GATE CSE 2002
24
Consider the following logic circuit whose inputs are functions $${f_1},$$ $${f_2},$$ $${f_3},$$ and output is $$f.$$ GATE CSE 2002 Digital Logic - Boolean Algebra Question 38 English
GATE CSE 2002
25
The simultaneous equations on the Boolean variables $$x, y, z$$ and $$w,$$ $$$x+y+z=1$$$ $$$xy=0$$$ $$$xz+w=1$$$ $$$xy + \overline z \overline w = 0$$$
have the following for $$x, y, z$$ and $$w,$$ respectively.
GATE CSE 2000
26
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?
GATE CSE 1999
27
Consider the logic circuit shown in Figure below. The functions $${f_1},$$ $${f_2}$$ and $$f$$ (in canonical sum of products form in decimal notation) are: GATE CSE 1997 Digital Logic - Boolean Algebra Question 42 English

$${f_1}\left( {w,\,x,\,y,\,z} \right) = \sum {8,9,10} $$
$${f_2}\left( {w,\,x,\,y,\,z} \right) = \sum {7,8,12,13,18,15} $$
$$f\left( {w,\,x,\,y,\,z} \right) = \sum {\left( {8,9} \right)} $$

The function $${f_3}$$ is

GATE CSE 1997
28
Let $$f\left( {x,y,z} \right) = \overline x + \overline y x + xz$$ be a switching function. Which one of the following is valid?
GATE CSE 1997
29
Two $$NAND$$ gates having open collector outputs are tied together as shown in fig. The logic function $$Y,$$ implemented by the circuit is. GATE CSE 1990 Digital Logic - Boolean Algebra Question 24 English
GATE CSE 1990
Marks 5
1
A circuit outputs a digit in the form of $$4$$ bits. $$0$$ is represented by $$0000$$, $$1$$ by $$0001..., $$ $$9$$ by $$1001.$$ A combinational circuit is to be designed which takes these $$4$$ bits as input and outputs $$1$$ if the digit $$ \ge 5,$$ and $$0$$ otherwise. If only $$AND,$$ $$OR$$ and $$NOT$$ gates may be used, what is the minimum number of gates required?
GATE CSE 2004
2
Consider the following circuit composed of $$XOR$$ gates are non-inverting buffers. GATE CSE 2003 Digital Logic - Boolean Algebra Question 23 English 1

The non-inverting buffers have delays $${\delta _1} = 2$$ $$ns$$ and $${\delta _2} = 4$$ $$ns$$ as shown in the figure. Both $$XOR$$ gates and all wires have zero delay. Assume that all gate inputs, outputs and wires are stable at logic level $$0$$ at time$$0.$$ If the following waveform is applied at input $$A$$, how many transition(s) (change of logic levels) occurs(s) at $$B$$ during the interval from $$0$$ to $$10$$ $$ns?$$

GATE CSE 2003 Digital Logic - Boolean Algebra Question 23 English 2
GATE CSE 2003
3
Express the function $$f( x, y, z)= xy'+ yz'$$ with only one complement operation and one or more $$AND/OR$$ operations. Draw the logic circuit implementing the expression obtained, using a single NOT gate and one or more $$AND/OR$$ gates.
GATE CSE 2002
4
A logic network has two data inputs $$A$$ and $$B,$$ and two control inputs $${C_0}$$ and $${C_1}$$. It implements the function $$F$$ according to the following Table. GATE CSE 1996 Digital Logic - Boolean Algebra Question 27 English

Implement the circuit using one $$4$$ to $$1$$ Multiplexor, one $$2$$-input Exclusive $$OR$$ gate, one $$2$$-input $$AND$$ gate, one $$2$$-input $$OR$$ gate and one Inverter.

GATE CSE 1996
5
Find the minimum sum of products form of the logic function
$$f\left( {A,B,C,D} \right) = \sum d \left( {3,11,12,14} \right)$$
Where $$m$$ and $$d$$ denote the minterms and don't cares respectively.
GATE CSE 1991
6
Find the minimum product of sums of the following expression
$$f = ABC + \overline A \,\overline B \,\overline C .$$
GATE CSE 1990
7
Show with the help of a block diagram represent Boolean function:
$$f=AB+BC+CA$$ can be realized using only $$4:1$$ multiplexer.
GATE CSE 1990