Question 1

The Second-Chance algorithm

Accepted Answer

A)  is same as FIFO algorithm if all pages in memory have been referenced at least once since the last page fault. 
B)  is same as FIFO algorithm if none of the pages in memory have been referenced since the last page fault. 
C)  is same as LRU algorithm if all pages in memory have been referenced at least once since the last page fault. 
D)  is same as LRU algorithm if none of the pages in memory have been referenced since the last page fault. 
A)  is same as FIFO algorithm if all pages in memory have been referenced at least once since the last page fault. 
B)  is same as FIFO algorithm if none of the pages in memory have been referenced since the last page fault. 
C)  is same as LRU algorithm if all pages in memory have been referenced at least once since the last page fault. 
D)  is same as LRU algorithm if none of the pages in memory have been referenced since the last page fault.

Question 2

How does the second-chance algorithm for page replacement differ from the FIFO page replacement algorithm?

Accepted Answer

The second-chance algorithm is based on

Question 3

Solaris uses both a local and global page replacement policy.

Accepted Answer

A) True 
 B)False

Question 4

Explain the usefulness of a modify bit.

Accepted Answer

A modify bit is associated with each pag

Question 5

Counting based page replacement algorithms are not commonly used, because

Accepted Answer

A)  they only approximate LRU. 
B)  they are expensive to implement, even though they incur the least number of page faults. 
C) they do not approximate OPT replacement very well and their implementation is expensive. 
D)  they do not approximate OPT replacement very well, even though they are easy to implement. 
A)  they only approximate LRU. 
B)  they are expensive to implement, even though they incur the least number of page faults. 
C) they do not approximate OPT replacement very well and their implementation is expensive. 
D)  they do not approximate OPT replacement very well, even though they are easy to implement.

Question 6

The instruction that causes a page fault needs to be re-executed after the fault has been handled.

Accepted Answer

A) True 
 B)False

Question 7

Windows uses both a local and global page replacement policy.

Accepted Answer

A) True 
 B)False

Question 8

What is the benefit of using sparse addresses in virtual memory?

Accepted Answer

Virtual address spaces that include hole

Question 9

In demand paging,

Accepted Answer

A)  a page loaded in memory may never be accessed. 
B)  all pages that a program will access during execution are loaded in memory in the beginning. 
C)  a page is loaded in memory only when it is needed during execution. 
D)  a page is loaded in memory just before it is needed. 
A)  a page loaded in memory may never be accessed. 
B)  all pages that a program will access during execution are loaded in memory in the beginning. 
C)  a page is loaded in memory only when it is needed during execution. 
D)  a page is loaded in memory just before it is needed.

Question 10

Which of the following is true about choosing an appropriate page size?

Accepted Answer

A)  Larger page size results in reducing total I/O. 
B)  Smaller page size reduces the number of page faults. 
C)  Larger page size reduces I/O time. 
D)  Larger page size results in less total allocated memory. 
A)  Larger page size results in reducing total I/O. 
B)  Smaller page size reduces the number of page faults. 
C)  Larger page size reduces I/O time. 
D)  Larger page size results in less total allocated memory.

Question 11

The most preferred method of swapping a process is

Accepted Answer

A)  to swap using the file system. 
B)  to copy an entire file to swap space at process startup and then perform demand paging from the swap space. 
C)  to demand-page from the file system initially but to write the pages to swap space as they are replaced. 
D)  None of the above. 
A)  to swap using the file system. 
B)  to copy an entire file to swap space at process startup and then perform demand paging from the swap space. 
C)  to demand-page from the file system initially but to write the pages to swap space as they are replaced. 
D)  None of the above.

Question 12

If an architecture has a move instruction with more than one word and at most one of the two operands may be an indirect memory reference, the minimum number of frames needed to run a process on this architecture is

Accepted Answer

A)  3 
B)  4 
C)  5 
D)  6 
A)  3 
B)  4 
C)  5 
D)  6

Question 13

_____ is the algorithm implemented on most systems.

Accepted Answer

A)  FIFO 
B)  Least frequently used 
C)  Most frequently used 
D)  LRU 
A)  FIFO 
B)  Least frequently used 
C)  Most frequently used 
D)  LRU

