Deck 17: Understanding Paging and Memory Management in Operating Systems

Question 1

The___________      is used as an index into the page table.

A)frame bit
B)page number
C)page offset
D)frame offset

Answer 1

page number

Question 2

The___________table contains the base address of each page in physical memory.

A)process
B)memory
C)page
D)frame

Answer 2

page

Question 3

The size of a page is typically

A)varied
B)power of 2
C)power of 4
D)none of the mentioned

Answer 3

power of 2

Question 4

The operating system maintains a___________   table that keeps track of how many frames have been allocated, how many are there, and how many are available.

A)page
B)mapping
C)frame
D)memory

Question 5

Paging increases the___________  time.

A)waiting
B)execution
C)context - switch
D)all of the mentioned

Question 6

Smaller page tables are implemented as a set of___________

A)queues
B)stacks
C)counters
D)registers

Question 7

The page table registers should be built with___________

A)very low speed logic
B)very high speed logic
C)a large memory space
D)none of the mentioned

Question 8

For larger page tables, they are kept in main memory and a___________      points to the page table.

A)page table base register
B)page table base pointer
C)page table register pointer
D)page table base

Question 9

For every process there is a___________      

A)page table
B)copy of page table
C)pointer to page table
D)all of the mentioned

Question 10

Time taken in memory access through PTBR is___________

A)extended by a factor of 3
B)extended by a factor of 2
C)slowed by a factor of 3
D)slowed by a factor of 2

Question 11

Each entry in a translation lookaside buffer (TLB) consists of___________

A)key
B)value
C)bit value
D)constant

Question 12

If a page number is not found in the TLB, then it is known as a___________

A)tlb miss
B)buffer miss
C)tlb hit
D)all of the mentioned

Question 13

An___________  uniquely identifies processes and is used to provide address space protection for that process.

A)address space locator
B)address space identifier
C)address process identifier
D)none of the mentioned

Question 14

The percentage of times a page number is found in the TLB is known as___________

A)miss ratio
B)hit ratio
C)miss percent
D)none of the mentioned

Question 15

Memory protection in a paged environment is accomplished by___________

A)protection algorithm with each page
B)restricted access rights to users
C)restriction on page visibility
D)protection bit with each page

Question 16

When the valid - invalid bit is set to valid, it means that the associated page

A)is in the tlb
B)has data in it
C)is in the process's logical address space
D)is the system's physical address space

Question 17

When there is a large logical address space, the best way of paging would be

A)not to page
B)a two level paging algorithm
C)the page table itself
D)all of the mentioned

Question 18

___________is the concept in which a process is copied into the main memory from the secondary memory according to the requirement.

A)paging
B)demand paging
C)segmentation
D)swapping

Question 19

The pager concerns with the

A)special support from hardware is required___________
B)special support from operating system is essential
C)special support from both hardware and operating system is essential
D)user programs can implement dynamic loading without any special support from hardware or operating system

Question 20

In paged memory systems, if the page size is increased, then the internal fragmentation generally___________

A)becomes less
B)becomes more
C)remains constant
D)none of the mentioned

Question 21

Swap space exists in___________

A)primary memory
B)secondary memory
C)cpu
D)none of the mentioned

Question 22

When a program tries to access a page that is mapped in address space but not loaded in physical memory, then___________

A)segmentation fault occurs
B)fatal error occurs
C)page fault occurs
D)no error occurs

Question 23

Effective access time is directly proportional to___________

A)page-fault rate
B)hit ratio
C)memory access time
D)none of the mentioned

Question 24

In FIFO page replacement algorithm, when a page must be replaced___________

A)oldest page is chosen
B)newest page is chosen
C)random page is chosen
D)none of the mentioned