Scribd
Upload
43 views4 pages

Lecture Notes - Combinational Circuits Examples

The document provides examples of obtaining the Boolean expression and truth table for various combinational logic circuits. It gives the circuit diagram, shows the steps to derive the Boolean expression, and provides the resulting truth table for each example circuit.

Uploaded by

barstowcollege2012
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
43 views4 pages

Lecture Notes - Combinational Circuits Examples

The document provides examples of obtaining the Boolean expression and truth table for various combinational logic circuits. It gives the circuit diagram, shows the steps to derive the Boolean expression, and provides the resulting truth table for each example circuit.

Uploaded by

barstowcollege2012
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
You are on page 1/ 4

Combinational Circuits (or Digital Circuits):

Example: For the circuit below, obtain it’s:

a. Boolean Expression.
b. Truth Table

A'
A' B

A' B + A B'
B

A B'
B'

Solution:

a.

A' B + A B'

b.

A B F
0 0 0
0 1 1
1 0 1
1 1 0

Example: For the circuit below, obtain it’s:

a. Boolean Expression.
b. Truth Table
P
P

P P' P + (P' + Q)

Q P' + Q

Solution:

a.

Y = P + (P' + Q) = P + P' + Q = 1 + Q = 1 Notes: P + P' = 1


1+Q = 1
Y=1
b.

P Q Y
0 0 1
0 1 1
1 0 1
1 1 1

Example: For the circuit below, obtain it’s:

a. Boolean Expression.
b. Truth Table
Z
YZ
Y

Y'
YZ (X + Y')

X X + Y'

Solution:

a.
F = YZ (X + Y')

b.
It's better if we simplify the function in part a to express the function in a simpler form so that the Truth Table can be
obtained easily.

F = YZ (X + Y') = XYZ + Y Y' Z = XYZ + 0 = XYZ Note: Y Y' = 0

A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
Example: For the circuit below, obtain it’s:

a. Boolean Expression.
b. Truth Table
AB

AB + C'

C'

D
( (AB + C') D)'
Solution: (AB + C') D

a.
X = ( (AB + C') D)'
X = (ABD + CD')'
b.

A B C D X
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 0
1 1 1 0 1
1 1 1 1 0

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy