Crack
GATE
C
G
Topic
Boolean Algebra
Digital Logic
0
/ 14 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
1
1
0
0
2018
0
0
0
0
2019
1
1
0
0
2020
1
1
0
0
2021
0.5
0
0.5
0
2022
0
0
0
0
2023
1
1
0
0
2024
1
0
1
0
2025
1.5
0
1.5
0
2026
1
0.5
0.5
0
1
CS 2026 Set 1 · 1 mark · MSQ · Moderate
Consider the following Boolean expression of a function
F
F
F
:
2
CS 2026 Set 2 · 1 mark · MCQ · Easy
Which one of the following options is
not
a property of Boolean Algebra?
3
CS 2025 Set 1 · 1 mark · MSQ · Hard
Let
X
X
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
a, b, c, d, e
a
,
b
,
c
,
d
,
e
are Boolean variables?
4
CS 2025 Set 2 · 1 mark · MSQ · Moderate
Consider the following logic circuit diagram.
5
CS 2025 Set 2 · 2 marks · MSQ · Moderate
Which of the following Boolean algebraic equation(s) is/are CORRECT?
6
CS 2024 Set 1 · 2 marks · MSQ · Easy
Consider a Boolean expression given by
F
(
X
,
Y
,
Z
)
=
Σ
(
3
,
5
,
6
,
7
)
F(X,Y,Z)=\Sigma(3,5,6,7)
F
(
X
,
Y
,
Z
)
=
Σ
(
3
,
5
,
6
,
7
)
.
7
CS 2024 Set 2 · 1 mark · MSQ · Easy
For a Boolean variable
x
x
x
, which of the following statements is/are FALSE?
8
CS 2023 · 2 marks · MCQ · Moderate
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 M1 and M2 are connected to Boolean variables A, B and C as shown.
9
CS 2021 Set 1 · 2 marks · MSQ · Moderate
Consider the following Boolean expression.
10
CS 2020 · 2 marks · MCQ · Hard
Consider the Boolean function
z
(
a
,
b
,
c
)
z(a, b, c)
z
(
a
,
b
,
c
)
.
11
CS 2019 · 1 mark · MCQ · Moderate
Which one of the following is NOT a valid identity?
12
CS 2015 Set 1 · 2 marks · MCQ · Moderate
Consider the operations
13
CS 2015 Set 3 · 1 mark · MCQ · Moderate
Let
#
\#
#
be a binary operator defined as
14
CS 2015 Set 3 · 2 marks · MCQ · Easy
Given the function
F
=
P
′
+
Q
R
F = P' + QR
F
=
P
′
+
QR
, where
F
F
F
is a function in three Boolean variables
P
,
Q
P, Q
P
,
Q
and
R
R
R
and
P
′
=
!
P
P' = !P
P
′
=
!
P
, consider the following statements.