Time Left - 12:00 mins
GATE CS 2019 - Digital Logic Quiz-2 ( Boolean Algebra & Minimization-1) (App update required to attempt this test)
Attempt now to get your rank among 499 students!
Question 1
The minimize form of the following Boolean expression using K-map is:
f(P, Q, R, S) =
f(P, Q, R, S) =
Question 2
A function with don’t care condition is as follows:
F(y, z,w, x,) =
.
The minimize Boolean expression is:
F(y, z,w, x,) =
. The minimize Boolean expression is:
Question 3
The minimized expression for the k-map given below is
Question 4
The Boolean Expression 
can be simplified to
can be simplified toQuestion 5
Identify the minimal product-of-sums function described by the K-map given in the figure. Where ϕ is don’t care
Question 6
Consider the following Boolean expression E.
How many literals are there in the minimized expression of E?
How many literals are there in the minimized expression of E?
- 499 attempts
- 2 upvotes
- 9 comments
Jun 25GATE & PSU CS
