OSG202 Chapter 3

Algorithm is used. Which holes are taken for successive segment requests of 8 K, 12 K, 10 K?

• None of the other choices
• 10 K, 20 K, 15 K
• 9 K, 15 K, 10 K
• 20 K, 15 K, 4 K

Which of the following information bits in the entry of page table is used to indicate Page Fault?

• Present/absent bit
• Status bit
• Referenced bit
• Modified bit

To specify an address in this segmented memory, the _____ form is used

• <virtual address, offset>

• <process, offset>

• <physical address, offset>

• <segment-number, offset>

Page replacement algorithms determine

• Which pages should be brought into memory because a process is likely to reference them soon
• Which page to remove to provide space for an incoming page
• How many pages should be added to the main memory
• When the system should update page table entries

The page table for each process maintains _________ .

• The physical memory location of the process

• The frame location for each page of the process

• The page location for each frame of the process

• The logical memory location of the process

The modified/dirty bit is used for the purpose of:

• None of the other choices
• Implementing FIFO page replacement algorithm
• Dynamic allocation of memory used by one process to another
• Reduce the average time required to service page faults

There are ____ entries per page in the Page table:

• 4
• 3
• 1
• 2

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? *

• 9K, 15K, 10K
• 10K, 20K, 15K
• 10K, 15K, 20K
• 20K, 15K, 10K

When a virtual memory system manages memory in fixed-length units, which of the following terms correctly represents its unit?

• Segment
• Block
• Page
• Frame

Which of these statements about the algorithm "First fit" is true?

• Memory Manager starting searching the list of segments from the place where it left off last time.
• Memory Manager searches the entire list of segments from beginning to end and takes the smallest hole that is adequate.
• None of the choices
• Memory Manager scans along with the list of segments until it finds a hole that is big enough.