CompleteGATE Doubts Forum
0 like 0 dislike
265 views
  1. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

    (A) This algorithm is equivalent to the first-come-first-serve algorithm.
    (B) This algorithm is equivalent to the round-robin algorithm.
    (C) This algorithm is equivalent to the shortest-job-first algorithm.
    (D) This algorithm is equivalent to the shortest-remaining-time-first algorithm. 

asked Jul 17, 2016 in Operating Systems by CompleteGATE-AskUS (3,550 points) | 265 views

1 Answer

1 like 0 dislike
Best answer
  1. (B) This algorithm is equivalent to the round-robin algorithm.

answered Jul 17, 2016 by ebeisaac (13,250 points)
selected Jul 17, 2016 by CompleteGATE-AskUS
Welcome to Completegate AskUs, A place where you can ask questions regarding videos located at Youtube Channel and receive answers from our experts.

Sign up for our newsletter to receive the latest news and event postings.

Best Users 12/2018
  1. CompleteGATE-AskUS

    3550 Points

  2. Asma Abbasi

    200 Points

  3. Henry

    150 Points

  4. SilverChat

    140 Points

Rewards per month
First Winner: 0 INR (Not Started)
Second Winner: 0 INR (Not Started)

×

Like us on Facebook

Show your Support. Become a FAN!

106 questions
100 answers
2 comments
48 users