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. AS1 S2 and S3 are true
2. BS1, S3 false and S2 is true
3. CS1, S2 are false and S3 is true
4. DS1,S2 and S3 are false

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. S1, S3 false and S2 is true

Explanation

LRU is a stack algorithm, so it never shows Belady's anomaly (S1 false). SRTF can starve long jobs (S2 true). Each thread has its own stack; threads share code, data and files (S3 false).