PROGRAM TITLE: …Discrete Math…………………………………………

UNIT TITLE: …………………Discrete Math………………………………….

ASSIGNMENT NUMBER: ………………3…………………

ASSIGNMENT NAME: ………Boolean algebra…………………………….

SUBMISSION DATE: ……………………………………….

DATE RECEIVED: ……October 29 2021……………………………………….

TUTORIAL LECTURER: ……………………………………

WORD COUNT: ……………………………………………..

STUDENT NAME: …Nguyễn Quốc An……………………………………………

STUDENT ID: ……BKC18348……………………………………………….

MOBILE NUMBER: …0795179677…………………………………………

Summative Feedback:

Internal verification:
 Assignment 3: Boolean Algebra

LO3: Investigate solutions to problem situations using the application of Boolean algebra

Part 1: Discuss two real world binary problems in two different fields using applications of Boolean
algebra.

=> Problem 1: Three-way devices are used in industry to control the moisture or gas in one direction or
the other. Such valves feature a switch and a multiple actuators (left and right). When activated, limit
switches generate a 1 on their output. Because the two limit devices could never be initiated around the
same time, the computer program logic of these devices is made to enter an XOR, which would not
enable output 1 for input 11. As a result, the issue has been resolved.

=> Problem 2: Truth tables are being used in traffic enforcement to establish Boolean logic functions
(which would be encoded) that require handling the various input environments (the roads), evaluating
the outcomes (traffic signals), and keeping the structure under control.

Part 2:

1, Develop truth tables and its corresponding Boolean equation for the following scenarios.

 ''If the driver is present AND the driver has NOT buckled up AND the ignition switch is on, then
the warning light should turn ON.''

=> Assume, the Boolean expression for this application can be written as:

If the driver is present = D, the driver has NOT buckled = B’, the ignition switch is on = I,

warning light should turn ON = W. And D. B’. I -> W

D B I W D. B’. I D. B’. I -> W

0 0 0 0 0 1
0 0 0 1 0 1
0 0 1 0 0 1
0 0 1 1 0 1
0 1 0 0 0 1
0 1 0 1 0 1
0 1 1 0 0 1
0 1 1 1 0 1
1 0 0 0 0 1
1 0 0 1 0 1
1 0 1 0 1 0
1 0 1 1 1 1
1 1 0 0 0 1
1 1 0 1 0 1
1 1 1 0 0 1
1 1 1 1 0 1
  If it rains and you don't open your umbrella then you will get wet.

=> Assume, rains = R, umbrella Open = U, Wet = W and R.U’ -> W

R U W (R. U’) (R. U’) -> W

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

2, Produce truth tables for given Boolean expressions.

 A̅ B̅ C + A B̅ C̅ + ABC + A̅ B C̅

=> Assume, W = A̅ B̅ C, X = A B̅ C, Y = ABC, Z = A̅ B C̅

A B C W X Y Z W + X + Y+Z
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 1
0 1 0 0 0 0 1 1
0 1 1 0 0 0 0 0
1 0 0 0 1 0 0 1
1 0 1 0 0 0 0 0
1 1 0 0 0 0 0 0
1 1 1 0 0 1 0 1
  (A + B̅ + C)(A + B + C)(A̅ + B + C̅)

=> Assume, X = A + B̅ + C, Y = A + B + C, Z = A̅ + B + C̅

A B C X Y Z XYZ
0 0 0 1 0 1 0
0 0 1 1 1 1 1

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

Part 3: Find the simplest form of given Boolean expressions using algebraic methods.

1, A(A+B) + B(B+C) + C(C+A)

= A + AB + B + BC + C + AC

= A(B + 1) + B(C + 1) + C(A + 1)

=A+B+C

2, (A + B̅)(B + C) + (A + B)(C + A̅)

= AB + AC + BB̅ + B̅C + AC + AA̅ + BC + BA̅

= AB + AC + B̅C + AC + BC + BA̅

= AB + AC + B̅C + BC + BA̅

= AB + AC + C(B̅ + B) + BA̅

= B(A + A̅) + AC + C

= B + AC + C

= B + C(A + 1)

=B+C

3, (A + B)(AC + AC̄) + AB + B

= AC + AC̅ + ABC + ABC̅ + AB + B

= AC + AC̅ + ABC + ABC̅ + A(B + 1)

= AC + AC̅ + ABC + ABC̅ + A

= AC + AC̅ + AB(C + C̅) + A

= AC + AC̅ + AB + A

= AC + AC̅ + A(B + 1)

= AC + AC̅ + A

= A(C + C̅) + A

=A+A=A

4, A̅(A + B) + (B +A)(A + B̅)

= BA̅ + AB + A + AB̅

= B(A̅ + A) + A(B̅ + 1)

= A̅B + A
Part 4:

1, Consider the K-Maps given. For each K-Map.

AB/C 0 1
00 0 0
01 0 1
11 0 1
10 1 0

 SOP = A’BC + ABC + AB’C’

POS = (A’B’ + C)(A’B’ + C)(A’B’ + C’)(AB + C’)(AB’ + C)

(A’B’ + C’) = (A’ + C’)(B’ + C’) = (A’ + C’ + B’)(A’ + C’ + B) * (B’ + C’ + A’)(B’ + C’ + A) =

(A’ + C’ + B’)(A’ + C’ + B)(B’ + C’ + A)

(A’B’ + C) = (A’ + C)(B’ + C) = (A’ + C + B)(A’ + C + B’) * (B’ + C + A)(B’ + C + A’) =

(A’ + C + B)(A’ + C + B’)(B’ + C + A)

(A’B + C’) = (A’ + C’)(B + C’) = (A’ + C’ + B)(A’ + C’ + B’) * (B + C’ + A)(B + C’ + A’) =

(A’ + C’ + B)(A’ + C’ + B’)(B + C’ + A)

(AB + C’) = (A + C’)(B + C’) = (A + C’ + B)(A + C’ + B’) * (B + C’ + A)(B + C’ + A’) =

(A + C’ + B)(A + C’ + B’)(B + C’ + A’)

(AB’ + C) = (A + C)(B’ + C) = (A + C + B)(A + C + B’) * (B’ + C + A)(B’ + C + A’) =

(A + C + B’)(A + C + B’)(B’ + C + A’)

Standard form:

POS = (A’ + C’ + B’)(A’ + C’ + B)(B’ + C’ + A)(A’ + C + B)(A’ + C + B’) * (B’ + C + A)(B + C’ + A)

AB/CD 00 01 11 00
00 1 0 0 1
01 0 1 0 1
11 1 1 1 0
10 1 1 1 1

SOP = A’B’C’D’ + A’B’CD’ + A’BC’D + A’BCD’ + ABC’D’ + ABC’D + ABCD + AB’C’D’ +

AB’C’D + AB’CD + AB’CD’

POS = (A’B’ + C’D)(A’B’ + CD)(A’B + C’D’)(A’B + CD)(AB + CD’)