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.S1, S2 and S3 are true
2.S1, S3 false and S2 is true ✓ Correct
3.S1, S2 are false and S3 is true
4.S1, S2 and S3 are false
Solution
The correct answer is S1, S3 false and S2 is true
Key Points
- S1: LRU (Least Recently Used) page replacement algorithm suffers from belady's anomaly. False -
- The LRU (Least Recently Used) page replacement algorithm does not suffer from Belady's anomaly.
- Belady's anomaly is the phenomenon where increasing the number of page frames results in an increase in the number of page faults.
- This anomaly is typically associated with the FIFO (First-in, First-out) page replacement algorithm, not with LRU.
- S2: Shortest remaining time first scheduling may cause starvations. True -
- The Shortest Remaining Time First (SRTF) scheduling algorithm can indeed cause starvation.
- This happens when short processes keep coming. This can indefinitely postpone the execution of longer processes, leading to their starvation.
- S3: Stack is shared by all threads in a process. False -
- In a multithreaded process, each thread has its own separate stack space.
- This is necessary to keep track of the execution state for each individual thread.
- Other parts of the process such as the heap, global variables, and code segment are shared among all threads.
So, according to the given statements: S1: False S2: True S3: False
The appropriate choice is: 2) S1, S3 false and S2 is true.
