2. Assume there is a process with the size of 500 bytes. The order of accessing the memory address is as follows: 20,62, 103, 178, 73, 315, 155, 203, 224, 420, 443, 354.
申論題內容
(b) (8%) Assume the available memory size is 200 bytes and all frames are initially empty. How many page faults would be occurred for LRU (4%) and FIFO (4%) replacement algorithm?