CS162, Fall 1991
Midterm #1
Professor Alan Smith
Problem #1
When a compiler compiles a program and produces the corresponding object module(s), it also produces
some information (in tables) to be used by the linker/loader. Please list and describe all such information, and
explain why the linker/loader needs it. (15)
Problem #2
What advantages (if any) are there in having different quantum sizes on different levels of a multilevel
scheduling queueing algorithm. (10)
Problem #3
What is the meaning of the term "busy waiting?" What other kinds of waiting are there? Can busy waiting be
avoided altogether, assuming a machine with a "swap" instruction for synchronizaion. Explain. (12)
Problem #4
Simulate the banker's algorithm to get a safe sequence for the following:
There are 15 units currently free (available). (10)
process already allocated total need
A 100 250
B 40 180
C 20 30
D 110 140
Problem #5
The following questions are true/false or multiple choice. Please enter the appropriate answer: (33)
a. Test-and-set is an atomic operation (T/F): ____
b. The use of Test-and-set in synchronization problems precludes busy-waiting (T/F): ____
c. In a uniprocessing system, one must be able to disable interrupts in order to correctly implement P() and
V() (T/F): ____
d. In a multiprocessing system, it is sufficient to disable interrupts in order to implement P() and V() (T/F):
____
e. When running the Banker's Algorithm, a safe state could not possible lead to deadlock (T/F): ____
f. When running the Banker's Algorithm, if there are two processes whose requests can be granted fully with
CS 162, Midterm #1, Fall 1991
CS162, Fall 1991 Midterm #1 Professor Alan Smith 1