Question 14

The dirty (modify) bit identifies

Accepted Answer

A)  a page that has been corrupted. 
B)  a page that needs to be reloaded when accessed. 
C)  a page that is shared by multiple processes. 
D)  a page that has been modified since it was loaded. 
A)  a page that has been corrupted. 
B)  a page that needs to be reloaded when accessed. 
C)  a page that is shared by multiple processes. 
D)  a page that has been modified since it was loaded.

Question 15

Explain the concept behind prepaging.

Accepted Answer

Paging schemes, such as pure demand pagi

Question 16

The current best practice to avoid thrashing is to include enough physical memory.

Accepted Answer

A) True 
 B)False

Question 17

A reaper starts reclaiming pages as soon as the number of free frames falls below the maximum threshold.

Accepted Answer

A) True 
 B)False

Question 18

Anonymous memory of a process refers to

Accepted Answer

A)  the pages not associated with the binary executable file of the process. 
B)  the pages associated with the binary executable file of the process. 
C)  the pages associated with the static data of the process. 
D)  the pages that cannot be swapped out of the physical memory. 
A)  the pages not associated with the binary executable file of the process. 
B)  the pages associated with the binary executable file of the process. 
C)  the pages associated with the static data of the process. 
D)  the pages that cannot be swapped out of the physical memory.

Question 19

Optimal page replacement ____.

Accepted Answer

A)  is the page-replacement algorithm most often implemented 
B)  is used mostly for comparison with other page-replacement schemes 
C)  can suffer from Belady's anomaly 
D)  requires that the system keep track of previously used pages 
A)  is the page-replacement algorithm most often implemented 
B)  is used mostly for comparison with other page-replacement schemes 
C)  can suffer from Belady's anomaly 
D)  requires that the system keep track of previously used pages

Question 20

Explain the sequence of events that happens when a page-fault occurs.

Accepted Answer

When the operating system cannot load th

The Second-Chance algorithm

How does the second-chance algorithm for page replacement differ from the FIFO page replacement algorithm?

Solaris uses both a local and global page replacement policy.

Explain the usefulness of a modify bit.

Counting based page replacement algorithms are not commonly used, because

The instruction that causes a page fault needs to be re-executed after the fault has been handled.

Windows uses both a local and global page replacement policy.

What is the benefit of using sparse addresses in virtual memory?

In demand paging,

Which of the following is true about choosing an appropriate page size?

The most preferred method of swapping a process is

If an architecture has a move instruction with more than one word and at most one of the two operands may be an indirect memory reference, the minimum number of frames needed to run a process on this architecture is

_____ is the algorithm implemented on most systems.

The dirty (modify) bit identifies

Explain the concept behind prepaging.

The current best practice to avoid thrashing is to include enough physical memory.

A reaper starts reclaiming pages as soon as the number of free frames falls below the maximum threshold.

Anonymous memory of a process refers to

Optimal page replacement ____.

Explain the sequence of events that happens when a page-fault occurs.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Exam 10: Virtual Memory

The Second-Chance algorithm

How does the second-chance algorithm for page replacement differ from the FIFO page replacement algorithm?

Solaris uses both a local and global page replacement policy.

Explain the usefulness of a modify bit.

Counting based page replacement algorithms are not commonly used, because

The instruction that causes a page fault needs to be re-executed after the fault has been handled.

Windows uses both a local and global page replacement policy.

What is the benefit of using sparse addresses in virtual memory?

In demand paging,

Which of the following is true about choosing an appropriate page size?

The most preferred method of swapping a process is

If an architecture has a move instruction with more than one word and at most one of the two operands may be an indirect memory reference, the minimum number of frames needed to run a process on this architecture is

_____ is the algorithm implemented on most systems.

The dirty (modify) bit identifies

Explain the concept behind prepaging.

The current best practice to avoid thrashing is to include enough physical memory.

A reaper starts reclaiming pages as soon as the number of free frames falls below the maximum threshold.

Anonymous memory of a process refers to

Optimal page replacement ____.

Explain the sequence of events that happens when a page-fault occurs.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters