1. (10 pts) Give a computer system example (different from the one described in this chapter) of a race that would result in a different result depending on the order of processing.
2. (10 pts) Give at least two “real life” examples (not related to a computer system environment) of each of these concepts: deadlock, starvation, and race. Describe how the deadlocks can be resolved.
For the systems described below (3-6), given that all of the devices are of the same type, and using the definitions presented in the discussion of the Banker’s Algorithm, answer these questions: ( Each 5 pts):
a. Calculate the number of available devices.
b. Determine the remaining needs for each job in each system.
c. Determine whether each system is in a safe state or an unsafe state.
d.If the system is in a safe state, list the sequence of requests and releases that will make it possible for all processes to run to completion.
e. If the system is in an unsafe state, show how it’s possible for deadlock to occur.

3. This system has 16 devices.
Job No. Devices Allocated Maximum Required Remaining Needs
Job 1 5 8
Job 2 3 9
Job 3 4 8
Job 4 2 5

4. This system has 12 devices.
Job No. Devices Allocated Maximum Required Remaining Needs
Job 1 5 8
Job 2 1 4
Job 3 5 7
5. This system has 14 devices.
Job No. Devices Allocated Maximum Required Remaining Needs
Job 1 2 6
Job 2 4 7
Job 3 5 6
Job 4 0 2
Job 5 2 4

6. This system has 32 devices.
Job No. Devices Allocated Maximum Required Remaining Needs
Job 1 11 17
Job 2 7 10
Job 3 12 18
Job 4 0 8