Question 1

The page-fault-frequency (PFF) strategy adjusts the process's resident page set ________.

Accepted Answer

A)  only after each page fault 
B)  after each memory reference 
C)  after each time a page is flushed 
D)  after a process is preempted 
A)  only after each page fault 
B)  after each memory reference 
C)  after each time a page is flushed 
D)  after a process is preempted

Question 2

Which of the following computer operations involves the highest degree of spatial locality?

Accepted Answer

A)  a traversal of a tree data structure 
B)  a traversal of a linked-list data structure 
C)  a linear array traversal 
D)  a function used for calculating a factorial 
A)  a traversal of a tree data structure 
B)  a traversal of a linked-list data structure 
C)  a linear array traversal 
D)  a function used for calculating a factorial

Question 3

A FIFO page-replacement strategy can be implemented with relatively low overhead using a ________.

Accepted Answer

A)  queue 
B)  hash table 
C)  binary tree 
D)  stack 
A)  queue 
B)  hash table 
C)  binary tree 
D)  stack

Question 4

NUR is based on the idea that ________.

Accepted Answer

A)  a page that has not been recently used is likely to be used in the near future 
B)  a page that has not been recently used is not likely to be used in the near future 
C)  a page that has been recently used is not likely to be used in the near future 
D)  none of the above 
A)  a page that has not been recently used is likely to be used in the near future 
B)  a page that has not been recently used is not likely to be used in the near future 
C)  a page that has been recently used is not likely to be used in the near future 
D)  none of the above

Question 5

The global LRU (gLRU) page-replacement strategy replaces the least-recently-used page in ________.

Accepted Answer

A)  the least-recently-executed process 
B)  the lowest-priority process 
C)  the entire system 
D)  the currently executing process 
A)  the least-recently-executed process 
B)  the lowest-priority process 
C)  the entire system 
D)  the currently executing process

Question 6

Demand paging is disadvantageous because ________.

Accepted Answer

A)  a process in a demand-paged system must accumulate pages one at a time 
B)  as a process references each new page, it must wait while the system transfers that page to main memory 
C)  system performance can suffer drastically if much of main memory is occupied by a process that cannot execute until new pages are fetched 
D)  all of the above 
A)  a process in a demand-paged system must accumulate pages one at a time 
B)  as a process references each new page, it must wait while the system transfers that page to main memory 
C)  system performance can suffer drastically if much of main memory is occupied by a process that cannot execute until new pages are fetched 
D)  all of the above

Question 7

Which of the following statements about working set memory management is false?

Accepted Answer

A)  The "true" working set of a process is the set of pages that must reside in main memory for the process to execute efficiently. 
B)  Working sets are static once a process begins executing. 
C)  A process's next working set may differ substantially from its current one. 
D)  none of the above 
A)  The "true" working set of a process is the set of pages that must reside in main memory for the process to execute efficiently. 
B)  Working sets are static once a process begins executing. 
C)  A process's next working set may differ substantially from its current one. 
D)  none of the above

Question 8

Why has the far page-replacement strategy not been implemented in real systems?

Accepted Answer

A)  It is impossible to determine a particular process's reference patterns. 
B)  The execution-time overhead it requires is too great. 
C)  It has been shown mathematically to perform at far below optimal levels. 
D)  all of the above 
A)  It is impossible to determine a particular process's reference patterns. 
B)  The execution-time overhead it requires is too great. 
C)  It has been shown mathematically to perform at far below optimal levels. 
D)  all of the above

Question 9

The far page-replacement strategy utilizes an ________ that characterizes a process's reference patterns.

Accepted Answer

A)  access list 
B)  access table 
C)  access graph 
D)  access vector 
A)  access list 
B)  access table 
C)  access graph 
D)  access vector

Question 10

________ is not important in determining the success of a prepaging strategy?

Accepted Answer

A)  The number of pages that are preloaded at once 
B)  The type of data contained in preloaded pages 
C)  The amount of main memory allocated to prepaging 
D)  The heuristic that determines which pages are preloaded 
A)  The number of pages that are preloaded at once 
B)  The type of data contained in preloaded pages 
C)  The amount of main memory allocated to prepaging 
D)  The heuristic that determines which pages are preloaded

Question 11

The least-recently-used (LRU) page-replacement strategy ________.

Accepted Answer

