{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# HW5aDigDesign - d Using a K-Map minimize the equation e...

This preview shows page 1. Sign up to view the full content.

HW 5 Due Wednesday, May 19th, at lab. If you have a conflict with lab, turn it into class on Tuesday or send it with a friend to lab. 1) Use DeMorgan's law to compute the complement of the following Boolean expressions: a) A(B+CD) b) ABC + B(!C+!D) c) !X + !Y d) X + Y!Z e) X(Y + Z!W + !VS) 2)Simplification For each problem, a) Draw the circuit using AND, OR, and NOT gates b) Determine the truth table c) Using boolean algebra, minimize the equation, showing each step
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: d) Using a K-Map, minimize the equation e) Draw the resulting circuit f(A,B,C,D) = (AD + /AC)(/B(C + B/D)) f(X,Y) = !( !(X* !(XY)) * !(Y * !(XY))) f(A,B,C) = /A/B/C + A/B/C + /A/BC 3) Design the logic for the overflow bit of an adder. Hint: The inputs are the topmost bits of the inputs and the topmost bit of the result. a) Determine the truth table b) Simplify using either boolean algebra or a K-map c) Draw the resulting circuit...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online