Register

waiting time for a process

1,131 views
2 2 votes

 If  the waiting time for a process is p and there are n processes in the memory then the CPU utilization is given by,

a. p/n

b. p^n   (p raised to n)

c. 1-p^n

d. n-(p^n)  

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Normal FormNext → · #Data Hazards #Opera...
← Previous in category · Ace Test series: Ope...Next in category → · Semaphore doubt
Position:
Show:

Related questions

0 0 votes
1 1 answer
2.1k
2.1k views
Mukesh_Kumar asked Dec 30, 2023
2,125 views
Let there are 4 processes P1, P2, P3 and P4 whose arrival time is 0 milliseconds and CPU burst time are 6, 8, 7 and 3 milliseconds respectively. If the operating system uses shortest job first scheduling algorithm, then the difference between waiting time of process P3 and P₁ is 1) 3 milliseconds 2) 6 milliseconds 3) 9 milliseconds 4) 12 milliseconds
1 1 vote
1 1 answer
1.4k
1.4k views
Bhaskar Singh asked May 26, 2019
1,363 views
Why after improving implementation of semaphores we still have busy waiting time?
1 1 vote
0 0 answers
5.8k
5.8k views
iarnav asked Jul 11, 2018
5,766 views
#Galvin #CpuScheduling SJF VS SRTF Average waiting time doubt.
Let's say we have two CPU scheduling algorithm as SJF and SRTF and we have a arbitrary pool/set of processes with different ARRIVAL TIME and CPU BURST, then what CPU sch...