Time Left - 10:00 mins
GATE CS 2018 - Digital Logic Quiz-3 ( Boolean Algebra & Minimization-1)
Attempt now to get your rank among 596 students!
Question 1
The dual of a Boolean function 
written as FD, is the same expression as that of F with + and swapped. F is said to be self-dual if F = FD. The number of self-dual functions with n Boolean variables is
written as FD, is the same expression as that of F with + and swapped. F is said to be self-dual if F = FD. The number of self-dual functions with n Boolean variables is Question 2
Consider the operations
f(x,y, z) =x’yz + xy’ + y’z’ and g(x, y, z) x’yz + x’yz’ + xy.
Which one of the following is correct?
Question 3
The number of literals in simplified function F=(x+y)(x’+y)(x+y’)(x’+y’)
Question 4
Given two three bit numbers a2 a1 a0and b2 b1 b0and c, the carry in, the function that represents the carry generate function when these two numbers are added is:
Question 5
Consider the following Boolean expression for F:
F (P, Q, R, S) = PQ + P’QR + P’QR’S
The minimal sum-of-products form of F is:
F (P, Q, R, S) = PQ + P’QR + P’QR’S
The minimal sum-of-products form of F is:
- 596 attempts
- 4 upvotes
- 9 comments
Jul 5GATE & PSU CS
