Cpu scheduling algorithm, Operating System

Q. A CPU scheduling algorithm determined an order for the execution of its scheduled processes. Convinced n processes to be scheduled on one processor how numerous possible different schedules are there? Provide a formula in terms of n.

Answer: n! (n factorial = n × n - 1 × n - 2 × ... × 2 × 1).

Posted Date: 7/27/2013 2:38:35 AM | Location : United States







Related Discussions:- Cpu scheduling algorithm, Assignment Help, Ask Question on Cpu scheduling algorithm, Get Answer, Expert's Help, Cpu scheduling algorithm Discussions

Write discussion on Cpu scheduling algorithm
Your posts are moderated
Related Questions
Define the “turn-around” time of a user job Turn- around time is total time taken to execute the job.

This is a group project as described in the 'AssignmentDescription.pdf' file. I am doing a sub project which is "sub project Mobile application. Android or Apple based. Turn based

My code it didn''t run properly ,i tried to pass 2 parameter example : ./a.out ls -ll ,but it execute only the ls instead of the ls -ll ! plz help amd thank you ! #include #inclu

Discuss the concepts of  task decomposition  and  data decomposition  within the context of parallel programming. Parallel programming or parrelel computing is the simultaneo

what is deadlock

How do we keep track of where the free pieces of memory are? One idea is to maintain a set of linked-lists of free space; each linked-list will store free chunks of some given size


Entry-sequenced file organization The records in an entry-sequenced file are store up in the order they are written into the file. New records are for all time appended to

What are the three main activities of an operating system in regard to memory management? Keep track of which parts of memory are now being used and by whom. Decide which pr

Describe the technique of packing. The physical record size will not accurately match the length of the desired logical record and the Logical records may even differ in length