Question

In a system employing a paging scheme for memory management; wasted space is due to:

	External fragmentation
	Internal fragmentation
	Pages and frames of different specified sizes
	None of these are reasons for wasted space in a paging scheme

The page table for each process maintains:

	The frame location for each page of the process
	The page location for each frame of the process
	The physical memory location of the process
	None of these are what the page table maintains

The real address of a word in memory is translated from the following portions of a virtual address:

	Page number and frame number
	Page number and offset
	Frame number and offset
	None of these are how a virtual address is translated to a real address

The replacement policy that can be implemented in practice and performs the best among the replacement policies that can be actually coded is:

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

A reference to a memory location independent of the current assignment of data to memory is called a(n):

	Special address
	Logical address
	Absolute address
	None of these are the name for this type of memory reference

Answer 1

ANSWER 1:

-----------------------

Paging overcomes external fragmentation but there will be "internal fragmentation" possible.

INTERNAL FRAGMENTATION.

Answer 2:

------------------

"The frame location for each page of the process".

Every entry of page table maintains frame location of the page of the process.

Answer 3:

-----------------

"Page number and offset".

Virtual address contains page number and offset, by using page table , frame number will be generated in which desired word(data) is present.

Answer4:

---------------------

"Least recently used (LRU) policy"

LRU is the best as we can implement optimal in practical.

Answer 5:

---------------

"Logical address"