Sample Test 3

Question 1

A set of processes is _________ when each process in the set is blocked awaiting an event that can only be triggered by another blocked process in the set.

Answer 1

deadlocked

Question 2

Examples of __________ include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.

Answer 2

reusable resources

Question 3

With _________ only one process may use a resource at a time and no process may access a resource unit that has been allocated to another process.

Answer 3

mutual exclusion

Question 4

A closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain is the condition of __________ .

Answer 4

circular wait

Question 5

Once the processes have progressed into the __________ , those processes will deadlock.

Answer 5

fatal region

Question 6

The strategy of deadlock _________ is to design a system in such a way that the possibility of deadlock is excluded.

Answer 6

prevention

Question 7

The _________ condition can be prevented by requiring that a process request all of its required resources at one time and blocking the process until all requests can be granted simultaneously.

Answer 7

hold and wait

Question 8

The fastest form of interprocess communication provided in UNIX is __________ .

Answer 8

shared memory

Question 9

The __________ condition can be prevented by defining a linear ordering of resource types.

Answer 9

circular wait

Question 10

Requested resources are granted to processes whenever possible with _________ .

Answer 10

deadlock detection

Question 11

One of the most significant contributions of UNIX to the development of operating systems is the _________ .

Answer 11

pipe

Question 12

A __________ is a software mechanism that informs a process of the occurrence of asynchronous events.

Answer 12

signal

Question 13

The most common technique used for protecting a critical section in Linux is the __________ .

Answer 13

spinlock

Question 14

The _________ allows multiple threads to have simultaneous read-only access to an object protected by the lock.

Answer 14

readers/writer lock

Question 15

The _________ is useful in sending a signal to a thread indicating that a particular event has occurred.

Answer 15

event object

Question 16

_________ can be defined as the permanent blocking of a set of processes that either compete for system resources or communicate with each other.

Answer 16

Deadlock

Question 17

A _________ resource is one that can be safely used by only one process at a time and is not depleted by that use.

Answer 17

reusable

Question 18

A _________ resource is one that can be created and destroyed.

Answer 18

consumable

Question 19

The _________ is a directed graph that depicts a state of the system of resources and processes, with each process and each resource represented by a node.

Answer 19

resource allocation graph

Question 20

Three conditions of policy must be present for a deadlock to be possible: mutual exclusion, no preemption, and _________ .

Answer 20

hold and wait

Question 21

Three general approaches exist for dealing with deadlock: prevent, avoid, and __________ .

Answer 21

detect

Question 22

__________ allows the three necessary conditions but makes judicious choices to assure that the deadlock point is never reached.

Answer 22

Deadlock avoidance

Question 23

The strategy of resource allocation denial is referred to as the ___________ .

Answer 23

banker’s algorithm

Question 24

The _________ of the system reflects the current allocation of resources to processes.

Answer 24

state

Question 25

_________ strategies are very conservative and solve the problem of deadlock by limiting access to resources and by imposing restrictions on processes.

Answer 25

Deadlock prevention

Question 26

Inspired by the concept of co-routines, a _________ is a circular buffer allowing two processes to communicate on the producer-consumer model.

Answer 26

pipe

Question 27

Two types of atomic operations are defined in Linux: integer operations and __________ .

Answer 27

bitmap operations

Question 28

Linux provides three types of semaphore facilities in the kernel: binary semaphores, counting semaphores, and __________ .

Answer 28

reader-writer semaphores

Question 29

An executable entity within a process is a __________ object.

Answer 29

thread

Question 30

A program invocation, including the address space and resources required to run the program is a __________ object.

Answer 30

process