Page 1
1.
Explain the concept behind prepaging.
2.
What is the cause of thrashing?
3.
Suppose we have the following page accesses:
1 2 3 4 2 3 4 1 2 1 1. Suppose that there are
also three frames within our system. Using the FIFO replacement algorithm, what will be
the final configuration of the three frames following the execution of the given reference
string?
A)
1, 2, 3
B) 4, 1, 2
C) 3, 1, 2
D)
4, 2, 1
4.
Virtual memory is commonly implemented by demand paging.
A)
True
B) False
5.
Which of the following is not a consideration when determining a system's page size?
A)
Each process must have its own copy of the page table making large page sizes
desirable.
B) Memory utilization is better with smaller page sizes.
C) Fragmentation is more severe with smaller page sizes.
D)
The minimization of I/O results in the desire for larger page sizes.
6.
Explain why the optimal page replacement algorithm is not typically implemented for
real systems. If it cannot be implemented, then of what use is this algorithm?
7.
FIFO page replacement replaces the page that was the most recently swapped in.
A)
True
B) False
8.
How does the second-chance algorithm for page replacement differ from the FIFO page
replacement algorithm?
CS 471 - Assignment 6 - Student name: ___________________________________________
