Given The Following Reference String 1 2 3 4 3 2 3 4 5 1 3 4 6 2 3 4 5 3 2 1 2 5 Suppose The Proces 1 (22.67 KiB) Viewed 34 times
Given The Following Reference String 1 2 3 4 3 2 3 4 5 1 3 4 6 2 3 4 5 3 2 1 2 5 Suppose The Proces 2 (33.7 KiB) Viewed 34 times
Given the following reference string 1, 2, 3, 4, 3, 2, 3, 4, 5, 1, 3, 4, 6, 2, 3, 4, 5, 3, 2, 1, 2, 5 suppose the process is given 3 frames only, then under LRU page-replacement algorithm we have O a. 15 page faults O b. 9 page faults O c. 12 page faults O d. 16 page faults O N
Under 2-level paging scheme, 32-bits physical addressing scheme, for the given division in logical address space, page size equals page number page offset p2 pl 10 10 O a. 2k bytes O b. 1 Mbytes O c. 1 k bytes O d. 4k bytes d 12
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!