Font size
WorksheetsDIGITAL ELECTRONICS REVISION
Total questions: 11
Worksheet time: 8mins
A function F(A, B, C) defined by three Boolean variables A, B and C when expressed as sum of products is given by
F=A'B'C'+A'BC'+AB'C'
The product of sums (POS) form of the function F is (GATE 2018)
(A+B+C)(A+B'+C)(A'+B+C)(A+B'+C')
(A+B+C')(A+B'+C')(A'+B'+C)+(A'+B'+C')
For an n - variable Boolean function maximum number of prime implicants is (GATE 2014)
(a)
The output of the combinational circuit given is (GATE 2016)
A+B+C
A(B+C)
B(C+A)
C(A+B)
In the figure shown, the output ܻ is required to be ܻ Y=AB+ C'D'.The gates G1 and G2 must be, respectively, (GATE 2015)
NOR,OR
OR,NAND
NAND,OR
AND,NAND
Following is the k-map of a Boolean function of five variable P, Q, R, S and X. The minimum for the function is
(GATE 2016)
P'Q'SX'+PQ'SX'+QR'S'X+QRS'X
Q'SX'+QS'X
Q'SX+QS'X'
Q'S+QS'
Decimal 43 in Hexadecimal and BCD number system is respectively (GATE 2015)
B2, 0100 0011
2B, 0100 0011
2B, 0001 1100
B2,0100 0100
The Boolean expression (X+Y) (X+Y')+(XY')'+(X')'simplifies to (GATE 2014)
X
Y
XY
X+Y
In the sum of products function f (x,y,z) = ∑m (2,3,4,5), the prime implicants are (GATE 2013)
X'Y,XY'
X'Y,XY'Z',XY'Z
The Boolean expression for the truth table shown is (GATE 2014)
B(A+C)(A'+C')
B(A+C')(A'+C)
The number of distinct Boolean expressions of 4 variables is (GATE 2003)
16
256
1024
65536
HOW IS MY TEACHING?
GOOD
AVERAGE
BAD
VERY BAD
