Consider the following set of processes
First Come First Serve (FCFS), non preemptive Shortest Job First (SJF) and Round Robin (RR) (quantum = 10 ms). Scheduling Algorithms for this process set would imply which of the following features?
1. The SJF policy results in less than half of the average waiting time obtained with FCFS scheduling.
2. The RR algorithm gives an intermediate value for the average waiting time.
3. Deterministic modelling takes a particular predetermined workload, and designs the performance of each algorithm for that workload.
Select the correct answer using the code given below.
(a) 1, 2 and 3
(b) 1 and 2 only
(c) 1 and 3 only
(d) 2 and 3 only