Operating system

Ref 1 2 3 4 1 2 5 1 2 3 4 5 Page b. Consider now the FIFO page replacement algorithm. Fill in the table showing the page fault. How many page faults are there? c. Assume that there is an extra page frame to be used in (b). How many page faults do you have now? Compare with the number of page fault in (b)...what can you conclude? d. Consider again the LRU replacement policy, and the original reference stream. What is the minimum memory size (in pages) such that the number of faults to be no larger than 6? Explairn. [5 marks] [5 marks] [5 marks] e) Replace a single reference in the original reference stream (e.g., change the third reference from 3 to 1) such that to reduce the number of page faults by two when using LRU, Show the resulting reference stream and the corresponding fault in the following table: [5 marks) Ref Page a. For each of the following, answer true/false and explain your answers in not more than two sentences i. Paging leads to external fragmentation. ii. LRU exhibits the Belady anomaly ii. Two distinct page tables can have the same page table entry despite existing in separate processes. iv. Memory protection can be implemented without using an address translation mechanism v. Using a smaller page size increases the size of the page table. 3 marks each x5 [15 marks) b. Concisely disprove or support this claim: "working set size is larger during the period of good locality (as compared to the poor locality period) and hence causes thrashing c. Segmentation memory allocation techniques was invented to deal with fragmentation problems in the previous [4 marks]