Question 1

Memory compression is a useful alternative to paging

Accepted Answer

A)  when the system has slow magnetic disks but not faster SSDs. 
B)  when the compression algorithm is can achieve the best possible compression ratio. 
C)  when the speed of the compression algorithm fastest. 
D)  even when the system has faster SSDs. 
A)  when the system has slow magnetic disks but not faster SSDs. 
B)  when the compression algorithm is can achieve the best possible compression ratio. 
C)  when the speed of the compression algorithm fastest. 
D)  even when the system has faster SSDs. D

Question 2

A free-frame list

Accepted Answer

A)  is a set of all frames that are filled with all zeros. 
B)  is a set of all frames that are currently unallocated to any process. 
C)  is a set of all frames that are currently being shared by at least two processes. 
D)  is a set of all frames that are used for stack and heap memory. 
A)  is a set of all frames that are filled with all zeros. 
B)  is a set of all frames that are currently unallocated to any process. 
C)  is a set of all frames that are currently being shared by at least two processes. 
D)  is a set of all frames that are used for stack and heap memory. B

Question 3

Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and a system with three page frames, what is the final configuration of the three frames after the LRU algorithm is applied?

Accepted Answer

A)  1, 3, 4 
B)  3, 1, 4 
C)  4, 1, 2 
D)  1, 2, 3 
A)  1, 3, 4 
B)  3, 1, 4 
C)  4, 1, 2 
D)  1, 2, 3 B

Question 4

How is the effective access time computed for a demand-paged memory system?

Accepted Answer

In order to compute the effective access

Question 5

The buddy system for allocating kernel memory is very likely to cause fragmentation within the allocated segments.

Accepted Answer

A) True 
 B)False

Question 6

Explain the distinction between a demand-paging system and a paging system with swapping.

Accepted Answer

A demand-paging system is similar to a p

Question 7

Stack algorithms are a class of page replacement algorithms that

Accepted Answer

A)  are implemented using stacks. 
B)  are guaranteed to incur the least number of page faults. 
C)  do not suffer from Belady's anomaly. 
D)  are guaranteed to incur no more page faults than FIFO page replacement algorithm. 
A)  are implemented using stacks. 
B)  are guaranteed to incur the least number of page faults. 
C)  do not suffer from Belady's anomaly. 
D)  are guaranteed to incur no more page faults than FIFO page replacement algorithm.

Question 8

What are the benefits of using slab allocation to allocate kernel memory?

Accepted Answer

The slab allocator provides two main ben

Question 9

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are 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?

Accepted Answer

A)  4, 1, 3 
B)  3, 1, 4 
C)  4, 2, 3 
D)  3, 4, 2 
A)  4, 1, 3 
B)  3, 1, 4 
C)  4, 2, 3 
D)  3, 4, 2

Question 10

If an instruction modifies several different locations, a page fault can be handled by

Accepted Answer

A)  using temporary registers to hold the values of overwritten locations. 
B)  loading multiple pages in advance. 
C)  incorporating special hardware. 
D)  terminating the process. 
A)  using temporary registers to hold the values of overwritten locations. 
B)  loading multiple pages in advance. 
C)  incorporating special hardware. 
D)  terminating the process.

Question 11

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string?

Accepted Answer

A)  14 
B)  8 
C)  13 
D)  10 
A)  14 
B)  8 
C)  13 
D)  10

Question 12

An advantage of virtual memory is that

Accepted Answer

A)  a program can be much larger than the size of physical memory. 
B)  the programmers can concentrate programming the problem instead of worrying about the amount of physical memory available. 
C)  it provides a way to execute a program that is only partially loaded in memory. 
D)  All of the above. 
A)  a program can be much larger than the size of physical memory. 
B)  the programmers can concentrate programming the problem instead of worrying about the amount of physical memory available. 
C)  it provides a way to execute a program that is only partially loaded in memory. 
D)  All of the above.

Question 13

In which of the following cases, performance may be improved?

