exam1_sol

# exam1_sol - CS/ECE 252 INTRODUCTION TO COMPUTER ENGINEERING...

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

1 CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN—MADISON Prof. Mark D. Hill TAs Marc de Kruijf & Sanghamitra Roy Midterm Examination 1 In Class (50 minutes) Wednesday, February 14, 2006 Weight: 15% The exam in two-sided and has 6 pages, including two blank pages at the end. Plan your time carefully, since some problems are longer than others. NAME: __________________________________________________________ ID# ______________________________________________________________ Problem Number Maximum Points Graded By 1 4 SR 2 3 SR 3 3 SR 4 4 SR 5 4 SR 6 4 MK 7 4 MK 8 4 MK Total 30

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

View Full Document
2 Problem 1 (4 points) (a) What is the largest (most positive) integer that can be represented as an unsigned integer using 10 bits? 1111111111 b = (2 10 – 1) d = 1023 d Full credit for any one of (2 10 – 1) d or 1023 d (b) What is the largest (most positive) integer that can be represented as a two’s complement integer using 10 bits? 0111111111 b = (2 9 – 1) d = 511 d Full credit for any one of (2 9 – 1) d or 511 d Problem 2 (3 points) Consider bitwise logical operations:
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

exam1_sol - CS/ECE 252 INTRODUCTION TO COMPUTER 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