A.  I,III, and II 
B.  II, I and III 
C.  III, II and I 
D.  III, I and II 
Option: D Explanation : Click on Discuss to view users comments. 
The number of canonical expressions that can be developed over a 3valued boolean algebra is
A.  8 
B.  16 
C.  32 
D.  256 
Option: D Explanation :
Canonical form=SOP or POS Click on Discuss to view users comments. Gagan Kumar said: (1:49am on Monday 13th November 2017)
(X Y(1 X))(X Z)(X Y)(X Z)X=YZ

Simplified form of the boolean expression (X + Y + XY) (X + Z) is
A.  X + Y + Z 
B.  XY + YZ 
C.  X + YZ 
D.  XZ + Y 
Option: C Explanation : Click on Discuss to view users comments. priya said: (12:40am on Friday 6th September 2013)
xx xy xxy xz zy zxyx xy xz zy zxyx zy zxyx zy(x 1=1)
Gagan Kumar said: (1:50am on Monday 13th November 2017)
(X Y(1 X))(X Z)(X Y)(X Z)(X YZ)

Which of the following boolean expressions is not logically equivalent to all of the rest ?
A.  ab + (cd)' + cd + bd' 
B.  a (b + c) + cd 
C.  ab + ac + (cd)' 
D.  bd' + c'd' + ab + cd 
Option: A Explanation : Click on Discuss to view users comments. 
A switching function is symmetric with respect to a set of literals if and only if the function remains unchanged after
A.  Two of these literals are interchanged 
B.  Any permutation of the literals 
C.  All the literals are changed in anticlockwise order 
D.  All the literals are changed in clockwise order 
Option: B Explanation : Click on Discuss to view users comments. 
Syllabus covered in this section is
This Section covers Digital Logic Questions Answers .
Who can benefit
Various Search Terms used for this section are