Tutorial 4 - Level 2: Problems Chapter 3 , Problem 15:...

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

View Full Document Right Arrow Icon
EE 2000 Logic Circuit Design, Semester A, 2008/09 Tutorial 4 Week 5 (29 th September, 1 st * , 2 nd October, 2008) The questions are divided into three levels. Level 1 is the review questions. You should able to answer them after attending the lecture. Level 2 is the problems. You should take a revision of the book before answering them. Level 3 is challenge exercise. They are advanced problems. Please be prepared before the tutorial. Level 1: Review Questions Chapter 3 , Question 1: The minimal expression for the Boolean function mapped below is AB CD 00 01 11 10 00 1 1 01 1 1 1 1 11 10 1 1 Chapter 3 , Question 3: Don’t care combinations are marked by Xs. The minimal expression (in POS form) for the function shown on the K-map is AB CD 00 01 11 10 00 x 0 0 x 01 0 x 11 0 x 0 x 10 x x Chapter 3 , Question 19: Consider a 4-variable Boolean function. List the decimal codes of the cells adjacent to cell 13.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Level 2: Problems Chapter 3 , Problem 15: Minimize the function using Karnaugh map method. F ( A, B, C, D ) = Σ m (1, 2, 3, 8 ,9 ,10, 11, 14) + Σ d (7, 15) Chapter 3 , Problem 17: Simplify the following function by the K-map method. f ( A, B, C, D ) = Σ m (0, 5, 6, 8 ,9 ,10, 11, 13) + Σ d (1, 2, 15) Chapter 3 , Problem 20: Determine the minimal SOP realization for the incompletely specified function using Karnaugh map. f ( A, B, C, D ) = Σ m (1, 3, 5, 8 ,9 ,11, 15) + Σ d (2, 13) Level 3: Challenge Exercise Question I: (a) Plot the following function on the K-map ) )( )( )( )( )( ( ) , , , ( D C B A D C B A D C B A D C B A D C B A D C B A D C B A f + + + + + + + + + + + + + + + + + + = AB CD 00 01 11 10 00 01 11 10 (b) Use a K-map to convert the standard POS expression in part (a) into (i) Minimum POS expression (ii) Standard SOP expression, and (iii) Minimum SOP expression....
View Full Document

This note was uploaded on 02/06/2011 for the course EE 2000 taught by Professor Vancwting during the Spring '07 term at City University of Hong Kong.

Page1 / 2

Tutorial 4 - Level 2: Problems Chapter 3 , Problem 15:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online