adplus-dvertising
frame-decoration

Question

There are ‘n’ processes in memory. A process spends a fraction ‘p’ of its time waiting for I/O to complete. The CPU utilization is given by:

a.

p^n

b.

1 - p^n

c.

(1-p)^n

d.

1-np

Answer: (b).1 - p^n

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. There are ‘n’ processes in memory. A process spends a fraction ‘p’ of its time waiting for I/O to complete. The CPU utilization is given by:

Similar Questions

Discover Related MCQs

Q. With 64 bit virtual addresses, a 4KB page and 256 MB of RAM, an inverted page table requires:

Q. A computer has 6 tape drives with ‘n’ processes competing for them. Each process may need two drives. For which values of ‘n’ is the system deadlock free ?

Q. A program has five virtual pages, numbered from 0 to 4. If the pages are referenced in the order 012301401234, with three page frames, the total number of page faults with FIFO will be equal to:

Q. Average process size=s bytes. Each page entry requires e bytes. The optimum page size is given by:

Q. The aging algorithm with a=0.5 is used to predict run times. The previous four runs from oldest to most recent are 40, 20, 20 and 15 msec. The prediction for the next time will be:

Q. Moving process from main memory to disk is called:

Q. Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:

Q. Windows is a .................. operating system.

Q. Which page replacement policy suffers from Belady’s anomaly?

Q. Cache memory is:

Q. ....................is one of pre-emptive scheduling algorithm.

Q. A software to create a Job Queue is called...................

Q. In processor management, round robin method essentially uses the preemptive version of ...................

Q. A page fault ..................

Q. .................. synchronize critical resources to prevent deadlock.

Q. The memory allocation scheme subjected to “external” fragmentation is:

Q. Producer consumer problem can be solved using:

Q. Banker’s algorithm is used for ................... purpose.

Q. Bankers algorithm is for

Q. Which is the correct definition of a valid process transition in an operating system ?