• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE 2017 MOCK II | Question 53

Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Pi and Pi+1 for any i and service time of Pi is Si. If t > Si for every i then, what should be the strategy to schedule the processes ?

(A)

FCFS

(B)

Shortest Job First

(C)

Round Robin

(D)

Shortest Remaining Time First

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