Time Left - 10:00 mins
GATE 2020 : Digital Logic Quiz 5 (App update required to attempt this test)
Attempt now to get your rank among 451 students!
Question 1
The Boolean function Y= AB + CD is to realized using only 2-input NAND gates. The minimum number of gates required is .
Question 2
The maximum number of Boolean expression that can be formed for the function f(x,y,z) satisfying the relation f(
) = f(x,y,z) is
) = f(x,y,z) is Question 3
Consider the following Boolean expression represented in extended canonical form:
F (w, x, y, z) = ∑ (0, 2, 4, 5, 6, 13, 14, 15)
The number of prime implicants which are not essential prime implicants are_____________.
Question 4
What is the minimum possible literal count in the canonical S-O-P (SUM OF PRODUCTS) form for the following K-Map?
Note: Literal count of the boolean expression is the sum of the no of times literals appear in the expression. For example, in the expression (AB+A'B'C) the literal count is 5.
Note: Literal count of the boolean expression is the sum of the no of times literals appear in the expression. For example, in the expression (AB+A'B'C) the literal count is 5.
Question 5
Consider the following function:
F(x, y, z) = Σ(1, 2, 3, 4, 5, 7)
If the function F is implemented using NAND gates and inverter gates, then find minimum number of NAND gates needed to implement F.
F(x, y, z) = Σ(1, 2, 3, 4, 5, 7)
If the function F is implemented using NAND gates and inverter gates, then find minimum number of NAND gates needed to implement F.
Question 6
Minimum number of 2- input NOR Gates required to implement the function
- 451 attempts
- 7 upvotes
- 1 comment
Tags :
GATE & PSU CSGeneralFeb 17GATE & PSU CS
