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

Memory Management Questions and Answers

31.

In internal fragmentation, memory is internal to a partition and :

Answer: B

Correct answer: is not being used

Internal fragmentation is the space inside an allocated block that the process does not use. It is allocated but wasted, which is what distinguishes it from external fragmentation, where the waste lies between blocks.

Please log in or register to report this question.

Answer: D

Correct answer: every address generated by the CPU is being checked against the relocation and limit registers

The protection is enforced by hardware on every single memory reference, so no instruction can reach outside its own region however it is written. Being in different address spaces is the consequence of that checking, not the mechanism.

Please log in or register to report this question.

Answer: C

Correct answer: It holds copies of data from main memory that are likely to be used again

Cache holds copies of recently or frequently used data and instructions from main memory, so that repeat accesses are served in a few cycles rather than hundreds. It works because of the principle of locality. Temporal locality means a location just used is likely to be used again shortly; spatial locality means neighbouring locations are likely to be needed next, which is why data is fetched in whole cache lines rather than single bytes. It is faster and smaller than main memory, not slower and larger, so the third option is exactly backwards - it is built from SRAM, which uses several transistors per bit and needs no refreshing, against the single capacitor of DRAM. It is managed entirely by hardware and is transparent to the programmer, unlike main memory, which the operating system allocates, and registers, which the compiler assigns. That transparency is why cache behaviour must be inferred from performance rather than controlled directly. Modern processors use three levels, L1 through L3.

Please log in or register to report this question.

35.

In a ring topology, the data can be transmitted only if the computer possess
 

Answer: A

Correct answer: Token

In a token ring only the station holding the token may transmit, and it passes the token on when finished. That is how the topology avoids collisions without any contention.

Please log in or register to report this question.

36.

When the memory allocated to a process is slightly larger than the process, then :

Answer: A

Correct answer: internal fragmentation occurs

Memory allocated to a process but not used by it is internal fragmentation - the waste lies inside the allocation. External fragmentation is waste between allocations.

Please log in or register to report this question.

38.

Sometimes the overhead of keeping track of a hole might be :

Answer: B

Correct answer: larger than the hole itself

A hole must be recorded in the free list, and if the hole is very small the record costs more memory than the hole would ever supply. Such holes are therefore left attached to the allocated block, which converts external fragmentation into internal.

Please log in or register to report this question.

Answer: A

Correct answer: it is added to the segment base to produce the physical memory address

The logical address is a pair: the segment number selects the entry and the offset says how far into the segment. The physical address is therefore

\[ \text{physical} = \text{base} + d \]

An offset used as a physical address on its own would ignore where the segment actually sits in memory.

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