1,689 views
0 votes
0 votes

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?

a)n

b)n2

c)n!

d)2n 

2 Answers

0 votes
0 votes
i feel it is n!  as we can arrange in those ways ways
0 votes
0 votes
answer is n! as n process have the choice to run at any place 1,2,3,4,5...n places .

Related questions

5 votes
5 votes
3 answers
1
daksh asked Jan 15, 2016
8,307 views
how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a)a) 2b) 3c) 6d) 8
17 votes
17 votes
1 answer
2
nilamd asked Dec 21, 2015
4,522 views
Consider the following Two Transactions.A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ?$51$$52$$55$$56$ B) How many cascadeless recoverable s...
5 votes
5 votes
1 answer
3
3 votes
3 votes
3 answers
4
sh!va asked Jul 15, 2016
16,176 views
How many different Boolean functions are there for $n$ Boolean variables?A. $n^ n$B. $2^ {2^ n}$ C. $n^ {n^2}$D. $2^ {n^2}$