Unit 4

Questions Carrying 2 Marks

1. Write the Truth Table and Logic Symbol of the following AND gate, OR gate, NOT gate, NAND
gate, NOR gate, XOR gate, XNOR gate.
2. Write the Truth Table and Logic Symbol of the following AND gate, OR gate, NOT gate, NAND
gate, NOR gate, XOR gate, XNOR gate.

For both the above questions

3. Draw the logic circuit for F (X, Y, Z) =XY+X’Z’ using basic gate.

4. Draw the logic circuit for F (X, Y, Z) =(X+Y)’ using basic gate.

5. Define Sum term and Product term.

Sum Term: In Boolean algebra, the logical sum of several variables on which a function depends
is considered to be a sum term. In other words, the OR function is referred to as a sum term. The
variables in a sum term can be either in normal form or in complemented form.
For example, X + Y + Z′ is a sum term.
Product Term: In Boolean algebra, the logical product of several variables on which a function
depends is considered to be a product term. In other words, the AND function is referred to as a
product term. The variables in a product term can be either in normal form or in complemented
form.
For example, XYZ′ is a product term.

6. What are minterms and maxterms?

Minterms:
o Minterm is a product of all the literals (with or without bar) within the logic system.
o A product term containing all n variables of the function in either normal or complemented
form is called the minterm.
o Each minterm is obtained by an AND operation of the variables in their normal form or
complemented form.
o For a two-variable function, four different combinations are possible, that is 2n
combinations, where n is number of variables, so for two-variables combinations will be
X′Y′, X′Y, XY′, and XY.
o These product terms are called the fundamental products or standard products or minterms.
o In the minterm, a variable will possess the value 1 if it is in normal or uncomplemented form,
whereas, it contains the value 0 if it is in complemented form.
o For three variables function, eight minterms are possible as listed in the following table
X Y Z Minterms Designation
0 0 0 X′Y′Z′ m0
0 0 1 X′Y′Z m1
0 1 0 X′YZ′ m2
0 1 1 X′YZ m3
1 0 0 XY′Z′ m4
1 0 1 XY′Z m5
1 1 0 XYZ′ m6
1 1 1 XYZ m7

Maxterms:
o A maxterm is a sum of all the literals (with or without the bar) within the logic system.
o A sum term containing all n variables of the function in either normal or complemented form
is called the maxterm.
 o Each maxterm is obtained by an OR operation of the variables in their normal form or
complemented form.
o Four different combinations are possible for a two-variable function, such as, A′ + B′, A′ +
B, A + B′, and A + B.
o These sum terms are called the standard sums or maxterms.
o In the maxterm, a variable will possess the value 0, if it is in normal or uncomplemented
form, whereas, it contains the value 1, if it is in complemented form.
o For a three-variable function, eight maxterms are also possible as listed in the following
table
X Y Z Maxterms Designation
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

7. What do you mean by the duality of the Boolean algebra? Give an example.
Duality of the Boolean algebra means starting with a Boolean relation, another relation can be
derived by:
1. Changing each OR sign (+) to an AND sign (.)
2. Changing each AND sign (.) to an OR sign (+)
3. Replacing each 0 by 1 and each 1 by 0
The derived relation using duality principle is called dual of original expression.
For Example:
a. The dual of 0 + 0 = 0 is 1 . 1 = 1
b. The dual of 0 + 1 = 1 is 1 . 0 = 0
c. The dual of 1 + 0 = 1 is 0 . 1 = 0
d. The dual of 1 + 1 = 1 is 0 . 0 = 0
e. The dual of X+X.Y = X is X.(X+Y) = X
f. The dual of (X+Y).(X̅+Y̅).(Y+Z) is (X.Y)+(X̅.Y̅)+(Y.Z)

8. What do you mean by duality principle? Write the dual of F=(x+y)(x+y’)

Duality principle or Principle of Duality states that starting with a Boolean relation, another relation
can be derived by:
1. Changing each OR sign (+) to an AND sign (.)
2. Changing each AND sign (.) to an OR sign (+)
3. Replacing each 0 by 1 and each 1 by 0
The derived relation using duality principle is called dual of original expression.
For Example:
a. The dual of 0 + 0 = 0 is 1 . 1 = 1
b. The dual of 0 + 1 = 1 is 1 . 0 = 0
c. The dual of 1 + 0 = 1 is 0 . 1 = 0
d. The dual of 1 + 1 = 1 is 0 . 0 = 0
e. The dual of X+X.Y = X is X.(X+Y) = X
f. The dual of (X+Y).(X̅+Y̅).(Y+Z) is (X.Y)+(X̅.Y̅)+(Y.Z)

