Consider a swapping system in which the memory consists of the following hole sizes: 10 K, 4 K,
20 K, 15 K, 9 K. Assume first fit algorithm is used. Which holes are taken for successive
segment requests of 8 K, 12 K, 10 K? *
A.None of the other choices
B. 10 K, 20 K, 15 K
C. 9 K, 15 K, 10 K
D. 20 K, 15 K, 4 K - Answers B
Which of the following information bits in the entry of page table is used to indicate Page Fault?
*
A.Present/absent bit
B. Status bit
C. Referenced bit
D .Modified bit - Answers A
To specify an address in this segmented memory, the _____ form is used *
A <virtual address, offset>
B <process, offset>
C <physical address, offset>
D <segment-number, offset> - Answers D
Page replacement algorithms determine
A Which pages should be brought into memory because a process is likely to reference them
soon
B Which page to remove to provide space for an incoming page
, C How many pages should be added to the main memory
D When the system should update page table entries - Answers B
The page table for each process maintains _________ .
A) the physical memory location of the process
B) the frame location for each page of the process
C) the page location for each frame of the process
D) the logical memory location of the process - Answers B
The modified/dirty bit is used for the purpose of: *
A. None of the other choices
B. Implementing FIFO page replacement algorithm
C. Dynamic allocation of memory used by one process to another
D. Reduce the average time required to service page faults - Answers D
There are ____ entries per page in the Page table: *
A4
B3
C1
D 2 - Answers C
Consider a swapping system in which the memory consists of the following hole sizes: 10K, 4K,
20K, 15K, 9K. Assume best fit algorithm is used. Which holes are taken for successive segment
requests of 8K, 12K, 10K? *
A 9K, 15K, 10K
B 10K, 20K, 15K