edited by
340 views
0 votes
0 votes

Consider the following statements:

S1: LRU page replacement algorithm suffers from the belady's anomaly

S2: Shortest remaining time first scheduling may cause starvations

S3: Stack is shared by all threads in a process

  1. $\mathrm{S} 1 \mathrm{~S} 2$ and $\mathrm{S} 3$ are true
  2. $\mathrm{S} 1, \mathrm{~S} 3$ false and $\mathrm{S} 2$ is true
  3. $\mathrm{S} 1, \mathrm{~S} 2$ are false and $\mathrm{S} 3$ is true
  4. $\text{S1, S2}$ and $\mathrm{S} 3$ are false
edited by

1 Answer

Related questions

501
views
1 answers
0 votes
admin asked Jul 28, 2023
501 views
What is the output of following code?main () struct s1 { char * z; int i; struct s1 * p; } static struct s 1 a []}={ {"Nagpur", 1, a+1} {"Raipur', 2, a+2} {"Kanpur', 3, a...
356
views
0 answers
0 votes
admin asked Jul 28, 2023
356 views
Which of the following statement is correct?Ackermann's function is primitive recursive.$L=\left\{a^{n} b^{k} c^{n+k}: n \geq 0, k \geq 0\right\}$ is regular language.$L=...
202
views
0 answers
0 votes
admin asked Jul 28, 2023
202 views
There are $M$ points on one straight line $A B$ and $n$ points on another straight line $A C$ none of them being $A$. How many triangles can be formed with these points a...
444
views
1 answers
0 votes
admin asked Jul 28, 2023
444 views
Consider the following statements.The identity is unique in any monoid.A monoid is a group if there exists inverse of each element of monoid.Semi group has closure, assoc...