{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

exam2_sol

# exam2_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 2 In Class (50 minutes) Wednesday, March 14, 2007 Weight: 15% CLOSED BOOK, NOTE, CALCULATOR, PHONE, & COMPUTER. The exam in two-sided and has 9 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 Actual Points 1 3 MK 2 4 MK 3 4 MK 4 3 MK 5 4 MK 6 4 SR 7 4 SR 8 4 SR Total 30

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

View Full Document
2 Problem 1 (3 points) Write the Boolean expression corresponding to the following truth table. You need not simplify the expression. A B C Z 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0 A B C + A B C + A B C Problem 2 (4 points) Suppose a 32-bit instruction takes the following format: OPCODE SR DR IMM If there are 75 opcodes and 32 registers: a) What is the minimum number of bits required to represent the OPCODE?
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 9

exam2_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