Quiz 2

________ as a situation in which every process in a set of processes is waiting for an event that can be caused only by another process in the set.

• Deadlock

• Segmentation

• Paging

• Scheduling

Under the normal mode of operation, a thread may utilize a resource in

only the following sequence: Request - Use - Release

• True

• False

At least one resource must be held in a nonsharable

mode; that is, only one thread at a time can use the resource is known as ________.

• Hold and wait

• No preemption

• Circular wait

• Mutual exclusion

A thread must be holding at least one resource and

waiting to acquire additional resources that are currently being held by

other threads is known as _______.

• No preemption

• Mutual exclusion

• Circular wait

• Hold and wait

Deadlocks can be described more precisely in terms of a directed graph called

a system _______.

• resource-allocation graph

• node-allocation graph

• edge-allocation graph

• acyclic graph

_______ provides a

set of methods to ensure that at least one of the necessary conditions cannot hold.

• Deadlock detection

• Deadlock prevention

• Deadlock avoidance

• Deadlock allocation

_______ requires that the operating system be given additional

information in advance concerning which resources a thread will request

and use during its lifetime.

• Deadlock avoidance

• Deadlock prevention

• Deadlock allocation

• Deadlock detection

In ___________, each process is contained in a single section of memory that is contiguous to the section containing the next process.

• Swapping

• contiguous memory allocation

• memory allocation

• paging

One solution to the problem of external fragmentation is ______.

• paging

• compaction

• segmentation

• dynamic memory allocation

_______ makes it possible for the total physical address space of all processes to exceed the real physical memory of the system, thus increasing the degree of multiprogramming in a system.

• Disk scheduling

• Paging

• Hardware unit

• Swapping