Quiz 4

Question 1

A(n) ____ page table has one page entry for each real frame of memory.

Answer 1

inverted

Question 2

Which of the following dynamic storage-allocation algorithms results in the smallest leftover hole in memory?

Answer 2

best fit

Question 3

How many page table for the whole OS?

Answer 3

One for the whole OS

Question 4

TLB is a special hardware to speed up page table search.

Answer 4

True

Question 5

There is a separate TLB for each process.

Answer 5

False

Question 6

Segmentation memory management is much faster than paging memory management.

Answer 6

False

Question 7

Without TLB, for each memory address, considering page table, how many times do we need to really access memory?

Answer 7

2

Question 8

The leftover hole in segmentation memory management is called

Answer 8

external fragmentation

Question 9

The leftover within a page is called

Answer 9

Internal Fragmentation

Question 10

When page fault happens, if there is no free frame available, the OS will report an error.

Answer 10

False