Lesson 6 Minimization of Boolean expression using Algebric Method
Welcome to your Lesson 6 Minimization of Boolean expression using Algebric Method
Q.1) In the boolean algebra, a variable has ________ different state(s)/value(s).
A. 1
B. 2
C. 3
D. 4
Q.2) In Boolean algebra A.A is equal to
A. A
B. A²
C. 2A
D. 1
Q.3) AND operation is equivalent to
A. Division
B. Union
C. Intersection
D. Both B and C
Q.4) OR operation is equivalent to
A. Division
B. Union
C. Intersection
D. Both B and C
Q.5) In Boolean algebra AND is represented by
A. +
B. –
C. /
D. *
Q.6) In Boolean algebra, OR is represented by
A. +
B. –
C. /
D.*
Q.7) X + X.Y =?
A. 1
B. 0
C. X
D. Y
Q.8) LSI means
A. Large Symbol Integration
B. Large Scale Integration
C. Large Symbol Invertor
D. Large Scale Invertor
Q.9) Truth table is used to express
A. Boolean expression
B. Boolean map
C. Boolean matrix
D. Boolean addition
Q.10) Complement of NOR and OR gate is ________ and ________ respectively.
A. AND, NAND
B. NAND, AND
C. OR, NOR
D. NOR, OR
Time is Up!
