{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

COMPE_231_HW-2 - COMPE-231 DIGITAL CIRCUIT SYSTEMS...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
COMPE-231 DIGITAL CIRCUIT & SYSTEMS FALL-2010 HW-2 Mustafa BULUT 090302011 Section 3 1. Given the following truth table, answer the following questions. A B C D F 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 1 1 0 0 1 1 0 1 0 0 1 0 1 0 1 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 0 1 1 1 1 0 1 0 1 0 1 0 0 1 1 1 1 1 1 0 1 1 1 1 1 1 1 a. Represent F(A,B,C,D) in minterm. (Notice the order of the variables in K-Map and F function) b. Represent F(A,B,C,D) in maxterm. (Notice the order of the variables in K-Map and F function)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
COMPE-231 DIGITAL CIRCUIT & SYSTEMS FALL-2010 HW-2 c. List all the prime implicants for the given function. d. Which one(s) of the prime implicants is/are essential? List the essential primes. e. What is the minimum cover for the given function? State your answer in Boolean equation for function F (A,B,C,D). 2. Use Karnaugh maps (K-Maps) to simplify the following, take advantage of the indicated don’t care conditions. (Clearly show your K-Map(s) and derived minimum cover in Boolean equation) a. F(W,X,Y,Z)= M (1,5,6,7,11,15) D (0,2,3,8,9,12) b. F(A,B,C,D)= m (0,1,7,10,11,13) + d (2,3,8,9) 3. An engineer has has been working with a logic circuit. He has a circuit that works but
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}