Question 1

____ is when each process involved in an impasse is waiting for another to voluntarily release its resources so that at least one process will be able to continue.

Accepted Answer

A)  Mutual exclusion 
B)  Resource holding 
C)  Circular wait 
D)  No preemption 
A)  Mutual exclusion 
B)  Resource holding 
C)  Circular wait 
D)  No preemption

Question 2

Once starvation has been detected,an algorithm can be implemented in which the system blocks new jobs until the starving jobs have been satisfied.

Accepted Answer

A) True 
 B)False

Question 3

When using the Banker's Algorithm,an operating system must be sure never to satisfy a request that moves it from a safe state to an unsafe one.

Accepted Answer

A) True 
 B)False

Question 4

One problem with the Banker's Algorithm is that because the algorithm assumes the worst case,vital resources can be unavailable in order to guard against unsafe states.

Accepted Answer

A) True 
 B)False

Question 5

The scheme of ____ removes the possibility of a circular wait and therefore guarantees the removal of deadlocks.

Accepted Answer

A)  hierarchical ordering 
B)  preemption 
C)  saving and restoring job state 
D)  requesting all resources before job run 
A)  hierarchical ordering 
B)  preemption 
C)  saving and restoring job state 
D)  requesting all resources before job run

Question 6

In ____ systems,deadlocks can cause critical situations.

Accepted Answer

A)  batch 
B)  interactive 
C)  real-time 
D)  general purpose 
A)  batch 
B)  interactive 
C)  real-time 
D)  general purpose

Question 7

If locks are not used to preserve data integrity,the updated records in a database may include only some of the data-and their contents depend on the order in which each process finishes its execution.

Accepted Answer

A) True 
 B)False

Question 8

Starvation is the result of a policy that liberally allocates resources.

Accepted Answer

A) True 
 B)False

Question 9

According to the Banker's Algorithm,an unsafe state always leads to deadlock.

Accepted Answer

A) True 
 B)False

Question 10

A race introduces the element of chance,which is a highly desirable attribute,in database management.

Accepted Answer

A) True 
 B)False

Question 11

When using a directed graph to model a system,if there's a cycle in the graph,then there is a deadlock involving the processes and the resources shown in the cycle.

Accepted Answer

A) True 
 B)False

Question 12

Fill in the missing step in the following deadlock situation.Two users from the local board of education are each running a program (P1 and P2),and both programs will eventually need two DVD drives to copy files from one disc to another.Only two DVD-R drives are available and they're allocated on an "as requested" basis.Soon the following sequence transpires: 
1)P1 requests drive 1 and gets it.
2)____
3)P1 requests drive 2 but is blocked.
4)P2 requests drive 1 but is blocked.

Accepted Answer

A)  P1 requests drive 2. 
B)  P2 requests drive 2 and gets it. 
C)  P2 requests drive 1 but is blocked. 
D)  P1 releases drive 1. 
A)  P1 requests drive 2. 
B)  P2 requests drive 2 and gets it. 
C)  P2 requests drive 1 but is blocked. 
D)  P1 releases drive 1.

Question 13

____ developed the Banker's Algorithm.

Accepted Answer

A)  Havender 
B)  Holt 
C)  Dijkstra 
D)  Lane & Mooney 
A)  Havender 
B)  Holt 
C)  Dijkstra 
D)  Lane & Mooney

Question 14

To recover from deadlock,a factor that is commonly considered when selecting a victim is the CPU time used by a job - jobs close to completion are usually left alone.

Accepted Answer

A) True 
 B)False

Question 15

Deadlock is a system-wide tangle of resource requests that begins when two or more jobs are put on hold,each waiting for a vital resource to become available.

Accepted Answer

A) True 
 B)False

Question 16

Deadlock can occur on a printer when ____.

Accepted Answer

A)  the network connection for the printer overflows with too many requests to use the printer 
B)  too many users attempt to access the printer at the same time 
C)  the buffer fills up with too many print jobs and the printer cannot decide which one to print 
D)  the printer needs all of a job's output before it will begin printing,but the spooling system fills the available disk space with only partially completed output 
A)  the network connection for the printer overflows with too many requests to use the printer 
B)  too many users attempt to access the printer at the same time 
C)  the buffer fills up with too many print jobs and the printer cannot decide which one to print 
D)  the printer needs all of a job's output before it will begin printing,but the spooling system fills the available disk space with only partially completed output

Question 17

____ is necessary in any computer system because some resources such as memory,CPU,and dedicated devices must be exclusively allocated to one user at a time.

