Computer Science 422/622
                         Quiz D  -    Name   ____________________

1. The proper time to run the deadlock avoidance (Banker's) algorithm is:

   a. Whenever a resource is          b. Whenever a process is blocked
      allocated to a process             because a resource is not available

   c. The algorithm must be run
      in both cases (a.) and (b.)


2. In the deadlock avoidance algorithm the resources of process i are
   released if

   a. Requested[i][j] <= avail[j]     b. Requested[i][j] <= avail[j]
      for some j.                        for all j.

   c. Claims[i][j] <= avail[j]        d. Claims[i][j] <= avail[j]
      for some j.                        for all j.


3. When  the resources of process j were released what was added
   to avail[j]?

   a. Claims[i][j]                   b. Allocated[i][j] -
                                        Requested[i][j]

   c. Allocated[i][j]                 d. Requested[i][j]


4. Which of the following is NOT one of the requirements for effective
   memory protection:

   a. protect users from each other   b. protect users from the OS

   c. protect the OS from the users   d. ALL are important requirements.


5. The use of "single partition" memory management would be most
   appropriate in:

   a. a large mainframe computer      b. a scientific workstation
      system with many online users      such as a SUN

   c. a computer embedded in a
      microwave oven.