Consider the following statements: S1: LRU page replacement algorithm suffers…
2023
Consider the following statements:
S1: LRU page replacement algorithm suffers from the Belady’s anomaly.
S2: Shortest remaining time first scheduling may cause starvation.
S3: Stack is shared by all threads in a process.
- A.
S1, S2 and S3 are true
- B.
S1, S3 are false and S2 is true
- C.
S1, S2 are false and S3 is true
- D.
S1, S2 and S3 are false
Attempted by 35 students.
Show answer & explanation
Correct answer: B
S1: LRU page replacement algorithm suffers from Belady’s anomaly. False
→ LRU is a stack algorithm, so it does NOT suffer from Belady’s anomaly.S2: Shortest remaining time first scheduling may cause starvation. True
→ Long processes may be continuously preempted by newly arriving short jobs.S3: Stack is shared by all threads in a process. False
→ Each thread has its own stack; only code, data, and heap are shared.
A video solution is available for this question — log in and enroll to watch it.