Computer Science, asked by HinaChokshi, 10 months ago

A system n processes, and with a non preemptive scheduler. What is the total number of scheduling possible?
n
n!
n(n-1)

2n

Answers

Answered by Diyakhan
0

Answer:

https://friend2020.com/quiz/4147650

open this link play and score

Answered by apocritia
0

Answer:

n!

Explanation:

It is given that there are total n processes and they are with a non preemptive sheduler.

As it is known that the non preemptive sheduler can not be prempted once started. It can be prempted only when the sheduled job is over. That means it will complete once process at a time.

That means it is similar to choose n objects without replacement and it can be done in n! ways.

So the total number of sheduling possible in a system of n processes with a non preemptive sheduler is n!.

Similar questions