PROGRAM TITLE: BTEC in COMPUTING( SOFTWARE ENGINEERING)

UNIT TITLE: Discrete Maths

ASSIGNMENT NUMBER: 2

ASSIGNMENT NAME: …………………………………….

SUBMISSION DATE: 21/09/2022

DATE RECEIVED: …………………………………………….

TUTORIAL LECTURER: Lưu Thị Hương Giang

WORD COUNT: 850

STUDENT NAME: Ha Minh Chi

STUDENT ID: BKC12327

MOBILE NUMBER: 0368471986

Summative Feedback:

Internal verification:
Content
Part 1:

In reality, a computer executes and displays the outcomes using a binary digit system, which uses the
digits 0 and 1. All other number systems, such as decimal, hexadecimal, and so forth, are merely the
result of conversion from binary digits systems for convenience, ease of life, and reduced space
requirements.

The binary number system used the digits 0 and 1 as its units. A 0 in a digital circuit denotes a circuit
switch-off key and consequently a state, while a 1 denotes a circuit switch-on key and consequently a
state. Truth tables and Boolean expressions can be used to solve difficulties involving digital circuits.
Examples include different digital network applications that use IC circuitry.

In electronic digital circuits and decision-making mathematics, boolean algebra and logic gates are
frequently employed.

Part 2:

1. Develop truth tables and its corresponding Boolean equation for the following scenarios.
a.''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.''
- Set:
 Driver present=>A
 Buckled up=>B
 Ignition switch is on=>C
 Result=>Warning light on
- The truth tables are as follows:

A B C Result

T T T F

T T F F

T F T T

T F F F

F T T F
 F T F F

F F T F

F F F F

- Boolean equation=A . B´. C

b. You will get wet if it rains and you don't open your umbrella.

- Set:
 Rains=>R
 Open umbrella=>U
 Result=>Getting wet
- The truth tables are as follows:

R U Result

T T F

T F T

F T F

F F F

- Boolean equation=R . U
2. Produce truth tables for given Boolean expressions
i. A¯ B¯ C+A B¯ C¯+ ABC+ ¯A BC¯

- The truth tables are as follows:

A B C Result

T T T T

T T F F
 T F T F

T F F T

F T T F

F T F T

F F T T

F F F F

ii. ( A+¯B+C)( A+B+C)( A¯ +B+C¯ )

- The truth tables are as follows:

A B C Result

T T T T

T T F T

T F T F

T F F T

F T T T

F T F F

F F T T

F F F F

Part 3:

Using algebraic techniques, determine the Boolean expressions' simplest form.

i. A( A+B)+B( B+C)+C(C+A ) (Distributive laws)

= AA+AB+BB+BC+CC+CA (Idempotent)

= A+AB+B+BC+C+CA

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

= A.1+B.1+C.1 (Identity laws)

= A+B+C

ii. ( A+¯B)( B+C)+( A+B)(C+ ¯A)

= A ( B + C) + ¯B (B+C) + A (C+ ¯A) + B(C+ ¯A) (Distributive laws)

= AB + AC + ¯BB +¯BC+ AC + A¯A +BC + B¯A (Complement law)

= AB + 2AC + ¯BC + BC + B¯A

= B(A+ ¯A )+ C( B+B´ )+ AC (Complement law)

= B.1+C.1+AC

=B+C+AC

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

= B+C

iii. ( A+B)( AC+ AC¯ )+AB+B

= A (AC+ AC¯) + B( AC + AC¯ ) + AB + B (Distributive laws)

= AAC+ AAC¯+ ABC+ BAC¯+ AB +B (Idempotent)

= AC+ AC¯+ABC+ BAC¯ + AB+B

= A(C+ C¯ )+B(AC+ AC¯+ A+1) (Complement law) (Bound laws)

= A.1+B.1 (Identity laws)

=A+B

iv. A¯ ( A+B)+(B+ A)( A+B¯ )

= A¯A + A¯B + B(A+ B¯) + A(A+ B¯) (Distributive laws) (Idempotent)

= A¯B + BA + B B¯ + AA + A B¯ (Idempotent) (Complement laws)

= B(A¯+ A)+ A(1+ B¯) (Complement laws) (Bound laws)

 = B.1+A.1 (Identity laws)

=B+A

Part 4:

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

i. Create a Boolean expression in the proper standard form (SOP/POS).
a. SOP

AB C 0 1

00 0 0

01 0 1

11 0 1

10 1 0

Answer = BC + AB¯ C¯

POS

AB C 0 1

00 0 0

01 0 1

11 0 1

10 1 0

Answer = (C¯+A¯). ( A¯+B¯)(A+B+ C¯)( A+B¯+C)

b. SOP

AB CD 00 01 11 10

00 1 0 0 1
 01 0 1 0 1

11 1 1 1 0

10 1 1 1 1

Answer = A¯B¯C¯D¯ + A¯BC¯D + AC¯ + AD + A¯CD¯ + AB¯

= A¯B¯C¯D¯ + AC¯ + AB¯ + D

POS

AB CD 00 01 11 10

00 1 0 0 1

01 0 1 0 1

11 1 1 1 0

10 1 1 1 1

Answer = (A¯ +B¯ +D)(A¯+C+D)(A¯+B+C¯+D¯)(A+B+C+D¯)

c. SOP

AB C 0 1

00 1 0

01 1 1

11 1 0

10 0 1

Answer = A¯C¯ + A¯B + ABC¯ + AB¯C = ABC¯ + AB¯ + C

POS

AB C 0 1
00 1 0

01 1 1

11 1 0

10 0 1

Answer = ( A+B+C)( A+B¯ +C¯ )( A¯ +B¯ +C)