Accepted Answer

A)  Mutual exclusion 
B)  Resource holding 
C)  No preemption 
D)  Circular wait 
A)  Mutual exclusion 
B)  Resource holding 
C)  No preemption 
D)  Circular wait

Question 18

____ is the policy of allowing only one process to have access to a dedicated resource.

Accepted Answer

A)  No preemption 
B)  Circular wait 
C)  Resource holding 
D)  Mutual exclusion 
A)  No preemption 
B)  Circular wait 
C)  Resource holding 
D)  Mutual exclusion

Question 19

In the dining philosophers problem,there are five philosophers and four forks.

Accepted Answer

A) True 
 B)False

____ is when each process involved in an impasse is waiting for another to voluntarily release its resources so that at least one process will be able to continue.

Once starvation has been detected,an algorithm can be implemented in which the system blocks new jobs until the starving jobs have been satisfied.

When using the Banker's Algorithm,an operating system must be sure never to satisfy a request that moves it from a safe state to an unsafe one.

One problem with the Banker's Algorithm is that because the algorithm assumes the worst case,vital resources can be unavailable in order to guard against unsafe states.

The scheme of ____ removes the possibility of a circular wait and therefore guarantees the removal of deadlocks.

In ____ systems,deadlocks can cause critical situations.

If locks are not used to preserve data integrity,the updated records in a database may include only some of the data-and their contents depend on the order in which each process finishes its execution.

Starvation is the result of a policy that liberally allocates resources.

According to the Banker's Algorithm,an unsafe state always leads to deadlock.

A race introduces the element of chance,which is a highly desirable attribute,in database management.

When using a directed graph to model a system,if there's a cycle in the graph,then there is a deadlock involving the processes and the resources shown in the cycle.

____ developed the Banker's Algorithm.

To recover from deadlock,a factor that is commonly considered when selecting a victim is the CPU time used by a job - jobs close to completion are usually left alone.

Deadlock is a system-wide tangle of resource requests that begins when two or more jobs are put on hold,each waiting for a vital resource to become available.

Deadlock can occur on a printer when ____.

____ is necessary in any computer system because some resources such as memory,CPU,and dedicated devices must be exclusively allocated to one user at a time.

____ is the policy of allowing only one process to have access to a dedicated resource.

In the dining philosophers problem,there are five philosophers and four forks.

Introducing Operating Systems

Early Memory Management Systems

Memory Management Includes Virtual Memory

Processor Management

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating Systems

Windows Operating Systems

Linux Operating Systems

Android Operating Systems

Filters

Exam 5: Process Synchronization

____ is when each process involved in an impasse is waiting for another to voluntarily release its resources so that at least one process will be able to continue.

Once starvation has been detected,an algorithm can be implemented in which the system blocks new jobs until the starving jobs have been satisfied.

When using the Banker's Algorithm,an operating system must be sure never to satisfy a request that moves it from a safe state to an unsafe one.

One problem with the Banker's Algorithm is that because the algorithm assumes the worst case,vital resources can be unavailable in order to guard against unsafe states.

The scheme of ____ removes the possibility of a circular wait and therefore guarantees the removal of deadlocks.

In ____ systems,deadlocks can cause critical situations.

If locks are not used to preserve data integrity,the updated records in a database may include only some of the data-and their contents depend on the order in which each process finishes its execution.

Starvation is the result of a policy that liberally allocates resources.

According to the Banker's Algorithm,an unsafe state always leads to deadlock.

A race introduces the element of chance,which is a highly desirable attribute,in database management.

When using a directed graph to model a system,if there's a cycle in the graph,then there is a deadlock involving the processes and the resources shown in the cycle.

____ developed the Banker's Algorithm.

To recover from deadlock,a factor that is commonly considered when selecting a victim is the CPU time used by a job - jobs close to completion are usually left alone.

Deadlock is a system-wide tangle of resource requests that begins when two or more jobs are put on hold,each waiting for a vital resource to become available.

Deadlock can occur on a printer when ____.

____ is necessary in any computer system because some resources such as memory,CPU,and dedicated devices must be exclusively allocated to one user at a time.

____ is the policy of allowing only one process to have access to a dedicated resource.

In the dining philosophers problem,there are five philosophers and four forks.

Introducing Operating Systems

Early Memory Management Systems

Memory Management Includes Virtual Memory

Processor Management

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating Systems

Windows Operating Systems

Linux Operating Systems

Android Operating Systems

Filters