{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Tutorial 4 - (a d c b a c b a d ac bcd d c b c b a f =(b y...

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

EE 2000 Logic Circuit Design, Semester A, 2007/08 Tutorial 4 The questions are divided into two levels. Level 1 is the basic level question. You should be able to answer them after completing the lecture. Level 2 is the advanced level question. You may have to take a research before answering them. Please be prepared before the tutorial. Level 1 Question 1: Map the following standard SOP expression on a K-map. C B A C B A C B A BC A C B A + + + + . Question 2: (a) Apply boolean algebra to convert the folowing SOP expression to standard form (canonical form). (b) Map the standard SOP expression to K-map. CD B A D C B A D C B A C AB B A C B + + + + + Question 3: Simplify the following expressions using k-map.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (a) d c b a c b a d ac bcd d c b c b a f + + + + + = (b) y x z y x yz wxy f + + + = (c) f ( a,b,c,d ) = Σ m (4,6,7,15) (d) f ( a,b,c,d ) = Σ m (3,7,11,13,14,15) (e) f ( a,b,c,d ) = Σ m (0,6,8,13,14) + Σ d (2,4,10) (f) f ( a,b,c,d ) = Σ m (1,3,5,7,9,15) + Σ d (4,6,12,13) Level 2 Question 4: Use a K-map, convert the following standard (canonical) POS expression into (a) a minimum POS expression, (b) a standard SOP expression, and (c) a minimum SOP expression. ) )( )( )( )( )( ( D C B A D C B A D C B A D C B A D C B A D C B A + + + + + + + + + + + + + + + + + +...
View Full Document

{[ snackBarMessage ]}