Consider the process PO, P1, P2 and P3 with the following burst time in seconds. Process Burst Time PO 16 P1 10 P2 8. P3 12 Draw the Gantt Chart and find the average waiting time and turnaround time using the following scheduling algorithms: a. First Come First Serve (FCFS) Scheduling - Consider that the above are arrived in the queue at the time of PO=D0, P1=1, P2=4 and P3=7. b. Non Preemptive SJF Scheduling: Consider that the above processes are arrived in the queue at the time of PO =0, P1 =1, P2=5 and P3=6. C. Priority Scheduling: Consider the above process have the priority P0=4, P1=2, P2=1, P3=3. d. Round Robin Scheduling: Consider the Time Slice as 4 seconds. е. Identify the best Scheduling algorithm from the above and justify your answer.

Consider the following set of processes (a smaller priority number implies a higher priority). The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Process Priority Burst Time P1 1 20 P2 3 25 P3 4 25 P4 2 15 P5 5 30   What is the waiting time of each process for each of the scheduling algorithms  FCFS, SJF (if two jobs have the same burst time, schedule them following priority), non-preemptive priority? Process FCFS SJF Priority P1       P2       P3       P4       P5

Concurrent Processes / Monitors select which is true options: a CV (condition variable) queues in a monitor store suspended processes waiting on the corresponding condition.      b The "Signal and Wait" approach (Hoare semantics) leads to more efficient implementation and reduces the number of context switches. c Two or more processes can be active in the same monitor simultaneously. d When the "Signal and Continue"-approach (Mesa semantics) is applied, the signaling process P continues executing.  e The monitor-based solution to the Dining-Philosophers problem discussed in class is restricted to 5 philosophers.

Draw the corresponding Gantt diagrams for this scheduling algorithms;- Round Robin q=1 (1ms Quantum).