02 Boolean Algebra Chaithra

PU–Study material Boolean Algebra
Blue Print (As per PU Board)

1 mark 2 marks 3 marks 5 marks Total Marks
Topic
questions questions questions questions
Boolean Algebra - 2 - 1 9
One mark questions

1. What is the other name of Boolean Algebra?
Answer: “Switching Algebra” is another name of Boolean Algebra.
2. What do you understand by the term truth value?
Answer: Sentences which can be determined to be true or false are called logical statement and the
results true or false are called truth values.
3. What do you understand by the term truth functions?
Answer: Sentences which can be determined to is be true or false are called truth functions or logical
statements.
4. What do you mean by binary valued variables?
Answer: The variables which store truth values are called logical variables or binary valued variables,
as they can store only one of the two values (0 or 1) (true or false)
5. What do you understand by logic functions?
Answer: Logic statements or truth functions are combined with the help of logical operators like AND,
OR and NOT to form a compound statement or logical function.
6. Give example of logic functions?
Answer: Y AND X OR Z
X NOT Y OR Z
7. What is meant by tautology and fallacy?
Answer: If the result of any logical statement or expression is always true or 1, it is called tautology and
if always results in false or 0 it is called fallacy.
8. Prove that 1 + y is a tautology and 0.y is a fallacy.
Answer: If y = 0 1+ 0 = 1
If y = 0 0.0 = 0
y =1 1 + 1 = 1 hence 1 + y is a tautology
y =1 0.1 = 0 Hence 0.Y is a fallacy
9. Name the three logical operators

Answer: The three logical operators are AND , OR , NOT
10. What is a truth table? What is its significance?
Answer: Truth table is a table which represents all the possible values of logical variables along with all
the possible results for the given combinations of values.
Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

11. What is NOT operator?

Answer: NOT operation is singular or unary operation as it operates on a single variable. The
operation performed by NOT operator is called complementation and the symbol used for it is the -
(bar).
12. Write venn diagram for NOT operation
Answer:
X
X
13. Write truth table for NOT operation

Answer:
X X
0 1
1 0
14. What is OR operator?

Answer: OR operator in Boolean algebra is an operator which denotes operation called logical addition
and the symbol we use for it is + .The + symbol here, does not mean arithmetic addition, but it is a
logical addition. X + Y is read as X OR Y.
15. Write the venn diagram form the OR operator.
Answer:
X Y
The shaded portion represents X OR Y

16. Write the truth table for OR operation.

Answer:
X Y X+Y
0 0 0
0 1 1
1 0 1
1 1 1
When either X or Y is 1 or when both are 1 the result of X OR Y is 1

17. What is an AND operator?
Answer: AND operator performs logical multiplication and the symbol for AND operation is (dot).
Thus X.Y will be read as X AND Y
18. Write the venn diagram for the AND operator.
Answer:
X Y
The shaded part shows X AND Y

19. Write the truth for AND operation
Answer:
X Y X⋅ Y
0 0 0
0 1 0
1 0 0
1 1 1
Only when both X and Y are 1 the result of X ⋅ Y is 1. If any one of X or Y is 0 the result is 0.
20. State indempotence law.

Answer: This law states that when a variable combines with itself using OR or AND operator, the
output is the same variable.
X+X =X
X⋅X = X

21. Prove indempotence law using a truth table

Answer:
X X X+X
0 0 0
X+X = X
1 1 1
X X X⋅X
0 0 0
X ⋅X = X
1 1 1
22. Draw logic diagram to represent indempotence law

Answer:
X X +X =X
OR
X
X X⋅X = X
AND
X
23. State involution law

Answer: This law states when the complement of a variable is complemented again we get the
variable.
i.e., X = X
24. Prove involution law using truth table.
Answer:
X X X
0 1 0 X =X
1 0 1
First column represent value of X , second represents complement of X i.e., X and third represent
complement of X (i.e., X ).

25. Draw logic diagram to represent involution law.

Answer:
X X =X
X NOT NOT
26. State complementary law.
Answer: These law states that X + X = 1 and X . X = 0 . Here we will combine a variable with its
complement.
27. Prove complementary law using truth table.
Answer:
X X X+X
0 1 1
X + X =1
1 0 1
X X X ⋅X
0 1 0
X ⋅X = 0
1 0 0
28. Draw logic diagram to represent complementary law.

Answer:
X X + X =1
NOT
OR
X X ⋅X = 0
NOT
AND
29. State commutative law.

