Surabhi Trigunayat Asked a Question
April 27, 2020 6:16 pmpts 30 pts
Consider the set of processes with arrival time (in ms), CPU burst time (in ms) and priority (0 is the highest priority) shown below. None of the processes have VO burst time. 53. Priority Process P1 P2 P3 P4 Burst Time 11 28 2 10 16 A.T 12 2 9 P5 The waiting time (in ms) of process P1 using preemptive priority scheduling algorithm is (A) (C) (B) (D) 49 26 38 29
  • 1 Answer(s)
  • 0 Likes
  • 1 Comments
  • Shares
  • Komal bhati thankyou
    there is a mistake in question.. b/c solving preemptive priority algorithm we need priority for gantt chart.. check it is there any priority given in the question❓
    Likes(0) Reply(2)
    Surabhi Trigunayat
    no their is no priority