You have devised a new page-replacement algorithm that you thinkmay be optimal. In some test cases, Belady’s anomaly occurs. Is thenew algorithm optimal? Explain your answer.
Segmentation is similar to paging but uses variable-sized“pages”.
Define two segment-replacement algorithms based on FIFO and LRUpage-replacement schemes for segmentation. Remember that sincesegments are not the same size, the segment that is chosen to bereplaced may not be big enough to leave enough consecutivelocations for the needed segment. Consider strategies for systemswhere segments cannot be relocated, and those for systems wherethey can.
****NOTE:
the ansower on cheg is not clear and we cannot read handwritting word, please type
PayPal Gateway not configured
PayPal Gateway not configured