ec311hw05

# ec311hw05 - EC 311 Introduction to Logic Design Fall 2009...

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

EC 311 – Introduction to Logic Design Fall 2009 Homework Assignment # 5 10/02/09 Due Date: 10/15/09 (in class) *Please show all the steps clearly to receive full credits. (e.g. the final optimized answer, the truth table, the Boolean function, etc.) **You must come up with and write-up the solutions on your own. Identical homework with the same mistakes will be investigated for cheating. Problem 1 (15/100): Perform the following 5-bit binary operations on the given 2’s complement numbers. Give your final answer in both 5-bit 2’s complement form as well as decimal (base 10) form. Indicate the cases where there is an overflow. Explain why it is an overflow. (i) 11011 2 + 01101 2 (ii) 00101 2 + 01010 2 (iii) 11000 2 + 10111 2 (iv) 00101 2 + 01101 2 (v) 10011 2 + 01101 2 Problem 2 (10/100): Simplify the following Boolean functions using theorems and laws of Boolean algebra. (i) (A+B+CC')(B+C(D+BC+BC’))(A'+C) (ii) (B'+A'C')'+A'C+A’BC’ Problem 3 (10/100): Assuming AND gates have a delay of 1 time units, OR gates

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

ec311hw05 - EC 311 Introduction to Logic Design Fall 2009...

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

View Full Document
Ask a homework question - tutors are online