edited by
515 views
0 votes
0 votes

 

An $\text{OS}$ follows round-robin scheduling with time quantum of $4 \mathrm{~ms}$. Assuming that the $\mathrm{CPU}$ is free now and there are $20$ processes waiting in the ready queue, the maximum amount of time that a process waits before getting into the $\mathrm{CPU}$ is

  1. $80 \mathrm{~ms}$
  2. $76 \mathrm{~ms}$
  3. $84 \mathrm{~ms}$
  4. None of the above

(Option $1[39649]) 1$
(Option $2[39650]) 2$
(Option $3[39651]) 3$
(Option $4[39652]) 4$

Answer Given by Candidate: $2$

edited by

1 Answer

0 votes
0 votes
The $20^{th}$ process will get started after quantum expiration of $19^{th}$ process.

Thus $20^{th}$ process will be delayed by $19*4 = 76ms$

Related questions

1.4k
views
2 answers
0 votes
admin asked May 20, 2023
1,380 views
The negation of "Some students like hockey" is:Some students dislike hockeyEvery student dislike hockeyEvery student like hockeyAll students like hockey(Option $1[39301])...
570
views
1 answers
0 votes
admin asked May 20, 2023
570 views
A relation '$R$ ' is defined on ordered pairs of integers as: $(x, y) R(u, v)$ if $x<u$ and $y>v$. Then $R$ isNeither a partial order nor an equivalence relationA partial...
943
views
1 answers
0 votes
admin asked May 20, 2023
943 views
Suppose you are married and you and your partner attend a party with three other married couples. Several handshakes took place. No one shook hands with himself (or herse...
537
views
1 answers
0 votes
admin asked May 20, 2023
537 views
Consider the following conditional code, which returns a Boolean valuesif $((x>25) \& \&(y>100))$return 'false';else iff $(x \leq 25) \& \& \&(y \leq 100))$return 'true';...