Computer Science 322
                         Quiz C          Name   _____________________

1. In the deadlock detection algorithm a process j is NOT blocked if and
   only if:

   a. Requested[i][j] > 0 for        b. Requested[i][j] > 0 for
      all j                             some j

   c. Requested[i][j] == 0           d. Requested[i][j] == 0 for
      for all j.                        some j


2. A system may contain a deadlock:

   a. even if all entries in the     b. If a least one row in the
      requested table are 0.            requested table has at least
                                        one non-zero entry

   c. If at least one row has        d. If at least two rows have at
      all non-zero entries              least on non-zero entry


3. If exactly 1 row of the requested table has ALL non-zero entries

   a. There is a deadlock           b. There is NOT a deadlock

   c. There may or may not be
      a deadlock.


4. Which of the following is invariant:

   a. avail[i]                     b. avail[i] + sum (alloc[i][j])
                                                  j

   c. avail[i] + sum(req[i][j])    d. avail[i] - sum (alloc[i][j])
                  j                               j

5. In the deadlock detection algorithm the resources of process j are
   released if

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

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