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

Q. Define Input - Output operations? Serial lines, Disks, tapes and other devices should be communicated with at a very low level. The user require only specify the device and

Write a XML with database with book details (BOOK ID, Title, Author, subject, publisher year, language, vendor, and price)

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

please help us to write a code in c for tree directory structures.

advantages and disadvantages

#include #include #include #include #include int main(void) { int pchan[2], pid, rval, cvar; char buf[20]; if (pipe(pchan) == -1){

Concept of Reentrancy   It is a useful, memory-saving method for multiprogrammed timesharing machines. A Reentrant method is one in which multiple clients can share a singl

Take the binary number and divide it into groups of 4 bits starting from the right hand side , if no group of 4 exists fill out leading 0's, then convert each group of 4 to a hex n

What is the use of FIFOs in client-server applications