Question

نقطتان (2) The lower bound on the number of page faults in case we have M page- reference string with P distinct page numbers for a process with N frames (initially all empty) is MO P+N O M+N РО Ν Ο

Answer 1

2. (e) N - is the lower bound on the number of page faults.

3. (a) 53,65,67,37,14,98,122,124,183

Explanation: According to the SSTF (Shortest Seek Time First) disk scheduling algorithm, the head seeks the block which is closest/nearest from its current position(53) to avoid unnecessary head movements.

current position 53 14 37 65 67 98 122 124 183 2 12 30 23 80 24 N 59

The number between the blocks are the number of head movements required to seek that block. for example: From 53 to 65 in 12 head movements and similarly from 65 to 67 in 2 head movements and now the closest block from 67 IS 37 and NOT 98 so it jumps from 67 to 37 requiring 30 head movements.

Thanks!

Upvote if it helped!