ASSIGNMENT Tutorial Questions
ASSIGNMENT Tutorial Questions
1. Define the differences between pre-emptive and non-pre-emptive scheduling. State why
strict non-preemptive scheduling is unlikely to be used in a computer centre.
2. Consider the following set of processes, with the length of the CPU-burst time given in
milliseconds as below:
The processes are assumed to have arrived in the order P1, P2, P3, P4,P5, all at time 0. a.
a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF,
a non-preemptive priority (a smaller priority number implies a higher priority), and
RR (quantum = 1) scheduling.
b. What is the turnaround time of each process for each of the scheduling algorithms in
(a) above?
c. What is the waiting time of each process for each of the scheduling algorithms in (a)?
d. Which of the schedules in (a) results in the minimal average waiting time (over all
processes)?
3. An operating system uses Shortest remaining time first scheduling algorithm for pre-
emptive scheduling of process. Consider the following set of processes with their arrival
times and CPU burst times (in milliseconds).
Process ID Arrival Time Burst Time
P1 0 12
P2 2 4
P3 3 6
P4 8 5
Find the average waiting time (in milliseconds) of the processes
4. Process Control Block is critical in efficient management of processes by the Operating
System. List all the components of Process Control Block and describe the information
each component stores.
5. What are the five major activities of an operating system with regard to process
management?
6. Network operating systems are not fundamentally different from single processor
operating systems. Discuss
7. Distinguish between Network OS and Distributed OS.
9. What is scheduling? What are the criteria affects the schedulers performance
10. What are the different principles which must be considered while selection of a
scheduling algorithm