The dual of F=(x+y)(x+y’) is F = (x.y)+(x.y′)

9. Write the general structure of 2 variables K-Map.

10. Write the general structure of 3 variables K-Map.

11. Write the general structure of 4 variables K-Map.

12. Define Pair, QUAD, and OCTET in K-Map.

Pair: If 2 adjacent 1’s are encircled, it makes a pair
Quad: If 4 adjacent 1’s are encircled, it makes a quad
Octet: If 8 adjacent 1’s are encircled, it makes an octet

13. Draw the logic circuit for the following Boolean functions using basic gates
a. F (X, Y, Z) =XY+X’Z’
 b. F (X, Y, Z) =(X+Y)’

c. F(A, B, C)=𝐴 ′B+BC

d. F(X, Y, Z)=(𝑋 ′ + 𝑌) Z

e. F(A, B, C)=𝐴𝐵 ′ + 𝐴 ′C

14. Find the complement of Boolean expression F=(X+Y) (X+Y’+Z)

15. Find the complement of F1=x’yz’ + x’y’z

16. Find the complement of F2=x(y’z’ + yz)

17. Prove x + x’ y = x + y
x y x’ x’y x + x’y x+y
0 0 1 0 0 0
0 1 1 1 1 1
1 0 0 0 1 1
1 1 0 0 1 1

From the last two columns in the above table x + x’y = x + y is proved.

18. Simplify xy+x𝑦′

xy + xy’
=x(y + y’)
= x(1) according to complementarity law y + y’ = 1
=x

19. What do you mean by standard form? Give an example.

o The standard form of the Boolean function is when in this the terms that form the function may
contain one, two or any number of literals.
o There are two types of standard forms: the sum of products and product of sums.
o The sum of products is a Boolean expression containing AND terms called product terms, of
one or more literals each. The sum denotes the ORing of these terms.
An example is F1 = y’ + xy + x’yz’
 The expression has three product terms of one, two and three literals each, respectively. Their
sum is an OR operation.
o The product of sums is a Boolean expression containing OR terms, called sum terms, of one or
more literals each. The product denotes the ANDing of these terms.
An example is F2 = x (y’ + z) (x’ + y + z’ + w)
The expression has three sum terms of one, two and four literals each, respectively. Their
product is an AND operation.

20. What do you mean by canonical form? Give an example.

o The Boolean expression form composed entirely either of minterms or maxterms is referred to
as Canonical form.
o Canonical form can be represented in the following two forms: Sum of Products (SOP) and
Product of Sums (POS)
o Sum of Products (SOP) form:
• In SOP form, a Boolean expression is expressed as the logical sum (OR) of products (AND)
of literals or their complements or When a Boolean expression is represented purely as sum
of minterms, it is said to be canonical Sum of Products (SOP) form.
• Each term in the sum is a product term (minterm).
• Example: For a Boolean function F(A, B, C) = Σ(1, 3, 5, 7), the SOP form is
F(A,B,C)=A′B′C+A′BC+AB′C+ABC
o Product of Sums (POS) form:
• In POS form, a Boolean expression is expressed as the logical product (AND) of sums
(OR) of literals or their complements or When a Boolean expression is represented purely
as product of maxterms, it is said to be canonical Product of Sums (POS) form.
• Each term in the product is a sum term (maxterm).
• Example: For a Boolean function F(A, B, C) = Π(0, 2, 4, 6), the POS form is
F(A,B,C)=(A+B+C)(A+B′+C)(A′+B+C)(A′+B′+C)

Questions Carrying 3-6 or more Marks

1. Express the Boolean function F=XY’+X’Z as sum of minterms and product of maxterms.
Method 1: Algebraic Method
Sum of minterms
a. First convert the given expression in sum of minterms form.
b. In each term, if any variable is missing, multiply that term as (missing variable +
missingvariable).
c. Expand the expression
d. Remove all duplicate terms and we will have minterm form of an expression.

