Surabhi posted an Question
April 27, 2020 • 23:46 pm 30 points
  • UGC NET
  • Computer Science & Applications

Explain this

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) Answer Now
  • 0 Likes
  • 1 Comments
  • 0 Shares
  • comment-profile-img>
    Komal bhati best-answer

    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❓

    eduncle-logo-app

    no their is no priority

    eduncle-logo-app

    misprinting.. in the question the priority block is blank..

whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers