A CPU scheduling algorithm determines an order for the execution of its…
2013
A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible different schedules are there?
Answer: C. n! — When scheduling n distinct processes on a single processor, each unique order represents a permutation of the processes. The number of ways to arrange n…
- A.
n
- B.
n2
- C.
n!
- D.
2n
Attempted by 640 students.
Show answer & explanation
Correct answer: C
When scheduling n distinct processes on a single processor, each unique order represents a permutation of the processes. The number of ways to arrange n distinct items is given by n factorial (n!). Therefore, there are n! possible different schedules.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…