Test: File System & Device Management- 1 - Computer Science Engineering (CSE) MCQ

It is due to Belady’s Anomaly in which more frames may sometimes lead to more page fault.

There are two types of page replacement algorithm mainly stack based and non-stack based, it is observed that algorithms which follows the latter one suffers from Belady’s anomaly. FIFO suffers from Belady's anomaly.

SCAN is a disk scheduling algorithm:

• Batch processing can be successfully done by FIFO without starvation.
• Round Robin work son times haring mechanism.
• Interrupt processing (means interrupted process to be handled, last in first out). (LIFO)

When to increase multi-programming, a lot of processes are brought into memory. Then, what happens is, no process gets enough memory space and processor needs to keep bringing new pages into the memory to satisfy the requests. (A lot of page faults occurs). This process of excessive page replacements is called thrashing, which in turn reduces the overall performance.

Data block of a very large file in the UNIX file system are allocated using an extersion of induced allocation.

So, 10 page faults.

So, 6 page faults and 2 page hit.