Answer: These laws state that X + Y = Y + X and X .Y = Y . X

30. Prove commutative law using a truth table

Answer:
X Y X +Y Y+X
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1
Column X + Y and Y + X are identical. Hence proved
X Y X .Y Y ⋅X
0 0 0 0
0 1 0 0
1 0 0 0
1 1 1 1
Column X ⋅Y and Y ⋅ X are identical hence proved.
31. Draw logic diagram to represent commutative law.

Answer:
X X +Y X Y+X
OR = OR
X X
X X Y ⋅X
X ⋅Y
AND = AND
X X
32. State associative law.

Answer: These laws state that
X + (Y + Z ) = ( X + Y ) + Z
X ⋅ (Y ⋅ Z ) = ( X ⋅ Y ) ⋅ Z

33. Prove associative law using a truth table.

Answer:
X Y Z X +Y Y +Z X + (Y + Z ) (X +Y)+ Z
0 0 0 0 0 0 0
0 0 1 0 1 1 1
0 1 0 1 1 1 1
0 1 1 1 1 1 1
1 0 0 1 0 1 1
1 0 1 1 1 1 1
1 1 0 1 1 1 1
1 1 1 1 1 1 1
=
Columns X + ( Y + Z ) and ( Z + Y ) + Z both are identical and hence proved.
X Y Z Y ⋅Z X ⋅Y X ⋅ (Y ⋅ Z ) ( X ⋅Y ) ⋅ Z
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
0 1 1 1 0 0 0
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 0 1 0 0
1 1 1 1 1 1 1
Columns X ⋅ (Y ⋅ Z ) and ( X ⋅ Y ) ⋅ Z are identical and hence proved
34. Draw logic diagram to represent associative law.

Answer: X
Y R X
OR = OR
OR R
Z Y OR
Z
X
Y
AND
AND = R
R Y AND
Z AND
X

35. State distributive law.

Answer: Distributive law states that
X ( Y + Z ) = XY + XZ
X + YZ = ( X + Y ) ⋅ ( X + Z )
36. Prove distributive law using truth table

Answer:
X Y Z Y +Z XY XZ X (Y + Z ) XY + XZ
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 0 1 1 1
1 1 0 1 1 0 1 1
1 1 1 1 1 1 1 1
Both the columns X (Y + Z ) and XY + XZ are equal. Hence proved.
Since rule (b) is a dual of rule (a) hence even that is proved.
37. Draw logic diagram is represent distributive law.

Answer:
X
X
Y AND
OR
Z R Y R
AND = OR
X X
AND
Z
Y X X +Y
OR
AND Y
Z R =
OR R
AND
X
X X +Z
OR
Z

38. Prove that X + XY = X (Absorption law)

Answer:
X Y XY X + XY
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1
=
X + XY = X
39. Prove that X ⋅ ( X + Y ) = X
Answer:
X Y X +Y X ⋅( X + Y )
0 0 0 0
0 1 1 0
1 0 1 1
1 1 1 1
40. Draw logic diagram to represent absorption law

Answer:
X
AND X + XY = X
OR
Y
X
OR
X (X +Y ) = X
Y AND

41. Prove that XY + XY = X

Answer:
X Y Y XY XY XY + XY
0 0 1 0 0 0
0 1 0 0 0 0
1 0 1 0 1 1
1 1 0 1 0 1
42. Prove that ( X + Y ) ( X + Y ) = X
Answer:
X Y Y X +Y X +Y ( X + Y )⋅( X + Y )
0 0 1 0 1 0
0 1 0 1 0 0
1 0 1 1 1 1
1 1 0 1 1 1
43. Prove that X + XY = X + Y

Answer:
X Y X XY X +Y X + XY
0 0 1 0 0 0
0 1 1 1 1 1
1 0 0 0 1 1
1 1 0 0 1 1
44. What is minterm?

Answer: Minterm is a product of all the literals (with or without the bar) within the logic system.

45. Find the minterm for XY + Z

Answer: XY + Z
( ) (
XY .1 + 1.1.Z = XY Z + Z + X + X Y + Y Z )( )
XYZ , XYZ , XYZ , XYZ , XYZ , XYZ
= XYZ + XYZ + XYZ + XYZ + XYZ

m7 + m6 + m3 + m5 + m1
46. What is maxterm?

