Scribd
Upload
3 views1 page

Boolean Expression Assignment (2)

The document outlines the process of deriving a Boolean expression from a given circuit with inputs P and Q, involving three AND gates, three NOT gates, and one OR gate. The final simplified Boolean expression is F = Q + (P · Q'). A truth table is also provided to illustrate the output for all combinations of inputs P and Q.

Uploaded by

japanmobiles601
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Boolean Expression Assignment (2)

The document outlines the process of deriving a Boolean expression from a given circuit with inputs P and Q, involving three AND gates, three NOT gates, and one OR gate. The final simplified Boolean expression is F = Q + (P · Q'). A truth table is also provided to illustrate the output for all combinations of inputs P and Q.

Uploaded by

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

Assignment: Boolean Expression and Truth Table

Question:
Find the Boolean expression for the given circuit and draw the input/output (truth) table.

Observation:
From the given circuit, we can see that there are three AND gates, three NOT gates, and one OR gate.
The inputs are P and Q.

The first AND gate takes inputs directly from P and Q.


The second AND gate takes input from (NOT P) and Q.
The third AND gate takes input from P and (NOT Q).
Finally, the outputs of these three AND gates are connected to one OR gate.

Step 1: Writing the Boolean Expression


Let’s write the Boolean expressions for each AND gate:

AND■ = P · Q
AND■ = P' · Q
AND■ = P · Q'

The output of the OR gate will be the sum of all these AND gate outputs.

Therefore, the final Boolean expression is:


F = (P2:· Simplification
Step Q) + (P' · Q) + (P · Q')
F = (P · Q) + (P' · Q) + (P · Q')
Now
Groupwethecan simplify
terms this expression
that contain Q: if possible.
F = Q(P + P') + (P · Q')

Since (P + P') = 1, we get:


F = Q + (P · Q')

This is the simplified Boolean expression.


Step 3: Truth Table

P Q NOT P NOT Q P·Q P'·Q P·Q'F = Q + (P·Q')


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

Conclusion:
The final simplified Boolean expression is F = Q + (P · Q').

You might also like