F = XY’ + X’Z
In the first term XY’, variable Z is missing so multiply (Z+Z’) to XY’ like XY’(Z+Z’). In the second
term X’Z, variable Y is missing so this will be written as X’Z(Y + Y’)

Let’s solve now:

Sum of minterms
F = XY’ + X’Z
= XY’(Z+Z’) + X’Z(Y+Y’) next follow the third step expand expression
= XY’Z + XY’Z’ + X’ZY + X’ZY’ rewrite last two terms in the alphabetical order
= XY’Z + XY’Z’ + X’YZ + X’Y’Z follow the next step – remove duplicates means writing
repeating terms once or follow X+X=X. No duplicates
in this problem
= 101 + 100 + 011 + 001 Binary equivalent of minterms
 = m5 + m4 + m 3 + m1 Minterm designations
= ∑ (1, 3, 4, 5)

Method 1: Algebraic Method

Product of maxterms
a. First convert the given expression in product of maxterms form.
b. Convert the expression into OR terms using the distributive law.
c. In each term, if any variable is missing, add that term as (missing variable . missingvariable).
d. Expand the expression
e. Remove all duplicate terms and we will have maxterm form of an expression.

Let’s solve now

Product of maxterms
F = XY’ + X’Z Use distributive law to express the terms as OR terms
We will use X + YZ = (X + Y) (X + Z)
X +Y Z In the expression we will consider X =XY’, Y=X’ and Z=Z
and substitute in the distributive law and get the following
= (XY’ + X’) (XY’ + Z) Again use the same distributive law and express.

(YZ + X) (YZ + X)

= (X’ + X)(X’ + Y’) (Z + X)(Z + Y’) Complementarity law X + X’ = 1 and arrange variables
in alphabetical order
=1
= (X’ + Y’) (1) (X + Z) (Y’ + Z)
= (X’ + Y’) (X + Z) (Y’ + Z) Now add missing variable to each OR term. Expand using
distributive law again. Let’s do it separately for each term.
(X’ + Y’) = (X’ + Y’ + ZZ’) = (X’ + Y’ + Z) (X’ + Y’ + Z’)

X + YZ

(X + Z) = (X + Z + YY’) = (X + Z + Y) (X + Z + Y’) = (X + Y + Z) (X + Y’ + Z)
(Y’ + Z) = (Y’ + Z + XX’) = (Y’ + Z + X) (Y’ + Z + X’) = (X + Y’ + Z) (X’ + Y’ + Z)

Combine all the final terms and remove duplicates.

= (X’ + Y’ + Z) (X’ + Y’ + Z’) (X + Y + Z) (X + Y’ + Z) (X + Y’ + Z) (X’ + Y’ + Z)
= (X’ + Y’ + Z) (X’ + Y’ + Z’) (X + Y + Z) (X + Y’ + Z)
= M6 . M7 . M0 . M2
= ∏ (0, 2, 6, 7)

Method 2: Using Truth Table

The function F=XY’+X’Z can be expressed as a truth table
X Y Z X’ Y’ XY’ X’Z F = XY’ + X’Z Minterms Desig Maxterms Desig
0 0 0 1 1 0 0 0 X′Y′Z′ m0 X+Y+Z M0
0 0 1 1 1 0 1 1 X′Y′Z m1 X+Y+Z′ M1
0 1 0 1 0 0 0 0 X′YZ′ m2 X+Y′+Z M2
0 1 1 1 0 0 1 1 X′YZ m3 X+Y′+Z′ M3
1 0 0 0 1 1 0 1 XY′Z′ m4 X′+Y+Z M4
1 0 1 0 1 1 0 1 XY′Z m5 X′+Y+Z′ M5
1 1 0 0 0 0 0 0 XYZ′ m6 X′+Y′+Z M6
1 1 1 0 0 0 0 0 XYZ m7 X′+Y′+Z′ M7
 Sum of Minterms:
A Boolean function is formed from the above truth table by taking minterms which produces a 1 in
the function.
F = XY’ + X’Z
= X’Y’Z +X’YZ + XY’Z’ + XY’Z
= m1 + m3 + m4 + m5
= ∑ (1, 3, 4, 5)