Answer: Maxterm is sum of all the literals (with or without the bar) within the logic system.
47. Find the maxterm for X + Y + Z
Answer: M 2 is the maxterm for X + Y + Z
48. What is the canonical form of Boolean expression?

Answer: Boolean expression composed entirely either of minterms or maxterms is referred to as
canonical expression.
49. Give an example for a Boolean expression in the sum of minterms form.
Answer: XY + XY + XY = Z is called minterm canonical form of Boolean expression or canonical sum of
products form of expression.
50. Give an example for a Boolean expression in the products of maxterms form.
Answer: ( X + Y + Z ) ⋅ ( X + Y + Z ) ⋅ ( X + Y + Z ) is called canonical product of sum.
Two marks questions

51. Prove algebraically that ( X + Y )( X + Z ) = X + YZ
Answer: ( X + Y )⋅( X + Z )
= XX + XZ + XY + YZ
X + XZ + XY + YZ (∵ XX = X)
X (1 + Z + Y ) + YZ (1 + Z + Y = 1)
X + YZ
Hence proved that ( X + Y ) ⋅ ( X + Z ) = X + YZ
52. Prove algebraically that X + XY = X + Y
Answer: LHS = X + XY
( X + X )( X + Y )
1. ( X + Y )
= X +Y
LHS = RHS → hence prove
53. Use duality theorem is derive another Boolean relation from A + AB = A + B

Answer: A ⋅ A + B = A ⋅ B is the dual theorem of A + AB = A + B
54. What would be complement of the following
Answer:
(
(a) A BC + BC )
A+(B +C ⋅B +C)
(b) AB + CD
A + B ⋅C + D
(c) XY + YZ + ZZ
X +Y ⋅ Y + Z ⋅ Z + Z
(d) X + XY + XZ
X ⋅ X +Y ⋅ X + Z
55. What are the fundamental products of the input words.

ABCD = 0010, ABCD = 1100, ABCD = 1110
Write SOP expression

Answer: ABCD , ABCD , ABCD
56. A truth table has output 1 for each of these inputs

ABCD = 0011, ABCD = 0101, ABCD = 1000 what are the fundamental products and write minterm
expression.
Answer: ABCD + ABCD + ABCD = m3 + m5 + m8
57. Construct a Boolean function of three variables X , Y and Z that has an output 1 when exactly two of
X , Y and Z are having values 0 and an output 0 in all other cases.
Answer:
XYZ = 001
XYZ = 010
XYZ = 100
SOP form X Y Z + XY Z + Y Z
Since, they have asked to construct Boolean function which has output 1, so its in SOP form

58. Construct a truth table for 3 variable A, B and C that will have output 1 when
XYZ = 100, XYZ = 101, XYZ = 110 and XYZ = 111 write the Boolean expression for logic network in
SOP form.
Answer:
X Y Z F Minterms
0 0 0 0 XY Z
0 0 1 0 XY Z
0 1 0 0 XYZ
0 1 1 0 XYZ
1 0 0 1 XY Z
1 0 1 1 XY Z
1 1 0 1 XYZ
1 1 1 1 XYZ
SOP form
XY Z +XY Z+XYZ+XYZ
59. Convert the following expression to canonical product –of – sum form
Answer:
(a) ( A + C )( C + D ) [Add missing variable missing variable]
( A + C + D ⋅ D) ( A⋅ A + C + D)
( A + C + D)( A + C + D)( A + C + D)( A + C + D) (Removing duplicate terms)
( A + C + D) ( A + C + D) ( A + C + D)
M 0 ⋅ M1 ⋅ M 4 (Short hand)
Thus us the desired canonical form.
(b) A ⋅ ( B + C ) C + D( )
( )(
= A + B ⋅ B + C ⋅ C + D ⋅ D ⋅ A⋅ A + B + C + D ⋅ D ) (Add missing variable)
(
= A⋅ A + B ⋅ B + C + D )
= ( A + B + C + D ) ( A + B + C + D ) ( A + B + C + D ) ( A + B + C + D )( A + B + C + D )( A + B + C + D )
(Removing duplicate terms)
( A + B + C + D ) ( A + B + C + D )( A + B + C + D )( A + B + C + D )( A + B + C + D )
Short hand = M 0 ⋅ M 7 ⋅ M 9 ⋅ M 3 ⋅ M15
(c) ( X + Y )(Y + Z )( X + Z ) (Adding missing variables)
= ( X + Y + Z ⋅ Z ) X ⋅ X + Y + Z ( X + Y ⋅Y + Z )
( X +Y + Z )( X + Y + Z )( X +Y + Z )( X +Y + Z )( X +Y + Z )( X +Y + Z )
(Removing duplicate terms)
= ( X + Y + Z ) ( X + Y + Z )( X + Y + Z )( X + Y + Z )
Short hand = M 0 ⋅ M 7 ⋅ M 9 ⋅ M 3 .M15
60. Convert the following expressions to canonical sum-of-product form.

