Scribd
Upload
118 views

Boolean Algebra and Simplification of Boolean Expressions - I

This document contains instructions and examples for 6 tasks involving simplifying Boolean expressions and filling in truth tables. Task 1 provides a circuit diagram and asks students to find the Boolean expressions for outputs X and Y, which both give a high output only when both inputs are high. Task 2 provides another circuit and has the same objective. Task 3 provides a Boolean expression and asks students to simplify it using logic rules and verify with a truth table. Task 4 provides another expression to simplify. Tasks 5 and 6 provide additional expressions for students to simplify using a logic converter tool.

Uploaded by

Salam Shaikh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
118 views

Boolean Algebra and Simplification of Boolean Expressions - I

This document contains instructions and examples for 6 tasks involving simplifying Boolean expressions and filling in truth tables. Task 1 provides a circuit diagram and asks students to find the Boolean expressions for outputs X and Y, which both give a high output only when both inputs are high. Task 2 provides another circuit and has the same objective. Task 3 provides a Boolean expression and asks students to simplify it using logic rules and verify with a truth table. Task 4 provides another expression to simplify. Tasks 5 and 6 provide additional expressions for students to simplify using a logic converter tool.

Uploaded by

Salam Shaikh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Lab#4

Boolean algebra and Simplification of Boolean expressions - I

Task 1: Circuit analysis


Find the Boolean expression that represents the outputs x and y shown in the following circuit.
According to the circuit above find the equation of X and Y, then fill the truth table.

X= A.B
Y = (A’+B’)’
A B X Y

0 0 0 0

0 1 0 0

1 0 0 0

1 1 1 1

What do you notice?


Both X and Y perform the same logic and gives high (1) output only for when the both input is high.

Logic Design & Switching Theory


Task 2: Circuit analysis
Find the Boolean expression that represents the outputs x and y shown in the following circuit.
According to the circuit above find the equation for X and Y, then fill the truth table.

X= A+B
Y= (A’. B’)’

A B X Y

0 0 0 0

0 1 1 1

1 0 1 1

1 1 1 1

What do you notice?


Both X and Y perform the same logic and gives high (1) output if any input is high (1).

Logic Design & Switching Theory


Task 3: Simplifying Boolean functions
F (A, B) = (A. B) + A’ (A+B)
Draw the simplified and the original Boolean expression using EWB and make sure that they are
both equivalent by filling-in the following truth table.

ORIGINAL:
F (A, B) = (A. B) + A’ (A+B)

SIMPLIFIED:
F (A, B) = (A. B) + A’ (A+B)
= A.B + A’A+A’B (Distributive law)
= A.B+ 0 +A’B (Rule: 08 A’A=0)
= A.B + A’B (Rule: 01 drop 0)
=B (A+A’) (Rule: 08 A+A’=1)
=B

A B F(A, B) (original) Y(Simplified)


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

Logic Design & Switching Theory


Task 4: Simplifying Boolean functions
Draw the simplified Boolean expression using EWB. Find out the truth table of the circuit.
F (A, B, C) = (A+C’) + C (C.A’ + (B.A) +C
= (A+C’) + CC.A’ + ABC + C (Distributive law)
= (A+C’) +CA’ + ABC + C (Rule 7 C.C=C)
= A + A’C +ABC +1 (Rule 6 C+C’=1)
= A’C + ABC + 1 (Rule 2 A + 1 = 1)
=1

Task 5: Simplifying Boolean functions in EWB using the logic converter


F (A, B, C) = AB'C (BD + CD) + AC'

Logic Design & Switching Theory


Task 6: Simplifying Boolean functions in EWB using the logic converter
F (A, B, C) = AB'C'+ A'B'C'+ A'BC'+ A'B'C

Logic Design & Switching Theory

You might also like