Product of Maxterms:
A Boolean function is formed from the above truth table by taking maxterms which produces a 0 in
the function.
F = XY’ + X’Z
= (X+Y+Z) (X+Y′+Z) (X′+Y′+Z) (X′+Y′+Z′)
= M0 . M2 . M6 . M7
= ∏ (0, 2, 6, 7)

2. Express the Boolean function F=WXY’+X’Y’Z as sum of minterms and product of maxterms.
Method 1: Algebraic Method
Sum of Minterms
F=WXY’+X’Y’Z
=WXY’(Z+Z’) + (W+W’)X’Y’Z
=WXY’Z + WXY’Z’ + WX’Y’Z + W’X’Y’Z
=1101 + 1100 + 1001 + 0001
= m13 + m12 + m9 + m1
= ∑ (1, 9, 12, 13)
Product of Maxterms
F = WXY’+X’Y’Z
Sum of Minterms
F = WXY’Z + WXY’Z’ + WX’Y’Z + W’X’Y’Z
Complement of F is F’ which is equal to remaining terms
F’ = W′X′Y′Z′ + W′X′YZ′ + W′X′YZ + W′XY′Z′ + W′XY′Z + W′XYZ′ + W′XYZ + WX′Y′Z′ +
WX′YZ′ + WX′YZ + WXYZ′ + WXYZ
Taking complement of F’ that is (F’)’ gives F which is the product of maxterms,
F = (W+X+Y+Z) (W+X+Y′+Z) (W+X+Y′+Z′) (W+X′+Y+Z) (W+X′+Y+Z′) (W+X′+Y′+Z)
(W+X′+Y′+Z′) (W′+X+Y+Z) (W′+X+Y′+Z) (W′+X+Y′+Z′) (W′+X′+Y′+Z) (W′+X′+Y′+Z′)
= M0 . M2 . M3 . M4 . M5 . M6 . M7 . M8 . M10 . M11 . M14 . M15
= ∏ (0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 14, 15)

Method 2: Using Truth Table

The function F=WXY’+X’Y’Z can be expressed as a truth table
W X Y Z X’ Y’ WXY’ X’Y’Z F=WXY’+X’Y’Z Minterms Desig Maxterms Desig
00 0 0 0 0 1 1 0 0 0 W′X′Y′Z′ m0 W+X+Y+Z M0
0 0 0 1 1 1 0 1 1 W′X′Y′Z m1 W+X+Y+Z′ M1
0 0 1 0 1 0 0 0 0 W′X′YZ′ m2 W+X+Y′+Z M2
0 0 1 1 1 0 0 0 0 W′X′YZ m3 W+X+Y′+Z′ M3
0 1 0 0 0 1 0 0 0 W′XY′Z′ m4 W+X′+Y+Z M4
0 1 0 1 0 1 0 0 0 W′XY′Z m5 W+X′+Y+Z′ M5
0 1 1 0 0 0 0 0 0 W′XYZ′ m6 W+X′+Y′+Z M6
0 1 1 1 0 0 0 0 0 W′XYZ m7 W+X′+Y′+Z′ M7
1 0 0 0 1 1 0 0 0 WX′Y′Z′ m8 W′+X+Y+Z M8
1 0 0 1 1 1 0 1 1 WX′Y′Z m9 W′+X+Y+Z′ M9
 1 0 1 0 1 0 0 0 0 WX′YZ′ m10 W′+X+Y′+Z M10
1 0 1 1 1 0 0 0 0 WX′YZ m11 W′+X+Y′+Z′ M11
1 1 0 0 0 1 1 0 1 WXY′Z′ m12 W′+X′+Y+Z M12
1 1 0 1 0 1 1 0 1 WXY′Z m13 W′+X′+Y+Z′ M13
1 1 1 0 0 0 0 0 0 WXYZ′ m14 W′+X′+Y′+Z M14
1 1 1 1 0 0 0 0 0 WXYZ m15 W′+X′+Y′+Z′ M15

Sum of Minterms:
A Boolean function is formed from the above truth table by taking minterms which produces a 1 in
the function.
F=WXY’+X’Y’Z
= W′X′Y′Z + WX′Y′Z + WXY′Z′ + WXY′Z
= m1 + m9 + m12 + m13
= ∑ (1, 9, 12, 13)

