Tutorial 3 - EE 2000 Logic Circuit Design Semester A...

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, 2007/08 Tutorial 3 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: Can you tell the meaning of “1001” if it is a (a) Decimal number (b) Binary number (c) Octal number (d) Hexadecimal number (e) 4-bit 2’s complement number (f) BCD 8421 code (g) BCD 2421 code (h) Excess-3 code Question 2: To verify if the functions are equal by using truth table xy ’ + x z ’ + x y = ( x ’ + y ’)( x + y + z ’)? Question 3: Find the dual of the following Boolean function (a) xy ’ + x z ’ + x y = ( x ’ + y ’)( x + y + z ’) (b) prove the equivalence of the dual with truth table Question 4: Draw the logic circuit diagram of the Boolean function f ( x , y , z ) = ( x ’ + y ’)( 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
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

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

Page1 / 2

Tutorial 3 - EE 2000 Logic Circuit Design Semester A...

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