Scheduling Algorithm Problem

 SOME OPERATING SYSTEM PROBLEMS RELATED TO SCHEDULING ALGORITHM ..........

1)
Consider the following four processes with the length of CPU burst time given in milliseconds together with their respective arivel time
   Process    Arrival Time     Burst Time
   p1                 0                     8
   p2                 1                     4
   p3                 2                     9
   p4                 3                     5
   Find average waiting time for preemptive  SJF and non Preemptive SJF .

2) Consider the following 5 process. Suppose the arrival time is with the length of cpu burst time given below

 Process            Burst time
    p1                     10
    p2                      25
    p3                      3
    p4                      4
    p5                      11
Find average waiting time for FCFS schduling and non preemptive SJF Scheduling.

3) Process        Burst time      Priority
      p1                  10                 3
      p2                    1                 1
      p3                    2                 3
      p4                   1                 4
      p5                   5                  2
 Consider the arrival time of each process is 0 . then average waiting time for priority scheduling and waiting time if the priority is assigned according to Burst time.

4)Process          Burst time
      p1                  24
      p2                   3
      p3                   3
If time quantum is i unit then average waiting time for Round Robing scheduling .What will happen if we set this time quantum 6 unit.

5) process         Burst time
       p1                    10
       p2                     29
       p3                      3
       p4                     7
       p5                      12

Which scheduling algorithm gives the minimal average waiting time ?
FCFS ,SJF , RR (q=10)