Accepted Answer

A)  Designing array access pattern based on whether the arrays are stored in row major or column major order. 
B)  Placing frequently interacting components close to one another. 
C)  Avoid placing functions across page boundaries. 
D)  All of the above. 
A)  Designing array access pattern based on whether the arrays are stored in row major or column major order. 
B)  Placing frequently interacting components close to one another. 
C)  Avoid placing functions across page boundaries. 
D)  All of the above.

Question 14

Why doesn't a local replacement algorithm solve the problem of thrashing entirely?

Accepted Answer

With local replacement, if one process s

Question 15

Some operating systems provide raw disk, so that special applications can bypass file system when accessing secondary storage.

Accepted Answer

A) True 
 B)False

Question 16

Which of the following does not increase the TLB reach?

Accepted Answer

A)  Increase the size of TLB. 
B)  Increase page size. 
C)  Decrease the size working set. 
D)  Provide multiple page sizes. 
A)  Increase the size of TLB. 
B)  Increase page size. 
C)  Decrease the size working set. 
D)  Provide multiple page sizes.

Question 17

A page fault must be preceded by a TLB miss.

Accepted Answer

A) True 
 B)False

Question 18

Discuss two strategies for increasing TLB reach.

Accepted Answer

TLB reach refers to the amount of memory

Question 19

Which of the following is FALSE about reapers?

Accepted Answer

A)  They may swap out a page from a process even when that process is not running. 
B)  They may use any page replacement algorithm to swap out pages. 
C)  They may swap out pages event when there are ample free frames available. 
D)  They implement a global page replacement policy. 
A)  They may swap out a page from a process even when that process is not running. 
B)  They may use any page replacement algorithm to swap out pages. 
C)  They may swap out pages event when there are ample free frames available. 
D)  They implement a global page replacement policy.

Question 20

In Linux, a slab may only be either full or empty.

Accepted Answer

A) True 
 B)False

Memory compression is a useful alternative to paging

A free-frame list

Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and a system with three page frames, what is the final configuration of the three frames after the LRU algorithm is applied?

How is the effective access time computed for a demand-paged memory system?

The buddy system for allocating kernel memory is very likely to cause fragmentation within the allocated segments.

Explain the distinction between a demand-paging system and a paging system with swapping.

Stack algorithms are a class of page replacement algorithms that

What are the benefits of using slab allocation to allocate kernel memory?

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are 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?

If an instruction modifies several different locations, a page fault can be handled by

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string?

An advantage of virtual memory is that

In which of the following cases, performance may be improved?

Why doesn't a local replacement algorithm solve the problem of thrashing entirely?

Some operating systems provide raw disk, so that special applications can bypass file system when accessing secondary storage.

Which of the following does not increase the TLB reach?

A page fault must be preceded by a TLB miss.

Discuss two strategies for increasing TLB reach.

Which of the following is FALSE about reapers?

In Linux, a slab may only be either full or empty.

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

Memory compression is a useful alternative to paging

A free-frame list

Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and a system with three page frames, what is the final configuration of the three frames after the LRU algorithm is applied?

How is the effective access time computed for a demand-paged memory system?

The buddy system for allocating kernel memory is very likely to cause fragmentation within the allocated segments.

Explain the distinction between a demand-paging system and a paging system with swapping.

Stack algorithms are a class of page replacement algorithms that

What are the benefits of using slab allocation to allocate kernel memory?

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are 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?

If an instruction modifies several different locations, a page fault can be handled by

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string?

An advantage of virtual memory is that

In which of the following cases, performance may be improved?

Why doesn't a local replacement algorithm solve the problem of thrashing entirely?

Some operating systems provide raw disk, so that special applications can bypass file system when accessing secondary storage.

Which of the following does not increase the TLB reach?

A page fault must be preceded by a TLB miss.

Discuss two strategies for increasing TLB reach.

Which of the following is FALSE about reapers?

In Linux, a slab may only be either full or empty.

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