Lab-4 Exercises: 1) Implement FCFS scheduling algorithm with different arrival time. Sample Input Enter the number of processes -- 5 Enter the Burst Time & Arrival Time of Process 0 --- 10 3 Enter the...

Extracted text: Lab-4 Exercises: 1) Implement FCFS scheduling algorithm with different arrival time. Sample Input Enter the number of processes -- 5 Enter the Burst Time & Arrival Time of Process 0 --- 10 3 Enter the Burst Time &Arrival Time of Process 1 --- 11 Enter the Burst Time &Arrival Time of Process 2 --- 24 Enter the Burst Time &Arrival Time of Process 3 --- 15 Enter the Burst Time &Arrival Time of Process 4 --- 5 2 Sample Output: PROCESS Arrival Time BURST TIME WAITING TIME TURNARROUND TIME 1 1 1 1 4 5 1 3 10 16 2 4 2 16 18 3 5 1 18 19 2) Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. a) 1 b) 2 c) 3 d) 4