Answer:
(a) X + XY + XZ [Add missing variable + missing variable ]
X (Y + Y )( Z + Z ) + XY ( Z + Z ) + ( XZ )(Y + Y )
( XYZ ) + ( XYZ ) + XYZ + XYZ + XYZ + XYZ (Removing duplicate terms)
( XYZ ) + XYZ + XYZ + XYZ + XYZ

This is the desired SOP form
Shorthand m7 + m4 + m3 + m2 + m0
(b) Y ⋅ Z + X ⋅ Y [Add missing variable + missing variable]
( X + X )Y ⋅ Z + X ⋅Y ( Z + Z )
X ⋅ Y ⋅ Z + XY ⋅ Z + XY ⋅ Z + XYZ (Removing duplicate terms)
XYZ + XY .Z + X ⋅ Y ⋅ Z
This is desired SOP form
Shorthand m7 + m3 + m2
(
(c) AB B + C )
= AB ⋅ B + AB ⋅ C  BB = B 
AB + ABC [Add missing variable + missing variable]
AB ( C + C ) + AB ⋅ C
= ABC + ABC + AB ⋅ C (Removing duplicate terms)
= ABC + ABC
= This is desired SOP form
Shorthand m5 + m4

61. Draw Karnargh maps for the following expressions

Answer:
(a) X ⋅ Y + X ⋅ Y
Y Y (1)
X Y (0)
(0 ) X 1 1
0 1
(1) X 0
2
0
3
(b) XYZ + XYZ
YZ
X ( 00 ) YZ YZ ( 01) YZ (11) (10 ) YZ
(0 ) X 0 1 0 0
0 1 3 2
(1) X 0 0 0 1
4 5 7 6
(c) X Y Z + XY Z + X Y Z
YZ
X YZ
YZ YZ YZ
X 0 1 0 1
0 3 2
X 1 0 0 0
4 5 3 6
62. Draw a general k-map for four variable A, B , C and D

Answer:
CD ( 00 ) ( 01) (11) (10 )

AB CD CD CD CD
( 00 ) AB 0 1 3 2
( 01) AB 4 5 7 6
(11) AB
12 13 15 14
(10 ) AB
8 9 11 10

63. Given the expression in 4 − variables, draw the k- map for the function
Answer:
(a) m2 + m3 + m5 + m7 + m9 + m11 + m13
CD
AB CD CD CD CD
0 0 1 1
AB 0 1 3 2
0 1 1 0
AB 4 5 7 6
AB 0 1 0 0
12 13 15 14
AB 0 1 1 11 0 10
8 9
(b) m0 + m2 + m4 + m8 + m9 + m10 + m11 + m12 + m13
CD
AB CD CD CD CD
1 0 0 1
AB 0 1 3 2
1 0 0 0
AB 4 5 7 6
AB 1 1 0 0
12 13 15 14
AB 1 1 1 1
8 9 11 10
64. Draw the k-map for the function in 3 − variables

Answer:
(a) m0 + m2 + m4 + m6 + m7
BC
A
BC BC BC BC
A 1 1
0 1 3 2
1 1 1
A
4 5 7 6

(b) m1 + m2 + m3 + m5 + m7
YZ
YZ YZ YZ YZ
X
X
0
1 1
1 3
1 2
X 1 1 1
4 5 7 6
65. Write SOP expression corresponding to the function F in the following truth table and draw the
logic gate diagram ( use OR and AND gate)
Answer:
X Y Z F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
SOP form XY Z + XYZ + XY Z + XYZ
Logic diagram XY Z + XYZ + XY Z + XYZ
X
Y AND
Z
X
Y AND
Z
XY Z + XYZ + XY Z + XYZ
OR
X
Y AND
X
Y AND
Z

Three marks questions

