Hello Experts please help completely new for me

please do not give me same answers which is ready posted

please give the detail information please

Subject$-$ Advanced Operating Systems

Considering following list of processes, with their arrival times, burst times and priority as given against each process.

Process $/$Arrival Time $/$Burst Time $/$Priority

Pl $063$

P$2271$

P$3432$

P$4754$

PS $945$

Answer following questions:

$1.$ First$-$Come, First$-$Served $($FCFS$)$ Scheduling:

a$.$ Calculate the turnaround time and waiting time for each process using the FCFS algorithm.

b$.$ Compare the results of FCFS scheduling with Shortest Job First $($SJF$)$ scheduling for above set of processes and calculate the average turnaround time for both algorithms. Which algorithm performs better in this case, and why?

$2.$ Round Robin Scheduling:

a$.$ Using Round Robin with a time quantum of $\text{'}2\text{'}$ units. Calculate the turnaround time for each process and the average turnaround time for the entire set of processes.

b$.$ Discuss how the choice of the time quantum $\text{'}2\text{'}$ affects the performance of the Round Robin scheduling algorithm. Calculate the turnaround times for different time quantum values $(4,5$ and $6)$ and compare the results.

$3.$ Priority Scheduling:

a$.$ Schedule the processes using the priority scheduling algorithm. Calculate the turnaround time and waiting time for each process.

b$.$ Compare the priority scheduling algorithm with SJF scheduling in terms of average turnaround time.

$4.$ Shortest Remaining Time First $($SRTF$)$ Scheduling:

a$.$ Demonstrate how the SRTF scheduling algorithm works by calculating the turnaround time and waiting time for each process at different time intervals.

b$.$ Compare the performance of SRTF scheduling with Round Robin scheduling for above set of processes.

Considering following list of processes, with their arrival times, burst times and priority as given

against each process.

Answer following questions:

First$-$Come, First$-$Served $($FCFS$)$ Scheduling:

a$.$ Calculate the turnaround time and waiting time for each process using the FCFS

algorithm.

b$.$ Compare the results of FCFS scheduling with Shortest Job First $($SJF$)$ scheduling for

above set of processes and calculate the average turnaround time for both algorithms.

Which algorithm performs better in this case, and why?

Round Robin Scheduling:

a$.$ Using Round Robin with a time quantum of $\text{'}2\text{'}$ units. Calculate the turnaround time for

each process and the average turnaround time for the entire set of processes.

b$.$ Discuss how the choice of the time quantum $\text{'}2\text{'}$ affects the performance of the Round

Robin scheduling algorithm. Calculate the turnaround times for different time quantum

values and $6)$ and compare the results.

Priority Scheduling:

a$.$ Schedule the processes using the priority scheduling algorithm. Calculate the

turnaround time and waiting time for each process.

b$.$ Compare the priority scheduling algorithm with SJF scheduling in terms of average

turnaround time.

Shortest Remaining Time First $($SRTF$)$ Scheduling:

a$.$ Demonstrate how the SRTF scheduling algorithm works by calculating the turnaround

time and waiting time for each process at different time intervals.

b$.$ Compare the performance of SRTF scheduling with Round Robin scheduling for above

set of processes.