Register
Filter

Answers by Vegeta

1 votes
1
CPU utilization
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. $\frac{p}{n}$ b. $p^{n}$ c. $1-p^{n}$ d. $n-p^{n}$
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. $\frac{p}{n}$b. $p^{n}$c. $1-p^{n}$d. $n-p^{n}$
0 votes
2
Scheduling Overheads
Consider three processes that require 10, 20, 30 units and arrive at time 0, 2, 4. The number of scheduling overheads needed using S.R.T.F. scheduling is I think answer is 1 at time t = 10
Consider three processes that require 10, 20, 30 units and arrive at time 0, 2, 4. The number of scheduling overheads needed using S.R.T.F. scheduling is I think answer i...
0 votes
3
ACE MOCK TEST
0 votes
5
Token
How many tokens are there? 1) int a /*b 2) printf ("%
How many tokens are there?1) int a /*b2) printf ("%
2 votes
6
doubt in logarithm
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?