Product of Maxterms:
A Boolean function is formed from the above truth table by taking maxterms which produces a 0 in
the function.
F=WXY’+X’Y’Z
= (W+X+Y+Z) (W+X+Y′+Z) (W+X+Y′+Z′) (W+X′+Y+Z) (W+X′+Y+Z′) (W+X′+Y′+Z)
(W+X′+Y′+Z′) (W′+X+Y+Z) (W′+X+Y′+Z) (W′+X+Y′+Z′) (W′+X′+Y′+Z) (W′+X′+Y′+Z′)
= M0 . M2 . M3 . M4 . M5 . M6 . M7 . M8 . M10 . M11 . M14 . M15
= ∏ (0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 14, 15)

3. Using theorems and Postulates simplify F (A, B, C, D) =A’B(D’+C’D) +B(A+A’CD)

F (A, B, C, D) =A’B(D’+C’D) +B(A+A’CD)
Applying distributive law X(Y+Z) = XY+XZ expanding the terms.
=A’BD’ + A’BC’D + BA + BA’CD
Rearranging the literals and keeping terms with common literals together.
= A’BD’ + A’BC’D + A’BCD + AB
Applying distributive law XY + XZ = X(Y+Z) on second and third terms where X = A’BD, Y = C’
and Z = C, we can write the above expression as
= A’BD’ + A’BD(C’+C) + AB
Applying complementarity law C’+C = 1, we get
= A’BD’ + A’BD + AB
Again applying distributive law XY + XZ = X(Y+Z) on first and second terms
= A’B(D’ + D) + AB
Applying complementarity law D’ + D = 1, we get
= A’B + AB
Again applying distributive law XY + XZ = X(Y+Z), we get
= B(A’ + A)
Applying complementarity law A’ + A = 1, we get
=B

4. Using Boolean Theorems and postulates, prove the following:

a. x + x’y=x + y
LHS
x + x’y using x . 1 = x (property of 1), we get
= x . 1 + x’y using 1 + y = 1 (property of 1), we get
= x . (1 + y) + x’y using distributive law on first term x(y+z) = xy + xz, we get
= x + xy + x’y using distributive law on second and third term xy + xz = x(y+z), we get
= x + y.(x + x’) using complementarity law we get x + x’ =1, we get
 = x + y.(1) using y . 1 = y (property of 1), we get
=x+y
=RHS

b. x’y’z + x’yz + xy’=x’z + xy’

LHS
x’y’z + x’yz + xy’ using distributive law xy + xz = x(y+z) on first two terms, we get
= x’z.(y’ + y) + xy’ using complementarity law y’+y = 1 on first term, we get
= x’z.(1) + xy’ using x’z . 1 = x’z (x . 1 = x property of 1), we get
= x’z + xy’
=RHS

5. Using truth table, prove the following:

a. x + x’y=x + y

x y x’ x’y x + x’y x+y

0 0 1 0 0 0
0 1 1 1 1 1
1 0 0 0 1 1
1 1 0 0 1 1

From the last two columns in the above table x + x’y = x + y is proved.

b. x’y’z + x’yz + xy’=x’z + xy’

x y z x’ y’ x’y’z x’yz xy’ x’z x’y’z + x’yz + xy’ x’z + xy’

0 0 0 1 1 0 0 0 0 0 0
0 0 1 1 1 1 0 0 1 1 1
0 1 0 1 0 0 0 0 0 0 0
0 1 1 1 0 0 1 0 1 1 1
1 0 0 0 1 0 0 1 0 1 1
1 0 1 0 1 0 0 1 0 1 1
1 1 0 0 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 0 0 0

From the last two columns in the above table, x’y’z + x’yz + xy’=x’z + xy’ is proved.

6. Minimize the following Boolean expression using Boolean postulates and Theorems
F (A, B, C) =(A+B) (A+C)
(A + B) (A + C)
= AA + AC + BA + BC using theorem X . X = X, we can write A.A = A
= A + AC + BA + BC using absorption law X + XY = X, we can write A+AC = A
= A + BA + BC using absorption law again, we can write A+BA = A
= A + BC

7. Implement Boolean function F=x’y’z + x’yz + yz’ with basic gates and also write the truth table.
F=x’y’z + x’yz + yz’
Basic gate:
 Truth table:

