August
1999 QUESTION 2 Total Marks: 20 Marks |
Click here to access other
questions
Click to access |
| (a) | Describe each of the following operating
system structures : (i) Monolithic. (ii) Client-server.
|
[2] [2] |
|||||||||||||||||||||||||||||||||||||||||||||
| (b) | Describe three tasks which are carried out by
memory manager.
|
[3] | |||||||||||||||||||||||||||||||||||||||||||||
| (c) | Describe two ways of implementing fixed
partitioning.
|
[4] | |||||||||||||||||||||||||||||||||||||||||||||
| (d) | Describe how each of the following situations
can lead to deadlock : (i) Mutual exclusion (ii) Hold and wait (iii) No preemption
|
[1] [1] [1]
|
|||||||||||||||||||||||||||||||||||||||||||||
| (e) | Deadlock avoidance involves the
tactful allocation of resources to processes. (i) Describe how Banker's algorithm for a single resources is implemented. (ii) For each of the following examples, identify whether it is in a safe or an unsafe state : A: The number of free resources is 10.
B: The number of free resources is 2.
C: The number of free resources is 1.
|
[3] [3] |