GATE | Sudo GATE 2020 Mock I (27 December 2019) | Question 50

Consider the following set of jobs to be scheduled for execution on a single CPU system.

Job    Arrival Time    Size (msec)   Priority
J1             0          10         2 (Silver)
J2             2          8          1 (Gold)
J3             3          3          3 (Bronze)
J4            10          4          2 (Silver)
J5            12          1          3 (Bronze)       
J6            15          4          1 (Gold)

Which of the following is the correct order for scheduling policies providing the lowest waiting time for this set of jobs?

(A)

Non-preemptive SJF < FCFS < preemptive priority scheduling < non-preemptive priority scheduling

(B)

Non-preemptive SJF < FCFS < preemptive priority scheduling < non-preemptive priority scheduling

(C)

Non-preemptive SJF < preemptive priority scheduling < FCFS < non-preemptive priority scheduling

(D)

Non-preemptive SJF < preemptive priority scheduling < non-preemptive priority scheduling < FCFS

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News