Machine-translated by Google. Questions are authored in English.
Top

Memory Management Questions and Answers

222.

In segmentation, each address is specified by :

Answer: A

Correct answer: a segment number & offset

A segmentation address names which segment and how far into it. Unlike paging, the division is supplied by the program rather than imposed by the hardware, because segments correspond to logical units such as code, stack and data.

Please log in or register to report this question.

224.

If relocation is static and is done at assembly or load time, compaction _________.

Answer: A

Correct answer: cannot be done

Compaction moves a process to a different physical address, so its addresses must be recomputed. If relocation was fixed at assembly or load time the addresses are already bound and cannot be changed, so the process cannot be moved.

Please log in or register to report this question.

Answer: D

Correct answer: slowed by a factor of 2

With the table in memory, each reference needs two accesses: one to read the page table entry and one to reach the datum. The effective access time is therefore doubled, which is precisely why the TLB exists.

Please log in or register to report this question.

228.

Which register pair is typically used to protect memory in a contiguous allocation scheme?

Answer: D

Correct answer: Base and limit registers

The base register holds the smallest physical address the process may use, and the limit register holds the size of its range. Every address generated is checked: it must be less than the limit, and the base is then added to give the physical address. The check is performed by hardware on every reference, so it costs nothing in time, and any violation traps to the operating system as an addressing error. The registers can be loaded only by a privileged instruction, executable in kernel mode alone. That is what makes the protection genuine: a user program cannot alter the bounds of its own confinement. The distinction between user and kernel mode exists largely to support arrangements of this kind. The scheme also supplies relocation, since changing the base register moves the process without altering any address within it - which is what makes swapping and compaction possible. Paging generalises the idea, replacing the single register pair with a page table.

Please log in or register to report this question.

Loading…
Tags: Memory Management Questions and Answers || Memory Management MCQ Questions and Answers || Memory Management GK Questions and Answers || Memory Management GK MCQ Questions || Memory Management Multiple Choice Questions and Answers || Memory Management GK || GK on Memory Management || Computer Awareness Questions and Answers || Computer Awareness MCQ Questions and Answers || Computer Awareness GK Questions and Answers || GK on Computer Awareness