Digital Logic - Boolean Algebra

1.

Which of the following respectively represent commutative law, Associative law and Distributive law ?
I. A.(B C)=(A.B).C
II. A.(B+C)=A.B+A.C
III. A + B = B + A
CODES

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


2. The number of canonical expressions that can be developed over a 3-valued boolean algebra is

  • Option : D
  • Explanation : Canonical form=SOP or POS No of min/MAX terms=23=8. Therefore, Canonical form will have 28 have  terms. Zero term canonical forms=8C0=1. One term canonical forms=8C1=8. Two term canonical forms=8C2=28 Similarly total number of canonical expressions= 8C0+8C1+8C2+8C3+8C4+8C5+8C6+8C7+8C8=256
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


3. Simplified form of the boolean expression (X + Y + XY) (X + Z) is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


4. Which of the following boolean expressions is not logically equivalent to all of the rest ?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


5. A switching function is symmetric with respect to a set of literals if and only if the function remains unchanged after

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *