What is the average waiting time using FCFS and SJF?

n. A priority number finteger) is associated with each process The CPU is allocated to the process with the highest priority (smallest integer [] highest priority) Preemptive Nonpreemptive S.JF is priority scheduling where priority is the imverse of predicted next CPU burst firne n Problam [ Starvation - low prionity processes may never enecule Solution [] Aging - as time progresses increase the priority of the process Example of Priority Scheduling Priority scheduling Gantt Chart Average waiting time =8.2msec What is the average waiting time using FCFS and SUF? Round Robin (RR) Each process gets a small unit of CPU time (time quantum of. usually 10-100 millseconds. After this time has elapsed, the process is preempted and added to the end of the ready queve. It there are n processes in the ready queue and the time quantum is q then each process gets 1 of the CPU time in churks of at most q time units at once. No process waits more than (n1)q time units. Timer intertupts every quantum to schedule next process Perlormance q large D FIFO