Tutorial 4 Solution - EE 2000 Logic Circuit Design,...

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

View Full Document Right Arrow Icon
EE 2000 Logic Circuit Design, Semester A, 2008/09 Tutorial 4 Solution Week 5 (29 th September, 1 st * , 2 nd October, 2008) 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 Answer: AB CD 00 01 11 10 00 1 1 01 1 1 1 1 11 10 1 1 c) B’D’ + C’D Chapter 3 , Question 3: Don’t care combinations are marked by Xs. The minimal expression 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 Answer: AB CD 00 01 11 10 00 x 0 0 x 01 0 x 11 0 x 0 x 10 x x
Background image of page 1

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

View Full DocumentRight Arrow Icon
f’ = A’B + CD + C’D’ f = (A + B’)(C’ + D’)(C + D) Answer is (a) Chapter 3 , Question 19: Consider a 4-variable Boolean function. List the decimal codes of the cells adjacent to cell 13. Answer: x 1 x 2 x 3 x 4 00 01 11 10 00 9 01 m 13 11 10 Adjacent cells to cell 13 is cell 5, 9, 12, 15 Level 2: Problems Chapter 3 , Problem 15: Minimize the function using Karnaugh map method. F
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.

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 / 4

Tutorial 4 Solution - EE 2000 Logic Circuit Design,...

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

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