Paging
1.

The advantage of pages in paging is

A.  

no logical relation with program

B.  

no need of entire segment of task in physical memory

C.  

reduction of memory requirement for task

D.  

all of the mentioned

2.

The size of the pages in the paging scheme is

A.  

variable

B.  

fixed

C.  

both variable and fixed

D.  

none

3.

To convert linear addresses into physical addresses, the mechanism that the paging unit uses is

A.  

linear conversion mechanism

B.  

one level table mechanism

C.  

physical conversion mechanism

D.  

two level table mechanism

4.

The control register that stores the 32-bit linear address, at which the previous page fault is detected is

A.  

CR0

B.  

CR1

C.  

CR2

D.  

CR3

5.

Which of the following is not a component of paging unit?

A.  

page directory

B.  

page descriptor base register

C.  

page table

D.  

page

6.

The control register that is used as page directory physical base address register is

A.  

CR0

B.  

CR1

C.  

CR2

D.  

CR3
 

7.

The bits of CR3, that are always zero are

A.  

higher 4 bits

B.  

lower 8 bits

C.  

higher 10 bits

D.  

lower 12 bits

8.

Each directory entry in page directory is maximum of

A.  

2 bytes

B.  

4 bytes

C.  

8 bytes

D.  

16 bytes

9.

The size of each page table is of

A.  

2 Kbytes

B.  

2 bytes

C.  

4 Kbytes

D.  

4 bytes

10.

The dirty bit(D) is set, before which operation is carried out

A.  

write

B.  

read

C.  

initialization

D.  

none of the mentioned