Computer Science 4630

Spring 2000

Quiz 3

 

True/false.  Write a clearly legible T to the left of each of the following that is true, and a clearly legible F to the left of each that is false.

 

  1. Virtual memory makes overlays almost entirely unnecessary.

 

  1. Virtual memory can realistically be implemented entirely in software, without any special hardware support.

 

  1. A page table is used to translate logical addresses to physical addresses.

 

  1. Spooling a printer, and using a daemon to print spooled jobs, eliminates the printer as a resource that processes contend for, and hence reduces the likelihood of deadlock.

 

  1. The main advantage of a two-level page table over a single-level page table is that the two-level table is faster to search.

 

Multiple choice.  Circle the letter of the best answer.

 

  1. Suppose that there is only one resource in each resource class.  Then a directed cycle in the resource allocation indicates that

(a)   a deadlock might occur in the future.

(b)  all processes are deadlocked.

(c)   some processes are deadlocked.

(d)  the system is safe from deadlock.

 

  1. A translation lookaside buffer is a mechanism for

(a)   speeding up processing of page faults.

(b)  speeding up lookups in the page table.

(c)   reducing the size of the page table.

(d)  reducing the frequency of page faults.

 

  1. The main difference between swapping and virtual memory is that

(a)   virtual memory allows only part of a process to be in memory,

but swapping insists that a process is either entirely in or entirely out of memory.

(b)  swapping allows only part of a process to be in memory, but virtual memory insists that a process is either entirely in or entirely out of memory.

(c)    virtual memory and swapping have nothing in common.  They are trying to solve unrelated problems.

(d)  there is no difference.  Swapping is just another name for virtual memory.

 

  1. Memory compaction is a solution to

(a)   the dynamic linking problem.

(b)  the static linking problem.

(c)   the internal fragmentation problem.

(d)  the external fragmentation problem.

 

  1. What is thrashing?

(a)   A computer is thrashing when it is running only I/O bound processes.

(b)  A computer is thrashing when it is running only compute bound processes.

(c)   A computer is thrashing when it is performing a high number of page faults per second.

(d)  A computer is thashing when it is used to harvest wheat.

 

  1. When a system detects that it is thrashing, one thing that it can do to improve performance is

(a)   reduce the amount of multiprogramming.

(b)  increase the amount of multiprogramming.

(c)   decrease the time slice.

(d)  increase the time slice.