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.
Multiple choice. Circle the letter of the best answer.
(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.
(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.
(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.
(a) the dynamic linking problem.
(b) the static linking problem.
(c) the internal fragmentation problem.
(d) the external fragmentation problem.
(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.
(a) reduce the amount of multiprogramming.
(b) increase the amount of multiprogramming.
(c) decrease the time slice.
(d) increase the time slice.