x y z x’ y’ z’ x’y’z x’yz yz’ x’y’z + x’yz + yz’

0 0 0 1 1 1 0 0 0 0
0 0 1 1 1 0 1 0 0 1
0 1 0 1 0 1 0 0 1 1
0 1 1 1 0 0 0 1 0 1
1 0 0 0 1 1 0 0 0 0
1 0 1 0 1 0 0 0 0 0
1 1 0 0 0 1 0 0 1 1
1 1 1 0 0 0 0 0 0 0

8. Obtain the Truth Table of Boolean function and draw the logic diagram.
a. F= xy+x𝑦′+𝑦′z
Truth Table
x y z y’ xy xy’ y’z xy+x𝑦’+𝑦’z
0 0 0 1 0 0 0 0
0 0 1 1 0 0 1 1
0 1 0 0 0 0 0 0
0 1 1 0 0 0 0 0
1 0 0 1 0 1 0 1
1 0 1 1 0 1 1 1
1 1 0 0 1 0 0 1
1 1 1 0 1 0 0 1

Logic diagram

b. F= 𝑥𝑦 + 𝑥′𝑦′ + 𝑦′z
Truth Table
x y z x’ y’ xy x’y’ y’z xy+x’𝑦’+𝑦’z
0 0 0 1 1 0 1 0 1
0 0 1 1 1 0 1 1 1
 0 1 0 1 0 0 0 0 0
0 1 1 1 0 0 0 0 0
1 0 0 0 1 0 0 0 0
1 0 1 0 1 0 0 1 1
1 1 0 0 0 1 0 0 1
1 1 1 0 0 1 0 0 1

Logic diagram

9. Express the Boolean function, F(X,Y,Z)=XY+X’Z as sum of minterms and product of maxterms.
Sum of minterms:
F = XY + X’Z
= XY(Z+Z’) + X’Z(Y+Y’) next follow the third step expand expression
= XYZ + XYZ’ + X’ZY + X’ZY’ rewrite last two terms in the alphabetical order
= XYZ + XYZ’ + X’YZ + X’Y’Z follow the next step – remove duplicates means writing
repeating terms once or follow X+X=X. No duplicates
in this problem
= 111 + 110 + 011 + 001 Binary equivalent of minterms
= m7 + m6 + m 3 + m1 Minterm designations
= ∑ (1, 3, 6, 7)

Product of maxterms
F = XY + X’Z Use distributive law to express the terms as OR terms
We will use X + YZ = (X + Y) (X + Z)
X +Y Z In the expression we will consider X =XY, Y=X’ and Z=Z
and substitute in the distributive law and get the following
= (XY + X’) (XY + Z) Again use the same distributive law and express.

(YZ +X) (YZ +X)

= (X’ + X)(X’ + Y) (Z + X)(Z + Y) Complementarity law X + X’ = 1 and arrange variables

in alphabetical order
=1
= (X’ + Y) (1) (X + Z) (Y + Z)
= (X’ + Y) (X + Z) (Y + Z) Now add missing variable to each OR term. Expand using
distributive law again. Let’s do it separately for each term.
(X’ + Y) = (X’ + Y + ZZ’) = (X’ + Y + Z) (X’ + Y+ Z’)

X + YZ
 (X + Z) = (X + Z + YY’) = (X + Z + Y) (X + Z + Y’) = (X + Y + Z) (X + Y’ + Z)
(Y + Z) = (Y + Z + XX’) = (Y + Z + X) (Y + Z + X’) = (X + Y + Z) (X’ + Y + Z)

Combine all the final terms and remove duplicates.

= (X’ + Y + Z) (X’ + Y+ Z’) (X + Y + Z) (X + Y’ + Z) (X + Y + Z) (X’ + Y + Z)
= (X’ + Y + Z) (X’ + Y + Z’) (X + Y + Z) (X + Y’ + Z)
= M4 . M5 . M0 . M2
= ∏ (0, 2, 4, 5)

10. Implement the following Boolean function using gates and also write the truth table.
a. F= xyz’
Gates:

Truth table:
x y z z’ xyz’
0 0 0 1 0
0 0 1 0 0
0 1 0 1 0
0 1 1 0 0
1 0 0 1 0
1 0 1 0 0
1 1 0 1 1
1 1 1 0 0