A)  can incur substantial overhead 
B)  always performs better than FIFO 
C)  relies on spatial locality as a heuristic for determining which pages to replace in main memory 
D)  all of the above 
A)  can incur substantial overhead 
B)  always performs better than FIFO 
C)  relies on spatial locality as a heuristic for determining which pages to replace in main memory 
D)  all of the above

Question 12

In a system containing several concurrent processes, a running process with a small working set tends to experience a ________ number of page faults as the page size ________.

Accepted Answer

A)  greater, increases 
B)  greater, decreases 
C)  constant, increases 
D)  constant, decreases 
A)  greater, increases 
B)  greater, decreases 
C)  constant, increases 
D)  constant, decreases

Question 13

________ is a technique that can improve working set page replacement by removing pages from memory a process is no longer using.

Accepted Answer

A)  Anticipatory page replacement 
B)  Voluntary page release 
C)  Asynchronous page flushing 
D)  none of the above 
A)  Anticipatory page replacement 
B)  Voluntary page release 
C)  Asynchronous page flushing 
D)  none of the above

Question 14

Under a random page replacement strategy, ________.

Accepted Answer

A)  each page in main memory has a unique likelihood of being selected for replacement 
B)  there is generally a small probability that the page that is replaced will be referenced soon 
C)  the system is consistently likely to achieve high performance 
D)  all of the above 
A)  each page in main memory has a unique likelihood of being selected for replacement 
B)  there is generally a small probability that the page that is replaced will be referenced soon 
C)  the system is consistently likely to achieve high performance 
D)  all of the above

Question 15

Which of the following activities could lead to significant overhead in a page-replacement strategy?

Accepted Answer

A)  asynchronously flushing modified pages to disk 
B)  marking pages as dirty or modified 
C)  predicting future page use to determine which pages to replace 
D)  all of the above 
A)  asynchronously flushing modified pages to disk 
B)  marking pages as dirty or modified 
C)  predicting future page use to determine which pages to replace 
D)  all of the above

The page-fault-frequency (PFF) strategy adjusts the process's resident page set ________.

Which of the following computer operations involves the highest degree of spatial locality?

A FIFO page-replacement strategy can be implemented with relatively low overhead using a ________.

NUR is based on the idea that ________.

The global LRU (gLRU) page-replacement strategy replaces the least-recently-used page in ________.

Demand paging is disadvantageous because ________.

Which of the following statements about working set memory management is false?

Why has the far page-replacement strategy not been implemented in real systems?

The far page-replacement strategy utilizes an ________ that characterizes a process's reference patterns.

________ is not important in determining the success of a prepaging strategy?

The least-recently-used (LRU) page-replacement strategy ________.

In a system containing several concurrent processes, a running process with a small working set tends to experience a number of page faults as the page size .

________ is a technique that can improve working set page replacement by removing pages from memory a process is no longer using.

Under a random page replacement strategy, ________.

Which of the following activities could lead to significant overhead in a page-replacement strategy?

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Exploring Thread Synchronization and Mutual Exclusion in Java

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Disk Storage and Raid Technology

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding Multiprocessor Organizations and System Performance

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters

Exam 11: Memory Management and Page Replacement Strategies in Operating Systems

The page-fault-frequency (PFF) strategy adjusts the process's resident page set ________.

Which of the following computer operations involves the highest degree of spatial locality?

A FIFO page-replacement strategy can be implemented with relatively low overhead using a ________.

NUR is based on the idea that ________.

The global LRU (gLRU) page-replacement strategy replaces the least-recently-used page in ________.

Demand paging is disadvantageous because ________.

Which of the following statements about working set memory management is false?

Why has the far page-replacement strategy not been implemented in real systems?

The far page-replacement strategy utilizes an ________ that characterizes a process's reference patterns.

________ is not important in determining the success of a prepaging strategy?

The least-recently-used (LRU) page-replacement strategy ________.

In a system containing several concurrent processes, a running process with a small working set tends to experience a ________ number of page faults as the page size ________.

________ is a technique that can improve working set page replacement by removing pages from memory a process is no longer using.

Under a random page replacement strategy, ________.

Which of the following activities could lead to significant overhead in a page-replacement strategy?

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Exploring Thread Synchronization and Mutual Exclusion in Java

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Disk Storage and Raid Technology

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding Multiprocessor Organizations and System Performance

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters

In a system containing several concurrent processes, a running process with a small working set tends to experience a number of page faults as the page size .