Fall 2005 1 EE 333 Lillevik480f05-a3 University of Portland School of Engineering EE 333 Final Exam...
13
Fall 2005 Lillevik 480f05-a3 1 University of Portland School of Engineering EE 333 EE 333 Final Exam December 15, 2005 Instructions 1. Print your name, student ID, and seat in the above blanks. 2. This is a Closed Book exam. 3. Do all of the problems. They may vary in points but the total is 100. Questions are short answer and problems. 4. Do not use any additional pages of paper. If you run out of room, use the back sides. Do not remove the staple. 5. Please write clearly or print. Illegible or unreadable answers may not be graded for partial credit. Name Student ID Seat 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 10 0 Answers
-
Upload
lilliana-wakefield -
Category
Documents
-
view
214 -
download
1
Transcript of Fall 2005 1 EE 333 Lillevik480f05-a3 University of Portland School of Engineering EE 333 Final Exam...
Fall 2005
Lillevik 480f05-a3 1
University of Portland School of Engineering
EE 333
EE 333 Final ExamDecember 15, 2005
Instructions1. Print your name, student ID, and seat in the above
blanks.2. This is a Closed Book exam.3. Do all of the problems. They may vary in points but the
total is 100. Questions are short answer and problems.4. Do not use any additional pages of paper. If you run out
of room, use the back sides. Do not remove the staple.5. Please write clearly or print. Illegible or unreadable
answers may not be graded for partial credit.6. Show your work. Mark your answer with a box or star.
Name Student ID
Seat1 10
2 10
3 10
4 10
5 10
6 10
7 10
8 10
9 10
10 10
100
Answers
Fall 2005
Lillevik 480f05-a3 2
University of Portland School of Engineering
EE 333
Problem 1, (10 pts)
1. Convert hex 0xc4a to decimal?
2. Convert decimal 432 to hex?
D = c x 162 + 4 x 161 + a x 160
= 12 x 256 + 4 x 16 + 10 x 1
= 3072 + 64 + 10 = 3164
H : 432/16 = 27, R =0
: 27/16 = 1, R =11: 1--11-- 0 = 0x1B0
Fall 2005
Lillevik 480f05-a3 3
University of Portland School of Engineering
EE 333
MIPS machine language (decimal)
You may also use the following pseudo-instructions:
la rdest, address
lb rt, address
sb rt, address
Fall 2005
Lillevik 480f05-a3 4
University of Portland School of Engineering
EE 333
Problem 2, (10 pts)
Find the machine instruction for sub $10, $6, $16
0x 00d0 5022
R type FieldsSize 6 bits 5 bits 5 bits 5 bits 5 bits 6 bits
R type op rs rt rd shamt funct
00 0000 0 0110 1 0000 0 1010 0 0000 10 0010
sub rd, rs, rt
Fall 2005
Lillevik 480f05-a3 5
University of Portland School of Engineering
EE 333
Problem 3, (10 pts) nsFT 5.0102
119
5.105.022.05.24.0215.022.0 T
prob clocks ns
add 0.2 4 2
sub 0.15 4 2
lw 0.4 5 2.5
sw 0.2 4 2
j 0.05 3 1.5
A. Assume Fmax = 2.0 GHz, complete the table (clocks, ns).
B. Use the probability information to determine the average instruction time in ns.
MIPS data path
075.04.00.13.04.0
ns175.2
Fall 2005
Lillevik 480f05-a3 6
University of Portland School of Engineering
EE 333
Problem 4, (10 pts)
A 16-bit computer is built entirely from the 7400LS logic family. Use only the following information to find the maximum clock frequency for the ideal case. Show units.
setup = 10ns, hold=5ns, propagation=20ns, gate delay =10ns
sucomboprop tttT
suSOPprop ttt
nsnsnsns 501010220
MHznsT
f 2050
11
Fall 2005
Lillevik 480f05-a3 7
University of Portland School of Engineering
EE 333
Problem 5 (10 pts)Complete the 64x16 ROM design; fully decode for 0x00 start address.
Fall 2005
Lillevik 480f05-a3 8
University of Portland School of Engineering
EE 333
Problem 6 (10 pts)
Cache memory
index V M tag data
000 Y Y 10 0x123
001 N Y 11 0x456
010 N N 01 0x789
011 Y Y 00 0xabc
100 Y N 01 0xdef
101 Y Y 11 0x123
110 Y Y 10 0x456
111 N Y 00 0x789
CPU write
adr hit? WB?
1 0001 N N, invalid
1 1101 Y N
0 0011 Y N
0 0010 N N
1 0000 Y N
0 1110 N Y
0 0000 N Y
0 1111 N N, invalid
For the direct mapped, write-back cache below, complete the table (Y or N)?
WB = miss-modified
Fall 2005
Lillevik 480f05-a3 9
University of Portland School of Engineering
EE 333
Problem 7 (10 pts)
Determine the speedup S of a pipelined CPU with p stages as the number of instructions becomes infinitely large?
parallel
series
TT
S
NN nseriesTTTT ...
1
pN
NN nparallelTTTT ...
1
1...1 p
)1( Np
NNp
pNp
pN1
1)1(
pp
SN
010
lim
Series
Parallel
Fall 2005
Lillevik 480f05-a3 10
University of Portland School of Engineering
EE 333
Problem 8 (10 pts)
A. What are the advantages of microprogramming?
Solve large FSM problems
Flexibility for changes
Assembler can check for errors
B. What are the general steps?edit source file
assemble
create µROM
Fall 2005
Lillevik 480f05-a3 11
University of Portland School of Engineering
EE 333
Problem 9 (10 pts)
MDP16 system trace
Fall 2005
Lillevik 480f05-a3 12
University of Portland School of Engineering
EE 333
Problem 9 (10 pts), continued.
1. What machine instruction is executing at 6200 ns?
2. What is the optimistic branch address for the instruction executing at 7600 ns?
3. At 6800 ns, the instruction is a sw, what is the effective address?
4. At 8400 ns, the instruction is a sw, what is the data?
5. At 6000 ns, the instruction is an addi, what is the immediate data?
0xAC20
0x004A
0x0201
0x0095
0x0020
Fall 2005
Lillevik 480f05-a3 13
University of Portland School of Engineering
EE 333
Problem 10 (10 pts)Find an expression for the average access time Tave of a memory-hard disk hierarchy? Assume the page rate (hit) is p, memory access time is m, the I/O bus bandwidth is b, the size of a page is s bytes, a page is found dirty (modified) with probability d, and the free page list is always empty (memory full).
diskmemave
TpTpT 1 mTmem
busbusdisk
TdTdT 12
bs
dbs
d 12
bs
dbs
dpmpTave
121
b
sdpmp 11
