midexamfall04

# midexamfall04 - Name: Computer Organization CDA-3103...

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

Computer Organization CDA-3103 Mid-Term Exam Fall 2004 Be lucid and neat. Justify all your answers. 75 mins. Closed book, Closed notes, No calculator. Name:

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

View Full Document
Q1 (30 pts) You are required to design a 2-bit comparator, which compares a 2-bit binary number A with a second 2-bit binary number B . The comparator has three outputs: L , E , and G . If A<B then L gets asserted, if A=B then E gets asserted, and if A>B then G gets asserted. a. (6 pts.) Complete the following truth table for this 2-bit comparator. A1 A0 B1 B0 L E G 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 b.(15 pts.) Give the most simplified Boolean expressions for L , E , and G in sum-of- products form.
c. (9 pts.) Implement L , E , and G using a PLA.

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

View Full Document
Q2 (15 pts.) Given the bit pattern: 1011 1111 1110 0000 0000 0000 0000 0000 a. (5 points) What is the hexadecimal value that this pattern represents, assuming that it is an unsigned integer? How would you convert it to decimal (you don’t have
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 08/22/2010 for the course CDA 3101 taught by Professor Staff during the Fall '07 term at University of Central Florida.

### Page1 / 8

midexamfall04 - Name: Computer Organization CDA-3103...

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

View Full Document
Ask a homework question - tutors are online