=========================preview======================
(COMP180)comp180_00s_final.pdf
Back to COMP180 Login to download
======================================================
Hong Kong University of Science and Technology
COMP180: Computer Organization
Spring 2000 Final Examination
29 May 2000, 4:30-7:30pm
Student Name: _________________________
Student Number: _________________________
Lecture & Lab Sections: _________________________
Instructions
1.
This is a closed-book, closed-notes examination.
2.
Check that you have all 17 pages (including this cover page).
3.
Write your name, student number, lecture and lab sections on this page.
4.
Answer all questions in the space provided.
5.
Rough work should be done only on the back pages.
6.
The appendix lists some MIPS instructions and their formats.
Question 1 (10%): __________________________
Question 2 (10%): __________________________
Question 3 (10%): __________________________
Question 4 (5%): __________________________
Question 5 (8%): __________________________
Question 6 (8%): __________________________
Question 7 (12%): __________________________
Question 8 (7%): __________________________
Question 9 (5%): __________________________
Question 10 (5%): __________________________
Question 11 (10%): __________________________
Question 12 (10%): __________________________
TOTAL (100%): __________________________
1. (10 points)
a) Which of the following statements is incorrect?
A. When two twos complement numbers are added, having a carry out from the most significant bit does not necessarily imply an overflow.
B. I/O time includes time spent on moving blocks between cache and main memory.
C. A register file consists of both combinational and sequential logic circuits.
D. Direct mapped block placement is a special case of N-way set associative schemes.
E. In a memory hierarchy, the fastest memory is closest to the processor.
Answer: ________
b) Which of the following program characteristics can contribute to temporal or spatial locality and hence can make cache memory management possible?
i. loops
ii. pointers
iii. structured data types (e.g., arrays)
iv.
conditional branches
A.
i
B.
i, ii
C.
i, iii
D.
ii, iv
E.
i, iii, iv
Answer: ________
c) Which of the following statements is correct?
A. Polling is a common technique used by processors to give commands to I/O devices.
B. Cache usually uses dynamic RAM (DRAM) technology due to its faster speed.
C. In MIPS, the program counter (PC) is incremented by 4 to point to the next instruction at the end of the whole execution process for the current instruction.
D. Twos complement representation is used for representing both integers and IEEE 754 floating-point numbers.
E. A carry lookahead adder is more efficient than a ripple carry adder.
Answer: ________
d) Which of the following statements is correct?
A. Some memory references can be avoided by using immediate addressing instructions.
B. I/O devices can never communicate with the processor dire