A scheduling algorithm assigns priority proportional to the waiting time of aprocess.
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 toschedule.
Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero


A Foxoyo User A Foxoyo User
  • Level 0
  • 0
    Attempts
  • 106
    users
  • 0 %
    Accuracy

  • share

Guaranteed answer

Just add "foxoyo"

next time you Google a mcq Questions

I want answer on Click

Related MCQs

No Public Explanation

Click option to see answer

Post your public answer

Every MCQ Answered

1. Add foxoyo.com with question

2. Click option and get answer

Suggested Books