Scribd
Upload
44 views

Problem Set 3 Solutions: Jon Turner Quiz On

The document contains solutions to a problem set for a digital computers course. It includes: 1) Using DeMorgan's theorem to express logic functions in AND/complement and OR/complement forms. 2) Finding complements of logic expressions. 3) Listing all minterms for logic expressions. 4) Deriving dual equations of logic expressions. 5) Drawing logic diagrams for expressions and their simplified forms. 6) Simplifying expressions using a general procedure and Karnaugh maps.

Uploaded by

archana bhandare
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
44 views

Problem Set 3 Solutions: Jon Turner Quiz On

The document contains solutions to a problem set for a digital computers course. It includes: 1) Using DeMorgan's theorem to express logic functions in AND/complement and OR/complement forms. 2) Finding complements of logic expressions. 3) Listing all minterms for logic expressions. 4) Deriving dual equations of logic expressions. 5) Drawing logic diagrams for expressions and their simplified forms. 6) Simplifying expressions using a general procedure and Karnaugh maps.

Uploaded by

archana bhandare
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

CS/EE 260 – Digital Computers: Organization and Logical Design

Problem Set 3 Solutions


Jon Turner Quiz on 1/31/02

1. Using DeMorgan’s theorem, express the function F = A′B + A′B′C + BC ′ using (a) only AND
and complement operations and (b) only OR and complement operations.

(a) A′B + A′B′C + BC ′ = ((A′B + A′B′C + BC ′ ) ′) ′ = ((A′B) ′(A′B′C) ′(BC ′ ) ′) ′


(b) A′B + A′B′C + BC ′ = ((A′B) ′) ′ + ((A′B′C) ′) ′ + ((BC ′ ) ′) ′ = (A+B′) ′ + (A+B+C ′) ′+ (B ′+C)

2. Find complements for the following expressions.


(a) (A + B)C ′ + B ′D ((A + B)C ′ + B ′D) ′ = (A′B′+C )(B+D′)
(b) AB ′D + BCD ′ + A ′C (AB ′D+BCD ′+A ′C) ′= (A ′+B+D ′)(B ′+C ′+D)(A+C ′)
(c) (A ′ + B + C ′D)(B ′ + D) ((A ′+B+C ′D)(B ′+D))′ = AB′(C+D′) + BD ′
(d) A ′C + (B ′D + C)(A ′ + D) (A ′C+(B ′D+C)(A ′+D)) ′ = (A+C ′)((B + D′)C′ + AD ′)

3. For each expression, list all of its minterms.


(a) (A + B)C ′ A ′BC ′, AB ′C ′, ABC ′ (or 2,4,6)
(b) AB ′ + BC ′ + A ′C A ′B ′C, A ′B C ′, A ′BC, AB ′C ′, AB ′C, AB C ′ (or 1,2,3,4,5,6)
(c) A ′C + (B ′ + C) A ′B ′C ′, A ′B ′C, A ′B C , AB ′C ′, AB ′C, ABC (or 0,1,3,4,5,7)
(d) (A ′ + AB + C ′)(B ′ + C) A ′B ′C ′, A ′B ′C, A ′B C, AB ′C ′, ABC (or 0,1,3,4,7)

4. For each equation below, derive the dual equation.


(a) A′B ′ + A′B + AB = A′ + B (A′+B′)(A′+B)(A+B) = A′B
(b) B + A′C + AB ′ = A + B + C B(A′+C)(A+B′) = A BC
(c) A′B ′ + B ′C + AC + AB + BC ′ = A′B ′ + AC + BC ′
(A′+B ′)(B ′+C)(A+C)(A+B)(B+C ′) = (A′+B ′)(A+C)(B+C ′)

-1-
5. For each expression shown below, draw a logic diagram using simple gates that
implements the circuit directly. Then simplify the expression algebraically to use the
smallest possible number of binary logic operations and draw a logic diagram
corresponding to the simplified expression.

(a) A′B ′ + B′C + ABC


(b) B + A′C + AB ′
(c) A′B + A(B + C ′)

A B C A B C

(a) A′B′ + B′C + ABC = A′B′ + A′B′C + AB′C + ABC = A′B′ + AC

A
B
C

A B C

(b) B + A′C + AB′ = AB + B + A′C + AB′ = A + B + C

B
A
C

A B C
(c) A′B + A(B + C′) = (A′B + AB) + AC′) = B + AC′

-2-
6. For each expression below, simplify it using the general simplification procedure described
on page 2-29 of the course notes. Show all the steps.
(a) A(B + B ′C) + (A ′B + B ′)C ′
Step 1. Find minterms: A ′B ′C ′, A ′BC ′, AB ′C ′, AB ′C, ABC ′, ABC
Step 2. Find largest covering terms (prime implicants) for each minterm:
minterms AB ′C ′, AB ′C, ABC ′, ABC are all covered by A
minterms A ′B ′C ′, A ′BC ′, AB ′C ′, ABC ′ are all covered by C ′
Step 3. Include essentential prime implicants: A, C ′
Step 4. Add other prime implicants as necessary: none need to be added
So, the simplified expression is A+C ′

(b) A ′B + BC + (A + C ′)B
Step 1. Find minterms: A ′BC ′, A ′BC, ABC ′, ABC
Step 2. Find largest covering terms (prime implicants) for each minterm:
minterms A ′BC ′, A ′BC, ABC ′, ABC are all covered by B
Step 3. Include essentential prime implicants: B
Step 4. Add other prime implicants as necessary: none need to be added
So, the simplified expression is B

-3-
7. (8 points) For each function given below, simplify it using a 3 variable Karnaugh map.
(a) F(A,B,C) = Σm(2,3,5,6,7)
(b) F(A,B,C) = Σm(0,1,4,5,7)
(c) F(W,X,Y) = Σm(1,2,4,5,6)
(d) F(A,B,C) = Σm(0,2,3,4,6)

BC
00 01 11 10
(a) F(A,B,C) = Σm(2,3,5,6,7) 0 0 0 1 1
= AC + B A
1 0 1 1 1

BC
00 01 11 10
(b) F(A,B,C) = Σm(0,1,4,5,7) 0 1 1 0 0
= AC + B′ A
1 1 1 1 0

XY
00 01 11 10
(c) F(W,X,Y ) = Σm(1,2,4,5,6) 0 0 1 0 1
= WX′ +X′Y+XY′ W
1 1 1 0 1

BC
00 01 11 10
(c) F(A,B,C) = Σm(0,2,3,4,6) 0 1 0 1 1
= A′B + C′ A
1 1 0 0 1

-4-

You might also like