66. State and prove any three theorems of Boolean Algebra
Answer: (1) Idempotence law: States that when a variable combines itself using OR or AND operator,
the output is the same variable
X+X =X
X .X = X
Proof:
If X = 0 then 0 + 0 = 0
If X = 1 then 1 + 1 = 1
If X = 0 then 0.0 = 0
If X = 1 then 1.1 = 1
(2) Involution law: States that if the complement of a variable complemented again, we get the same
variable that is X = X
X X X
0 1 0
1 0 1
|→ = ←|
Distributive law: States that

X .(Y + Z ) = XY + XZ
X + YZ = ( X + Y )( X + Z )
X Y Z Y +Z XY XZ X (Y + Z ) XY + XZ
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 1 1 1 1
1 1 0 1 0 0 1 1
1 1 1 1 1 1 1 1
|→ = ←|

67. State and prove associative law of addition and multiplication

Answer: Associative law states
X + (Y + Z ) = ( X + Y ) + Z
X .(Y .Z ) = ( X .Y ) .Z
X Y Z Y +Z X +Y X (Y + Z ) ( X +Y ) + Z
0 0 0 0 0 0 0
0 0 1 1 0 1 1
0 1 0 1 1 1 1
0 1 1 1 1 1 1
1 0 0 0 1 1 1
1 0 1 1 1 1 1
1 1 0 1 1 1 1
1 1 1 1 1 1 1
|→ = ←|
X Y Z Y +Z X + Y X (Y + Z ) ( X +Y ) + Z
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
0 1 1 1 0 0 0
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 0 1 0 0
1 1 1 1 1 1 1
|→ = ←|

68. State and prove De Morgan’s theorems by the method of perfect induction
Answer: De Morgan’s theorem states that:
X .Y = X + Y
X + Y = X .Y
Proof: To prove this theorem, we will make use of complementary law i.e. X + X = 1 and X . X = 0 If
XY ' s complement in X + Y then it must be true that
( )
XY + X + Y = 1 and XY X + Y = 0 ( )
LHS = XY + X + Y ( )
(
= X + Y + XY )
(
= X +Y + X . X +Y +Y )( )
(
= X + X +Y . X +Y +Y )( )
= 1 + Y . X + 1 ∵ X + X = 1 and Y + Y = 1
( )( )
=1 . 1
= 1 = RHS
(
XY X + Y = 0 )
= XY X + XY Y
0.Y + X .0 ∵ X X = 0 and YY = 1
 
0+0
= 0 − RHS
( )
XY . X + Y = 0 and XY X + Y = 1 ( )
Thus X .Y = X + Y
Hence proved
69. Obtain the min term expression for the Booleans function F = A + BC
Answer: F = A + BC
(
A.1.1 + 1.BC = A B + B C + C + A + A BC)( ) ( )( )
= ABC + ABC + ABC + ABC + ABC + ABC
= ABC + ABC + ABC + ABC + ABC

70. Explain with an example how to express a Boolean function in its sum of products form
Answer: Sum of products (SOP) is derived from two sets of known values
(i) Various possible input values
(ii) The desired output values for each of the input combinations
Let us consider a specific problem. A logical network has two input X and Y and an out put Z , the
relationship between inputs and output is as follows

(1) When X = 0 and Y = 0 then Z = 1
We can prepare a truth table from the above relations as follows
X Y Z Product terms
0 0 1 XY
0 1 0 XY
1 0 1 XY
1 1 1 XY
Here, we have added one more column to the truth table consisting list of product terms or minterms.
Adding all the terms for which the output is 1 i.e. Z = 1 we get following expression
X Y + X Y + XY = Z
Now we see it is an expression containing only minterms. This type of expression is called minterm
canonical form of Boolean expression or connonical sum of products form of expression
16. Explain with an example how to express a Boolean function in its product of sum from.
Answer: Just as any Boolean expression can be transformed into sum of minterms, it can also be
represented as a product of maxterms
Example the truth table for the Boolean function F ( X , Y , X ) is as follows
X Y Z F
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

Add a new column containing maxterms

X Y Z F Maxterms
0 0 0 1 X +Y + Z
0 0 1 0 X +Y + Z
0 1 0 1 X +Y + Z
0 1 1 0 X +Y + Z
1 0 0 1 X +Y + Z
1 0 1 0 X +Y + Z
1 1 0 1 X +Y + Z
1 1 1 1 X +Y + Z
Now by multiplying maxterms for the out put 0 's we get the desired product of sums expression
which is :
( X + Y + Z )( X + Y + Z )( X + Y + Z )
17. Construct a truth table for minterms and maxterms for 3 variables and designate the terms
Answer:
X Y Z Minterms Designate
0 0 0 X .Y .Z m0
0 0 1 X .Y .Z m1
0 1 0 X .Y .Z m2
0 1 1 X .Y .Z m3
1 0 0 X .Y .Z m4
1 0 1 X .Y .Z m5
1 1 0 X .Y .Z m6
1 1 1 X .Y .Z m7

X Y Z Maxterms Designate
0 0 0 X +Y + Z M0
0 0 1 X +Y + Z M1
0 1 0 X +Y + Z M2
0 1 1 X +Y + Z M3
1 0 0 X +Y + Z M4
1 0 1 X +Y + Z m5
1 1 0 X +Y + Z m6
1 1 1 X +Y + Z m7
B
NAND
C B.C . AC
NAND
= BC + A.C
A
NAND
C
Five marks questions

18. Using maps, simplify the following expressions in four variables W , X , Y and Z
(a) m1 + m3 + m5 + m7 + m9 + m11 + m13
(b) m0 + m2 + m4 + m8 + m9 + m10 + m11 + m12 + m13
Answer: (a) m1 + m3 + m5 + m7 + m9 + m11 + m13
YZ
YZ YZ YZ YZ
WX 01
00 11 10
WX 00 1 1
0 1 3 2
WX 01 1 1
4 5 7 6
WX 11
1
12 13 15 14
W X 10 1 1
8 9 11 10

1st Quad ( m1 + m3 + m5 + m7 )
= W X YZ + W XYZ + W X YZ + W XYZ
= W/ Z
YZ
2ND Quad ( m1 + m3 + m9 + m11 )
= W X YZ + W XYZ + W XYZ + W X YZ + W XYZ
= XZ
3rd Quad :- M1 + M 5 + M13 + M 9
= W X YZ + W X YZ + WX YZ + W X YZ
= YZ
(b) m0 + m2 + m4 + m8 + m9 + m10 + m11 + m12 + m13
YZ
YZ YZ YZ YZ
WX 01
00 11 10
WX 00 1 1 1
0 1 3 2
WX 01 1
4 5 7 6
WX 11
1 1
12 13 15 14
W X 10 1 1 1 1
8 9 10 11
1st quad M12 + M13 + M 8 + M 9
= WX Y Z + WX YZ + W X Y Z + W X YZ
=WY
2nd quad M 0 + M 4 + M12 + M 8
= W X Y Z + W X Y Z + WX Y Z + W X Y Z
=YZ
3rd quad M 8 + M 9 + M10 + M11
= W X Y Z + W X YZ + W XYZ + W XY Z
=W X
4th Quard:- M 0 + M 2 + M 8 + M11
= W X Y Z + W XY Z + W X Y Z + W XY Z = XZ

19. State and prove De Morgan theorem using truth table

Answer: De Morgan theorem state that
(a) X + Y = X . Y
(b) X .Y = X + Y
Truth table
X Y X Y X .Y X +Y X +Y
0 0 1 1 1 0 1
0 1 1 0 0 1 0
1 0 0 1 0 1 0
1 1 0 0 0 1 0
|→ = ←|
Since all Boolean laws are dual in nature hence if one is proved, the other is also proved
20. For the Boolean function F and F ' in the truth table, find the following :
(1) List the minterms of the function F and F '
(2) Express F and F ' in sum of minterms in algebraic form
(3) Simplify the functions to an expression with a minimum number of literals
Answer:
A B C F F'
0 0 0 0 1
0 0 1 0 1
0 1 0 1 0
0 1 1 1 0
1 0 0 0 1
1 0 1 0 1
1 1 0 1 0
1 1 1 1 0

(3) Adding a column minterms for the function F and F ' the truth table would be as below:
A B C F F' min terms
0 0 0 0 1 ABC
0 0 1 0 1 ABC
0 1 0 1 0 ABC
0 1 1 1 0 ABC
1 0 0 0 1 ABC
1 0 1 0 1 ABC
1 1 0 1 0 ABC
1 1 1 1 0 ABC
Minterms for F = ABC , ABC , ABC , ABC
Minterms for F ' = ABC , ABC , ABC , ABC

(2) F in sum of minterms in algebraic form =
F = ABC + ABC + ABC + ABC

F ' = in sum of minterms in algebraic form=
F ' = ABC + ABC + ABC + ABC
(3) F ' = ABC + ABC + ABC + ABC
( ) ( )
= A + A BC + BC A + A [Grouping the terms and removing common terms]
= BC + BC  A + A = 1
 
