August
1997 QUESTION 3 Total Marks: 20 Marks |
Click here to access other
questions
Click to access |
| 3. | (a) List two types of scheduler, and distinguish between them. | [4] | |||||||||||||||||||||
| (b) Suppose, in a multiprogramming environment, a processor is assigned the following jobs for execution. | |||||||||||||||||||||||
|
|||||||||||||||||||||||
| Priority is highest for 1 and lowest for 4. | |||||||||||||||||||||||
| Draw a Gantt Chart to illustrate the execution of these jobs using the following scheduling algorithms: | [8] | ||||||||||||||||||||||
| (i) First Come First Served | |||||||||||||||||||||||
| (ii) Shortest Job First | |||||||||||||||||||||||
| (iii) Round Robin (time quantum is 3) | |||||||||||||||||||||||
| (iv) Priority Scheduling | |||||||||||||||||||||||
| (c) For each of the algorithms mentioned in part (b), compute the average waiting time. You should show all necessary working. | [8] | ||||||||||||||||||||||