=========================preview======================
(COMP180)final01.pdf
Back to COMP180 Login to download
======================================================
STUDENT NUMBER:______________________
THE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP180: Computer Organization
Spring Semester, 2001
FINAL EXAMINATION MAY 29, 2001
STUDENT NAME: __________________________________
STUDENT NUMBER: __________________________________
LAB NUMBER: __________________________________
Instructions to Students
1.
There are 10 problems and 14 pages. Check that you have all 14 pages.
2.
Write your name, student number and lab number on this page.
3.
Write your student number on each of the following pages.
4.
Answer all questions in the space provided. Rough work should be done only on the back pages and afterwards drawn a diagonal line through it to show that it is not part of your answer.
5.
Leave all pages stapled together.
6.
The examination period will last for 2 hours.
7.
Stop writing immediately when the time is up.
For Grading Purpose Only
Problem 1 _______________ /10
Problem 2 _______________ /10
Problem 3 _______________ /15
Problem 4 _______________ / 5
Problem 5 _______________ / 5
Problem 6 _______________ /10
Problem 7 _______________ /10
Problem 8 _______________ /20
Problem 9 _______________ / 5
Problem 10 _______________ /10
TOTAL: _______________ /100
1. (10 points)
(a) The IEEE 754 single precision .oating point format is given in the .gure below. The exponent is represented using a biased notation (with a bias of 127). Explain the advantage of the biased notation.
3130 23 22 10
1 bit 8 bits 23 bits
Note: For part b-d, it suf.ces to give the expressions for the values represented without actually calcu-lating the values.
(b) Given the bit pattern:
10001111111011111100000000000000 what does the bit pattern represent assuming it is a twos complement integer?
(c)
For the same bit pattern, what does it represent if it is in IEEE single precision .oating point format?
(d)
For the same bit pattern, what does it represent as an unsigned integer?
(a)
Construct a similar .owchart for division of two nonnegative numbers. Be sure to show all the nec-essary steps and the results of the division.
(b)
Divide 1.110ten x1010 by 1.100ten x10-5. Show the intermediate results according to the steps in the .owchart in (a).
3.
(15 points) Following is an incomplete diagram of the datapath for MIPS computer. Complete the dia-gram by connecting all of the missing lines and connections so that it can execute R, I, and Branch type instructions.
4.
(5 points) This question addresses the speedup due to the introduction of a cache system. Each cache block contains a number of words. The miss penalty is 10 times that of the hit time. Without the cache,
the memory would be accessed word by word instead of block by block. The word access time is 3 times that of the hit time.
(a)
What is the least hit ratio to achieve a speedup of 2.5?
(b)
Wha