ECE 2030 1:00pm
Computer Engineering
Spring 2010
5 problems, 6 pages
Final Exam
5 May 2010
Instructions:
This is a closed book, closed note exam. Calculators are not permitted. If you have
a question, raise your hand and I will come to you. Please work the exam in pencil and do not
separate the pages of the exam. For maximum credit, show your work.
Good Luck!
Your Name (
please print
) ________________________________________________
1
2
3
4
5
total
30
32
26
24
23
135
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Computer Engineering
Spring 2010
5 problems, 6 pages
Final Exam
5 May 2010
Problem 1
(3 parts, 30 points)
Instruction Formats, Etc.
Part A
(9 points) Consider the instruction set architecture below with fields containing zeros.
000 0000
00 0000
00 0000
0 0000 0000 0000
opcode
dest. reg.
source 1 reg.
immediate value
What is the maximum number of opcodes?
What is the number of registers?
What is the range of the signed immediate value?
Part B
(9 points) Suppose the circuit below has the following input priority: I
1
> I
3
> I
0
> I
2
.
Complete the truth table by filling in the input values that would produce the given outputs and
derive a simplified expression for
O
1
.
I
3
I
2
I
1
I
0
O
1
O
0
I
3
I
2
I
1
I
0
V
O
1
O
0
0
X
X
1
0
0
1
0
1
1
1
0
1
1
1
O
1
=
Part C
(12 points) For each problem below, compute the operations using the rules of arithmetic,
and indicate whether an overflow occurs assuming all numbers are expressed using a
six bit
unsigned
and
six bit two’s complement
representations.
101101
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '07
 WOLF
 rwe

Click to edit the document details