Register

waiting time for a process

791 views
2 votes
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)  

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

950
views
1 answers
0 votes
Mukesh_Kumar asked Dec 30, 2023
950 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
User Avatar
1.0k
views
1 answers
1 votes
Bhaskar Singh asked May 26, 2019
1,047 views
Why after improving implementation of semaphores we still have busy waiting time?
User Avatar
3.6k
views
0 answers
1 votes
iarnav asked Jul 11, 2018
3,618 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, ... are different than SRTF will ALWAYS have the less average waiting time over SJF?
User Avatar
911
views
1 answers
0 votes
Parshu gate asked Nov 16, 2017
911 views
Average waiting time
Fill in the blanks for the below question OS uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes.Consider the following set of processes with ... ms) of the processes is _______. 7 6.5 9 5.5
User Avatar
Link Copied!