Question 1

Many of today's personal computer systems ignore deadlock because ________.

Accepted Answer

A)  the processor time required to check for deadlocks can significantly reduce system performance 
B)  they do not perform many concurrent operations that could lead to deadlock 
C)  the number of resources that operating systems must manage is decreasing dramatically 
D)  all of the above 
A)  the processor time required to check for deadlocks can significantly reduce system performance 
B)  they do not perform many concurrent operations that could lead to deadlock 
C)  the number of resources that operating systems must manage is decreasing dramatically 
D)  all of the above A

Question 2

The strategy of denying the "no-preemption" condition could lead to ________.

Accepted Answer

A)  indefinite postponement 
B)  loss of work 
C)  poor resource utilization 
D)  both a and b 
A)  indefinite postponement 
B)  loss of work 
C)  poor resource utilization 
D)  both a and b D

Question 3

________ code is not modified as it executes and may be shared by several processes simultaneously.

Accepted Answer

A)  Preemptible 
B)  Dynamic 
C)  Reentrant 
D)  Serially reusable 
A)  Preemptible 
B)  Dynamic 
C)  Reentrant 
D)  Serially reusable C

Question 4

Which of the following complicates deadlock recovery?

Accepted Answer

A)  It may not be clear that the system has become deadlocked. 
B)  Most systems do not provide the means to suspend a process indefinitely. 
C)  The deadlock could involve many processes. 
D)  all of the above 
A)  It may not be clear that the system has become deadlocked. 
B)  Most systems do not provide the means to suspend a process indefinitely. 
C)  The deadlock could involve many processes. 
D)  all of the above

Question 5

To avoid deadlock in spooling systems, a system can ________.

Accepted Answer

A)  provide considerably more space for spooling files than is likely to be needed 
B)  restrain the input spoolers so that they do not accept additional print jobs when the spooling files approach some saturation threshold 
C)  allow printing to begin before the job is completed so that a full, or nearly full, spooling file can begin emptying while a job is still executing 
D)  all of the above 
A)  provide considerably more space for spooling files than is likely to be needed 
B)  restrain the input spoolers so that they do not accept additional print jobs when the spooling files approach some saturation threshold 
C)  allow printing to begin before the job is completed so that a full, or nearly full, spooling file can begin emptying while a job is still executing 
D)  all of the above

Question 6

To ensure that data in a database remains in a consistent state when deadlocked processes are terminated, database systems typically perform resource allocations using ________.

Accepted Answer

A)  checkpoints 
B)  rollback 
C)  aging 
D)  transactions 
A)  checkpoints 
B)  rollback 
C)  aging 
D)  transactions

Question 7

Most deadlocks in operating systems develop because of the normal contention for _________ .

Accepted Answer

A)  dedicated resources 
B)  processors 
C)  main memory 
D)  device drivers 
A)  dedicated resources 
B)  processors 
C)  main memory 
D)  device drivers

Question 8

In a resource-allocation graph, an arrow points from a ________ to a ________ to indicate that the system has allocated a specific resource of a specific type to the process.

Accepted Answer

A)  square, large circle 
B)  square, small circle 
C)  large circle, square 
D)  small circle, square 
A)  square, large circle 
B)  square, small circle 
C)  large circle, square 
D)  small circle, square

Question 9

Consider the following system state:
  The system will enter an unsafe state if ________.

Accepted Answer

A)  process P1 is allocated one additional resource 
B)  process P2 is allocated two additional resources 
C)  process P3 is allocated three additional resources 
D)  process P2 is allocated one additional resource 
A)  process P1 is allocated one additional resource 
B)  process P2 is allocated two additional resources 
C)  process P3 is allocated three additional resources 
D)  process P2 is allocated one additional resource

Question 10

The solution to the Dining Philosophers problem must ________.

Accepted Answer

A)  prevent deadlock 
B)  prevent starvation 
C)  ensure mutual exclusion 
D)  all of the above 
A)  prevent deadlock 
B)  prevent starvation 
C)  ensure mutual exclusion 
D)  all of the above

Question 11

________ is characteristic of deadlocked systems.

Accepted Answer

A)  Starvation 
B)  Circular waiting 
C)  Saturation 
D)  Aging 
A)  Starvation 
B)  Circular waiting 
C)  Saturation 
D)  Aging

Question 12

Which of the following is not a condition necessary for deadlock to exist?

Accepted Answer

A)  wait-for condition 
B)  mutual-exclusion condition 
C)  circular-wait condition 
D)  indefinite-postponement condition 
A)  wait-for condition 
B)  mutual-exclusion condition 
C)  circular-wait condition 
D)  indefinite-postponement condition

Question 13

Which of the following is not a major area of deadlock research?

Accepted Answer

