T6 Boolean Algebra

Discrete Mathematics AAQS007-4-1 Boolean Algebra
1. Evaluate the Boolean functions below for the values given:

(a) F( x, y, z ) = x 'y + xyz ; x = 1, y = 1, z = 1; x = 0, y = 1, z = 0
(b) F( x, y, z ) = x ( yz + z ) ' ; x = 0, y = 0, z = 1; x = 1, y = 1, z = 0
2. Construct a truth table to express the values for each of the functions below:
(a) F( x, y ) = ( xy ) '+ y + x '
(b) F( x, y, z ) = z + x ( x + y ) '
(c) F( x, y, z ) = y ' ( xz + x ' z ')
3. Find the output of the circuits below:

(a)
(b)
(c)
4. Construct circuits for the outputs given below:

(
(a) x + y x )
(b) x y + z ( y + x )
(c) ( x + z )( y + z )
5. Simplify the expressions below using Algebra laws.

(a) A’B’C + A’BC + AB’
(b) A.B + A’B + A’.B’
(c) A.B.C’ + A’.B’.C + A’B.C + A.B.C
(d) A.B.C + A.B’.C’ + A’.B.C + A’B’.C
(e) (A’ + B)(A’(B + A))
(f) wx + w(xy + yz’)
Diploma Asia Pacific University of Technology & Innovation Page 1 of 4

6. Simplify 5(b), 5(c) and 5(d) using Karnaugh map.
7. Given a Boolean function as follows. Obtain the truth table of the function. Find the
minterm and maxterm expression of the function.
F = xy’ + y’z + xz
8. From the truth table, obtain the minterm expression for X1 and X2. Use K-map to
simplify the minterm expression.
X Y Z X1 X2
0 0 0 0 1
0 0 1 1 1
0 1 0 0 1
0 1 1 1 1
1 0 0 1 1
1 0 1 0 1
1 1 0 1 0
1 1 1 1 0
9. Given a truth table of variables X, Y and Z for the function F(X, Y, Z).
X Y Z F(X, Y, Z)
1 1 1 1
1 1 0 1
1 0 1 0
1 0 0 1
0 1 1 1
0 1 0 0
0 0 1 0
0 0 0 0
(a) Obtain the Boolean expression for F(x, y, z) in minterm and maxterm.
(b) Simplify the minterm expression.
(c) Draw the logic circuit for the simplified expressions in part (b).
10. In a singing contest, 3 judges A, B and C can register their votes as ‘1’ or ‘0’ through
switches allocated to them. Contestants will be disqualified if two or more judges
register ‘0’ votes for them.
(a) Construct a truth table for the above.
(b) Obtain a simplified Boolean expression for the output ‘qualified’.
(c) Construct a logic circuit for the simplified ‘qualified’ output.
Answers:
1. (a) 1, 1 (b) 0, 1
3. (a) (x’y’)’ (b) (x’yz)’(x’+y+z’) (c) [(a+b)’+c’]’
5. (a) A’C + AB’ (b) B + A’ (c) AB + A’C (d) A’C + BC + AB’C’
(e) A’B (f) wx + wyz’
7. 0, 1, 0, 0, 1, 1, 0, 1
Minterm expression = x’y’z+xy’z’+xy’z+xyz

Maxterm expression = (x+y+z)(x+y’+z)(x+y’+z’)(x’+y’+z)

8. X1: Minterm expression = X’Y’Z + X’YZ + XY’Z’ +XYZ’ + XYZ
Simplified minterm expression = X’Z + XZ’ + XY or X’Z + XZ’ + YZ
X2: Minterm expression = XY’Z + XY’Z’ + X’YZ + X’YZ’ + X’Y’Z + X’Y’Z’
Simplified minterm expression = X’ + Y’
9. (a) Minterm expression = XYZ + XYZ’ + XY’Z’ + X’YZ
Maxterm expression = (X’ + Y + Z’)(X + Y’ + Z)(X + Y + Z’)(X + Y + Z)
(b) Simplified minterm expression = YZ + XZ’
Simplified maxterm expression = (Y + Z’)(X + Z)
10. (a) 0, 0, 0, 1, 0, 1, 1, 1
(b) BC + AC + AB
(c) Simplified ‘disqualified’ output = (B + C)(A + B)(A + C)
Additional Questions:
1. Obtain the simplified Boolean function from the Karnaugh map below. Show all of
your working.
CD
AB 00 01 11 10
00 1 1
01 1 1
11 1 1
10 1
2. Given a truth table of a Boolean Function F(x, y, z) as follows.

x y z F
1 1 1 1
1 1 0 0
1 0 1 1
1 0 0 0
0 1 1 1
0 1 0 1
0 0 1 1
0 0 0 1
(a) From the truth table above, obtain the minterm and maxterm expressions of F.
(b) Simplify the minterm expression in (i) as far as you can.
(c) Draw the logic circuit for the simplified expression for F.
3. Use Karnaugh Map to minimise the sum-of-products expansion below.

ABC + ABC’ + A’BC + A’BC’ + A’B’C’
4. Simplify the sum-of-products expansion below.

A’B’CD + A’BCD’ + A’B’CD’ + ABC’D’ + ABC’D + AB’C’D’ + AB’C’D

Answers of Additional Questions:
1.
CD
AB 00 01 11 10
00 1 1
01 1 1
11 1 1
10 1
Simplified Boolean function = A’B’C + B’CD + BD’

2. (a) Minterm = xyz + xy’z + x’yz + x’yz’ + x’y’z + x’y’z’
Maxterm = (x’ + y’ + z) (x’ + y + z)
(b) x’ + z
(c)
x x'
x’ + z
z
3. (a) B + A’C’ (b) (B’ + C’)(A’)

4. AC’ + A’B’C + A’CD’

T6 Boolean Algebra

Uploaded by

Copyright:

Available Formats

T6 Boolean Algebra

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

T6 Boolean Algebra

Uploaded by

Copyright:

Available Formats

Discrete Mathematics AAQS007-4-1 Boolean Algebra

1. Evaluate the Boolean functions below for the values given:

3. Find the output of the circuits below:

4. Construct circuits for the outputs given below:

5. Simplify the expressions below using Algebra laws.

Diploma Asia Pacific University of Technology & Innovation Page 1 of 4

6. Simplify 5(b), 5(c) and 5(d) using Karnaugh map.

Diploma Asia Pacific University of Technology & Innovation Page 2 of 4

Maxterm expression = (x+y+z)(x+y’+z)(x+y’+z’)(x’+y’+z)

2. Given a truth table of a Boolean Function F(x, y, z) as follows.

3. Use Karnaugh Map to minimise the sum-of-products expansion below.

4. Simplify the sum-of-products expansion below.

Diploma Asia Pacific University of Technology & Innovation Page 3 of 4

Answers of Additional Questions:

Simplified Boolean function = A’B’C + B’CD + BD’

3. (a) B + A’C’ (b) (B’ + C’)(A’)

Diploma Asia Pacific University of Technology & Innovation Page 4 of 4

You might also like