Question

The replacement policy that represents a compromise between reasonably low overhead combined with relatively good performance is known as:

	Optimal Policy
	Least recently used (LRU) policy
	Clock policy
	None of these are the described replacement policy

An important choice in the design of the memory management portion of an operating system is:

	Whether or not to use virtual memory techniques
	Whether to use paging; segmentation or a combination of the two
	The algorithms employed for various aspects of memory management; such as the page replacement decision
	All of these are important design choices

In the Dynamic Partitioning technique of memory management; compaction refers to shifting the processes into a contiguous block; resulting in all the free memory aggregated into a single block.

	True
	False

In the Dynamic Partitioning technique of memory management; the placement algorithm that chooses the block that is closest in size to the request is called:

	Next-fit
	First-fit
	Best-fit
	None of these are the correct name of the placement algorithm

In the Dynamic Partitioning technique of memory management; the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called:

	Next-fit
	First-Fit
	Best-fit
	None of these are the correct name of the placement algorithm

Answer 1

1.b least recently used lru policy

2 d all of these design choice

3 true

4 best fit

5 next fit