A)  prevention 
B)  avoidance 
C)  recovery 
D)  none of the above 
A)  prevention 
B)  avoidance 
C)  recovery 
D)  none of the above

Question 14

Dijkstra's Banker's Algorithm requires the system to maintain ________ for each process.

Accepted Answer

A)  a count of the system's total resources 
B)  the maximum resources that can be requested 
C)  the current loan 
D)  both b and c 
A)  a count of the system's total resources 
B)  the maximum resources that can be requested 
C)  the current loan 
D)  both b and c

Question 15

Deadlock will continue to be an important area of research in current and future systems because ________.

Accepted Answer

A)  large-scale systems are becoming more oriented toward asynchronous parallel operations 
B)  small, portable devices, for which users cannot rely on an administrator to detect and rid a system of deadlock, are becoming more prevalent 
C)  there is an increasing tendency of operating systems designers to view data as a resource that must be managed carefully 
D)  all of the above 
A)  large-scale systems are becoming more oriented toward asynchronous parallel operations 
B)  small, portable devices, for which users cannot rely on an administrator to detect and rid a system of deadlock, are becoming more prevalent 
C)  there is an increasing tendency of operating systems designers to view data as a resource that must be managed carefully 
D)  all of the above

Question 16

________ resources are the kinds that tend to become involved in deadlocks.

Accepted Answer

A)  Preemptible 
B)  Serially reusable 
C)  Reentrant 
D)  all of the above 
A)  Preemptible 
B)  Serially reusable 
C)  Reentrant 
D)  all of the above

Question 17

The strategy of denying the "circular-wait" condition ________.

Accepted Answer

A)  is a deadlock prevention technique that promotes portability 
B)  creates a linear ordering of resources 
C)  maximizes resource utilization 
D)  none of the above 
A)  is a deadlock prevention technique that promotes portability 
B)  creates a linear ordering of resources 
C)  maximizes resource utilization 
D)  none of the above

Question 18

Deadlock can occur ________.

Accepted Answer

A)  only between two or more threads 
B)  only on multiprogrammed systems 
C)  only if resource sharing is allowed 
D)  none of the above 
A)  only between two or more threads 
B)  only on multiprogrammed systems 
C)  only if resource sharing is allowed 
D)  none of the above

Question 19

________ imposes less stringent conditions than deadlock prevention in an attempt to get better resource utilization while stopping deadlock from occurring.

Accepted Answer

A)  Deadlock avoidance 
B)  Deadlock detection 
C)  Deadlock recovery 
D)  both a and c 
A)  Deadlock avoidance 
B)  Deadlock detection 
C)  Deadlock recovery 
D)  both a and c

Question 20

________ is a weakness of the Banker's Algorithm.

Accepted Answer

A)  Allowing the population of processes to vary over time 
B)  Enabling processes to hold their resources indefinitely 
C)  Requiring that processes state their maximum needs in advance 
D)  Enabling the number of resources to fluctuate 
A)  Allowing the population of processes to vary over time 
B)  Enabling processes to hold their resources indefinitely 
C)  Requiring that processes state their maximum needs in advance 
D)  Enabling the number of resources to fluctuate

Exam 7: Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Many of today's personal computer systems ignore deadlock because ________.

The strategy of denying the "no-preemption" condition could lead to ________.

________ code is not modified as it executes and may be shared by several processes simultaneously.

Which of the following complicates deadlock recovery?

To avoid deadlock in spooling systems, a system can ________.

To ensure that data in a database remains in a consistent state when deadlocked processes are terminated, database systems typically perform resource allocations using ________.

Most deadlocks in operating systems develop because of the normal contention for _________ .

In a resource-allocation graph, an arrow points from a ________ to a ________ to indicate that the system has allocated a specific resource of a specific type to the process.

Consider the following system state: The system will enter an unsafe state if ________.

The solution to the Dining Philosophers problem must ________.

________ is characteristic of deadlocked systems.

Which of the following is not a condition necessary for deadlock to exist?

Which of the following is not a major area of deadlock research?

Dijkstra's Banker's Algorithm requires the system to maintain ________ for each process.

Deadlock will continue to be an important area of research in current and future systems because ________.

________ resources are the kinds that tend to become involved in deadlocks.

The strategy of denying the "circular-wait" condition ________.

Deadlock can occur ________.

________ imposes less stringent conditions than deadlock prevention in an attempt to get better resource utilization while stopping deadlock from occurring.

________ is a weakness of the Banker's Algorithm.

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Exploring Thread Synchronization and Mutual Exclusion in Java

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Memory Management and Page Replacement Strategies in Operating Systems

Disk Storage and Raid Technology

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding Multiprocessor Organizations and System Performance

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters

In a resource-allocation graph, an arrow points from a to a to indicate that the system has allocated a specific resource of a specific type to the process.