{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

EENG211-INFE211_Midterm-Solutions

# EENG211-INFE211_Midterm-Solutions - Faculty of Engineering...

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

Faculty of Engineering ELECTRICAL AND ELECTRONIC ENGINEERING DEPARTMENT EENG211/INFE211 Digital Logic Design I Spring 2008-09 Instructor: M. K. Uyguro ğ lu Midterm EXAMINATION May 09, 2009 Duration : 90 minutes Number of Problems: 8 Good Luck STUDENT’S NUMBER NAME SURNAME GROUP NO Problem Points 1 4 2 4 3 3 4 4 5 4 6 4 7 3 8 4 TOTAL 30

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

View Full Document
EENG211/INFE211 Digital Logic Design I - Midterm Examination 1. Use 8 bits (including the sign ) to solve the following problem: a. Convert decimal +61 and +27 to binary using the signed-2’s complement representation. (2 pts.) b. Perform the binary equivalent of (+ 27) + (– 61) (1 pt.) c. Perform the binary equivalent of (– 27) + (– 61) (1 pts.) a. Integer Remainder Integer Remainder 61 27 30 1 13 1 15 0 6 1 7 1 3 0 3 1 1 1 1 1 0 1 0 1 ( ) ( ) 10 2 27 00011011 = ( ) ( ) 10 2 61 00111101 = (-61) 10 = (11000011) (-27) 10 = (11100101) b. c. 1 1 1 1 2. Simplify the following Boolean expressions to a minimum number of literals. a. (2 pts.) A C ABC AC + + b. ( )( )( ) A C A C A B C D + + + + (2 pts.) Note: Show the steps how you reached the final answer.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 9

EENG211-INFE211_Midterm-Solutions - Faculty of Engineering...

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

View Full Document
Ask a homework question - tutors are online