(
= B C +C ) C + C = 1
 
=B
21. State and prove De Morgan’s theorem algebraically
Answer: De Morgan’s theorem states
X . Y = X +Y
X +Y = X . Y
To prove this theorem we make use of complementarity laws. It XY’s complement is X + Y then it must
be true that
(
(a) XY + X + Y = 1 and )
(
(b) XY X + Y = 0 )
To prove the first part
LHS = XY + X + Y ( )
( )
= X + Y + XY
( )(
= X +Y + X . X +Y +Y )
( )(
= X + X +Y . X +Y +Y )
( )(
= 1+ Y . X +1 ∵ X + X = 1 )( )
= 1 . 1(∵1 + X = 1)
= 1 RHS
Now , the second part i.e. XY . X + y = 0 ( )

(
LHS = XY . X + Y )
XY X + XYY
X XY + XYY
=0. Y + X .0 ∵X . X =0( )
0+0 = 0
( )
XY X + Y = 0 and XY X + Y = 1 ( )
Thus X .Y = X + Y
Since this law is dual in nature
Hence X + Y = X . Y
22. State the applications of De Morgan’s theorems

Answer: (1) De Morgan’s theorem is useful in the implementation of the basic gate operations with
alternative gates, particularly with NAND and NOR gates which are readily available in IC form.
(2) De Morgan’s theorem is used in the simplification of Boolean expression
(3) These commonly apply to text searching using Boolean operators AND, OR and NOT
(4) De Morgan’s laws are an example of a more general concept of mathematical duality

23. Given the Boolean function F ( X , Y , Z ) = ∑ ( 0, 2,4,5,6....) . Use Karnaugh’s map to reduce the
function F using SOP from. Write a logic gate diagram for the reduced SOP expression
Answer:
YZ
X YZ YZ YZ YZ
00 01 11 10
X'0
1 0 0 1
0 1 3 2
1 1 0 1
X1
4 5 7 6
1st quad ( m0 + m2 + m4 + m6 )
X Y Z + XY Z + X Y Z + XY Z
XZ + XZ =Z
1st pair ( m4 + m5 )
X Y Z + X YZ
XY
X XY
F ( X ,Y , Z ) = X Y + Z XY+Z
Y
Logic diagram for XY + Z =

Z
24. State the two complement properties of Boolean algebra. Verify using the truth table
(
X . Y Z + YZ )
Answer: The two complement properties of Boolean algebra states
(a) X + X = 1
(b) X . X = 0
Proof using truth table
X X X +X
0 1 1
1 0 1
X + X = 1 Hence proved the above truth table results in a taulology

X X X.X
0 1 0
1 0 0
X . X = 0 Hence proved X . X = 0 is a fallacy
25. Given the Boolean function F ( A, B, C, D ) = ∑( 5,6,7,8,9,10,14) Use Karnaugh’s map to reduce the
function F using SOP from. Write a logic gate diagram for the reduced SOP expression
Answer:
CD
AB
A
ABD
1st pair ( m5 + m7 ) B AND
D
= ABCD + ABCD
B
= ABD BC D
C AND
D
ABD + BC D + ABC + AC D
2nd pair ( m6 + m14 ) OR
A
ABC
ABC D + ABC D B AND
C
= BC D
A
AC D
C AND
3rd pair ( m8 , m9 ) D
ABC D + ABCD
ABC
4th pair ( m10 , m14 )
ABC D + ABC D

AC D
Hence F ( A, B, C , D ) = ABD + BC D + ABC + AC D
Logic Diagram:
A
ABD
B AND
D
B
BC D
C AND
D
ABD + BC D + ABC + AC D
OR
A
ABC
B AND
C
A
AC D
C AND
D
26. Given F ( A, B, C , D ) = 11( 0, 2, 4,6,8,10,14 ) use karnaugh map to reduce the function F using POS from.
Write a logic gate diagram for the reduced POS expression

Answer:
CD C+D C+D C+D C+D
AB 00 01 11 10
00 0 0
A+B 0 1 3 2
0 1 0
A+B 01
4 5 7 6
11 0
A+B
12 13 15 14
0 0
A+B 10 8 9 11 10
1st quad ( M 0 + M 2 + M 8 + M10 )
( A + B + C + D ).( A + B + C + D ).( A + B + C + D ) . ( A + B + C + D)
= ( A + B + D) . ( A + B + D)
= B+D

