Crack
GATE
C
G
Topic
Minimization
Digital Logic
0
/ 8 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
0.7
0
0
0.7
2018
0
0
0
0
2019
0
0
0
0
2020
0
0
0
0
2021
0.5
0
0
0.5
2022
0
0
0
0
2023
0
0
0
0
2024
0
0
0
0
2025
1
0.5
0.5
0
2026
1.5
1
0.5
0
1
CS 2026 Set 1 · 2 marks · MCQ · Moderate
Consider a 2-bit saturating up/down counter that performs the saturating up count when the input
P
P
P
is
0
0
0
, and the saturating down count when
P
P
P
is
1
1
1
. The Next State table of the counter is as shown. The counter is built as a synchronous sequential circuit using D flip-flops.
2
CS 2026 Set 1 · 2 marks · MSQ · Moderate
Consider a Boolean function
F
F
F
with the following minterm expression:
3
CS 2026 Set 2 · 2 marks · MCQ · Easy
Consider the following 4-variable Boolean function
4
CS 2025 Set 1 · 2 marks · MCQ · Moderate
Consider the following four variable Boolean function in sum-of-product form
5
CS 2025 Set 2 · 2 marks · MSQ · Easy
Given the following Karnaugh Map for a Boolean function
F
(
w
,
x
,
y
,
z
)
F(w,x,y,z)
F
(
w
,
x
,
y
,
z
)
:
6
CS 2021 Set 2 · 2 marks · NAT · Hard
Consider a Boolean function
f
(
w
,
x
,
y
,
z
)
f(w, x, y, z)
f
(
w
,
x
,
y
,
z
)
such that
7
CS 2015 Set 2 · 2 marks · NAT · Moderate
The number of min-terms after minimizing the following Boolean expression is ____.
8
CS 2015 Set 3 · 2 marks · NAT · Easy
The total number of prime implicants of the function
f
(
w
,
x
,
y
,
z
)
=
∑
(
0
,
2
,
4
,
5
,
6
,
10
)
f(w, x, y, z) = \sum(0, 2, 4, 5, 6, 10)
f
(
w
,
x
,
y
,
z
)
=
∑
(
0
,
2
,
4
,
5
,
6
,
10
)
is ____.