CS162, Spring/1992
Midterm #2
Professor Thomas Anderson
General Information:
This is a closed book examination. You have 60 minutes to answer as many question as possible. The
number in parentheses at the beginning of each question indicates the number of points given to the question;
there are 60 points in all. Write all of your answers directly on this paper. Make your anwers as concise as
possible (you needn't cover every available nano-acre with writing).
Problem #1 (6 points)
For each of the following statements, indicate in one sentence whether the statement is true or false, and why.
(a) Binary semaphores are those that are used by no more than two threads.
(b) The Banker's algorithm is a way of preventing deadlock
(c) A multi-level indexed file permits faster random access than a contiguously allocated file.
Problem #2 (8 points)
For each of the following items, write a sentence definition:
(a) Atomic
(b) Deadlock
(c) Disk cylinder
(d) Doubly indirect block
Problem #3 (8 points)
A thread can be in one of thre states: ready to run, running, or blocked. For each transition indicated below,
identify under what circumstances it occurs:
(a) ready -> running
(b) running -> ready
(c) running -> blocked
(d) blocked -> ready
CS162, Midterm #2, Spring/1992
CS162, Spring/1992 Midterm #2 Professor Thomas Anderson 1