2nd quad ( M 2 + M 6 + M10 + M14 )
( A + B + C + D ) . ( A + B + C + D ) .( A + B + C + D )
( A + B + C + D)
( )(
= A+C + D . A+ B +C + D )
=C+D
OR
D
( B + D )( C + D )( A + C + D )
C
OR AND
OR
C
D
3rd Quard ( M 0 + M 2 + M 4 + M 6 )
( A + B + C + D ) .( A + B + C + D ).( A + B + C + D ) .( A + B + C + D )
(
= ( A + B + D). A + B + D )
= ( A + D)
8. Using basic gates, construct a logic circuit for the Boolean expression ( X + Y ) ⋅ ( X + Z ) ⋅ (Y + Z )
Answer:
X X +Y
OR
Y
X X +Z ( X + Y ) ( X + Z )(Y + Z )
OR AND
Z
Y Y +Z
OR
Z

9. Simplify the following Boolean expressions and draw logic circuit diagrams of the simplified
expressions using NAND gates
Answer:
(a) ABC + ABC − + ABC + ABC + ABC [Removing common terms]
AB ( C + C ) + AB ( C + C )
AB ⋅ 1 + AB ⋅ 1
AB + AB
A NA A⋅B
B ND
NA A⋅B⋅ A⋅B
ND
(A ⋅ B)+ (A⋅ B)
A NA A⋅ B
B ND
(b) ABC + ABC + ABC + ABC

(Taking common from 1st and 2rd expression and 2nd and 4the expression)
ABC + ABC + ABC + ABC
BC ( A + A ) + AC ( B + B ) ( B + B = 1)
BC + AC

02 Boolean Algebra Chaithra

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

02 Boolean Algebra Chaithra

Загружено:

Авторское право:

Доступные форматы

PU–Study material Boolean Algebra

Blue Print (As per PU Board)

One mark questions

9. Name the three logical operators

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

11. What is NOT operator?

13. Write truth table for NOT operation

14. What is OR operator?

The shaded portion represents X OR Y

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

16. Write the truth table for OR operation.

When either X or Y is 1 or when both are 1 the result of X OR Y is 1

The shaded part shows X AND Y

20. State indempotence law.

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

21. Prove indempotence law using a truth table

22. Draw logic diagram to represent indempotence law

23. State involution law

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

25. Draw logic diagram to represent involution law.

26. State complementary law.

28. Draw logic diagram to represent complementary law.

29. State commutative law.

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

30. Prove commutative law using a truth table

Column X + Y and Y + X are identical. Hence proved

Column X ⋅Y and Y ⋅ X are identical hence proved.

31. Draw logic diagram to represent commutative law.

32. State associative law.

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

33. Prove associative law using a truth table.

Columns X ⋅ (Y ⋅ Z ) and ( X ⋅ Y ) ⋅ Z are identical and hence proved

34. Draw logic diagram to represent associative law.

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

35. State distributive law.

36. Prove distributive law using truth table

Both the columns X (Y + Z ) and XY + XZ are equal. Hence proved.

37. Draw logic diagram is represent distributive law.

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

38. Prove that X + XY = X (Absorption law)

40. Draw logic diagram to represent absorption law

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

41. Prove that XY + XY = X

42. Prove that ( X + Y ) ( X + Y ) = X

43. Prove that X + XY = X + Y

44. What is minterm?

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

45. Find the minterm for XY + Z

= XYZ + XYZ + XYZ + XYZ + XYZ

46. What is maxterm?

48. What is the canonical form of Boolean expression?

Answer: ( X + Y + Z ) ⋅ ( X + Y + Z ) ⋅ ( X + Y + Z ) is called canonical product of sum.

Two marks questions

52. Prove algebraically that X + XY = X + Y

53. Use duality theorem is derive another Boolean relation from A + AB = A + B

55. What are the fundamental products of the input words.

Write SOP expression

56. A truth table has output 1 for each of these inputs

Answer: ABCD + ABCD + ABCD = m3 + m5 + m8

Copyright © Ace Creative Learning Pvt Ltd.,|| www.ace-online.co.in

Thus us the desired canonical form.

(Removing duplicate terms)

Short hand = M 0 ⋅ M 7 ⋅ M 9 ⋅ M 3 ⋅ M15

(c) ( X + Y )(Y + Z )( X + Z ) (Adding missing variables)