b. F= xy’+ x’z
Gates:

Truth table:
x y z x’ y’ xy’ x’z x𝑦’+x’z
0 0 0 1 1 0 0 0
0 0 1 1 1 0 1 1
0 1 0 1 0 0 0 0
0 1 1 1 0 0 1 1
1 0 0 0 1 1 0 1
1 0 1 0 1 1 0 1
1 1 0 0 0 0 0 0
1 1 1 0 0 0 0 0
11. Express the Boolean function F(A,B,C)=A+B’C as sum of minterms and product of maxterms.
Sum of Minterms
F(A,B,C)=A+B’C
= A + B’C
A = A(B+B’) = (AB + AB’)(C+C’) = ABC + ABC’ + AB’C + AB’C’
B’C = B’C(A+A’) = AB’C + A’B’C
Combining all terms,
= ABC + ABC’ + AB’C + AB’C’ + AB’C + A’B’C
Removing duplicates,
F = ABC + ABC’ + AB’C + AB’C’ + A’B’C
= m7 + m6 + m5 + m4 + m1
F(A,B,C) = ∑ (1, 4, 5, 6, 7)

Product of Maxterms
F(A,B,C)=A+B’C
Sum of Minterms
F(A,B,C) = ∑ (1, 4, 5, 6, 7)
Complement of F is F’ which is equal to remaining terms
F’(A,B,C) = ∑ (0, 2, 3)
Taking complement of F’ that is (F’)’ gives F which is the product of maxterms,
F(A,B,C) = ∏ (0, 2, 3)

12. Minimize the Boolean expression F(x, y, z)=𝑥 ′𝑦 ′ 𝑧 + 𝑥 ′𝑦𝑧 + 𝑥𝑦 ′ and draw the logic diagram for
the minimized expression.
F(x, y, z)=x’y’z + x’yz + xy’
= x’y’z + x’yz + xy’
=x’z(y’ + y) + xy’
=x’z + xy’

F(x,y,z) = x’z + xy’

Logic diagram:
13. Solve the following using K-Maps and draw the logic diagram for minimized expression. Also draw
the logic diagram for the simplified Boolean expression.
a. F(A,B,C)= ∑(1,3,6,7)

b. F (A,B,C) = ∑ (0, 1, 2, 4, 5, 6 )
c. F(A,B,C)= ∑0, 2, 4, 6

d. F(A, B, C) = Σ(1, 2, 5, 7) + Σ(0, 4, 6)

e. F(A, B, C) = Σ(0, 1, 6, 7) + Σ(3, 4, 5)

f. F(P,Q,R,S)=∑(0,2,5,7,8,10,13,15)
g. F(A, B, C, D) = Σ(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)

h. F(A, B, C, D) = Σ(1, 3, 4, 6, 8, 9, 11, 13, 15) + Σd(0, 2, 14)

i. F(A, B, C, D) = Σ(0, 2, 8, 10, 14) + Σd(5, 15)

j. F(A, B, C, D) = Σ(3, 4, 5, 7, 9, 13, 14, 15)

k. F(W, X, Y, Z) = Σ(1, 3, 4, 6, 9, 11, 12, 14)

l. F (A, B, C, D) =∑ (0,3,4,7,8) + ∑d (10,11,12,13,14,15)

m. F(w,x,y,z)= ∑(4,5,6,8,9,12,13,14)

n. F(w,x,y,z)= ∑(8,9,10,11,12,13,14)
o. F (A, B, C, D) =∑ (0,1,4,8,9,10)

p. F (A, B, C, D) =∑ (0,1,3,4, 5,7,12, 13, 15)

14. What are universal gates? Prove that NAND is universal gate.
o Universal gate is a gate using which all the basic gates can be designed.
o NAND and NOR gates are called as Universal Gates, because all the basic gates AND, OR and
NOT can be implemented using NAND/NOR gates.
o NAND and NOR gates are more popular as these are less expensive and easier to design.

15. What are universal gates? Prove that NOR is universal gate.
o Universal gate is a gate using which all the basic gates can be designed.
o NAND and NOR gates are called as Universal Gates, because all the basic gates AND, OR and
NOT can be implemented using NAND/NOR gates.
o NAND and NOR gates are more popular as these are less expensive and easier to design.