Question 1

Those processes should be aborted on occurrence of a deadlock, the termination of which?

Accepted Answer

A) is more time consuming 
B) incurs minimum cost 
C) safety is not hampered 
D) all of the mentioned 
A) is more time consuming 
B) incurs minimum cost 
C) safety is not hampered 
D) all of the mentioned B

Question 2

The data structures available in the Banker's algorithm are___________

Accepted Answer

A) available 
B) need 
C) allocation 
D) all of the mentioned 
A) available 
B) need 
C) allocation 
D) all of the mentioned D

Question 3

What is the disadvantage of invoking the detection algorithm for every request?

Accepted Answer

A) overhead of the detection algorithm due to consumption of memory 
B) excessive time consumed in the request to be allocated memory 
C) considerable overhead in computation time 
D) all of the mentioned 
A) overhead of the detection algorithm due to consumption of memory 
B) excessive time consumed in the request to be allocated memory 
C) considerable overhead in computation time 
D) all of the mentioned C

Question 4

If deadlocks occur frequently, the detection algorithm must be invoked___________

Accepted Answer

A) rarely 
B) frequently 
C) rarely & frequently 
D) none of the mentioned 
A) rarely 
B) frequently 
C) rarely & frequently 
D) none of the mentioned

Question 5

If the wait for graph contains a cycle

Accepted Answer

A) then a deadlock does not exist 
B) then a deadlock exists 
C) then the system is in a safe state 
D) either deadlock exists or system is in a safe state 
A) then a deadlock does not exist 
B) then a deadlock exists 
C) then the system is in a safe state 
D) either deadlock exists or system is in a safe state

Question 6

The two ways of aborting processes and eliminating deadlocks are___________

Accepted Answer

A) abort all deadlocked processes 
B) abort all processes 
C) abort one process at a time until the deadlock cycle is eliminated 
D) all of the mentioned 
A) abort all deadlocked processes 
B) abort all processes 
C) abort one process at a time until the deadlock cycle is eliminated 
D) all of the mentioned

Question 7

What is Address Binding?

Accepted Answer

A) going to an address in memory 
B) locating an address with the help of another address 
C) binding two addresses together to form a new address in a different memory space 
D) a mapping from one address space to another 
A) going to an address in memory 
B) locating an address with the help of another address 
C) binding two addresses together to form a new address in a different memory space 
D) a mapping from one address space to another

Question 8

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock___________

Accepted Answer

A) can never occur 
B) may occur 
C) has to occur 
D) none of the mentioned 
A) can never occur 
B) may occur 
C) has to occur 
D) none of the mentioned

Question 9

The resource allocation graph is not applicable to a resource allocation system

Accepted Answer

A) with multiple instances of each resource type 
B) with a single instance of each resource type 
C) single & multiple instances of each resource type 
D) none of the mentioned 
A) with multiple instances of each resource type 
B) with a single instance of each resource type 
C) single & multiple instances of each resource type 
D) none of the mentioned

Question 10

A deadlock eventually cripples system throughput and will cause the CPU utilization to___________

Accepted Answer

A) increase 
B) drop 
C) stay still 
D) none of the mentioned 
A) increase 
B) drop 
C) stay still 
D) none of the mentioned

Question 11

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is?

Accepted Answer

A) 2 
B) 3 
C) 4 
D) 1 
A) 2 
B) 3 
C) 4 
D) 1

Question 12

To___________to a safe state, the system needs to keep more information about the states of processes.

Accepted Answer

A) abort the process 
B) roll back the process 
C) queue the process 
D) none of the mentioned 
A) abort the process 
B) roll back the process 
C) queue the process 
D) none of the mentioned

Question 13

'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum of all their maximum needs is always less than m+n. In this setup, deadlock___________

Accepted Answer

A) can never occur 
B) may occur 
C) has to occur 
D) none of the mentioned 
A) can never occur 
B) may occur 
C) has to occur 
D) none of the mentioned

Question 14

The wait-for graph is a deadlock detection algorithm that is applicable when

Accepted Answer

A) all resources have a single instance 
B) all resources have multiple instances 
C) all resources have a single 7 multiple instances 
D) all of the mentioned 
A) all resources have a single instance 
B) all resources have multiple instances 
C) all resources have a single 7 multiple instances 
D) all of the mentioned

Question 15

A deadlock can be broken by

Accepted Answer

A) abort one or more processes to break the circular wait 
B) abort all the process in the system 
C) preempt all resources from all processes 
D) none of the mentioned 
A) abort one or more processes to break the circular wait 
B) abort all the process in the system 
C) preempt all resources from all processes 
D) none of the mentioned

Question 16

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify

Accepted Answer

A) the set of processes that have been deadlocked 
B) the set of processes in the deadlock queue 
C) the specific process that caused the deadlock 
D) all of the mentioned 
A) the set of processes that have been deadlocked 
B) the set of processes in the deadlock queue 
C) the specific process that caused the deadlock 
D) all of the mentioned

Question 17

The process to be aborted is chosen on the basis of the following factors?

Accepted Answer

A) priority of the process 
B) process is interactive or batch 
C) how long the process has computed 
D) all of the mentioned 
A) priority of the process 
B) process is interactive or batch 
C) how long the process has computed 
D) all of the mentioned

Question 18

If the resources are always preempted from the same process___________      can occur.

Accepted Answer

A) deadlock 
B) system crash 
C) aging 
D) starvation 
A) deadlock 
B) system crash 
C) aging 
D) starvation

Question 19

An edge from process Pi to Pj in a wait for graph indicates that___________

Accepted Answer

A) pi is waiting for pj to release a resource that pi needs 
B) pj is waiting for pi to release a resource that pj needs 
C) pi is waiting for pj to leave the system 
D) pj is waiting for pi to leave the system 
A) pi is waiting for pj to release a resource that pi needs 
B) pj is waiting for pi to release a resource that pj needs 
C) pi is waiting for pj to leave the system 
D) pj is waiting for pi to leave the system

Question 20

Cost factors for process termination include___________

Accepted Answer

A) number of resources the deadlock process is not holding 
B) cpu utilization at the time of deadlock 
C) amount of time a deadlocked process has thus far consumed during its execution 
D) all of the mentioned 
A) number of resources the deadlock process is not holding 
B) cpu utilization at the time of deadlock 
C) amount of time a deadlocked process has thus far consumed during its execution 
D) all of the mentioned

Exam 14: Deadlock and Resource Allocation in Computer Systems

Those processes should be aborted on occurrence of a deadlock, the termination of which?

The data structures available in the Banker's algorithm are___________

What is the disadvantage of invoking the detection algorithm for every request?

If deadlocks occur frequently, the detection algorithm must be invoked___________

If the wait for graph contains a cycle

The two ways of aborting processes and eliminating deadlocks are___________

What is Address Binding?

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock___________

The resource allocation graph is not applicable to a resource allocation system

A deadlock eventually cripples system throughput and will cause the CPU utilization to___________

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is?

To___________to a safe state, the system needs to keep more information about the states of processes.

'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum of all their maximum needs is always less than m+n. In this setup, deadlock___________

The wait-for graph is a deadlock detection algorithm that is applicable when

A deadlock can be broken by

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify

The process to be aborted is chosen on the basis of the following factors?

If the resources are always preempted from the same process___________ can occur.

An edge from process Pi to Pj in a wait for graph indicates that___________

Cost factors for process termination include___________

Operating System

Operating System and Software

Operating System and Computer Basics: Formatting, Clipboard, Radio Buttons, Bankers Algorithm, and More

Computer Software and Operating System

Processor and Memory Fundamentals

Computer Architecture and Memory

Computer Science and Information Technology on Raid, Middleware, and CPU Scheduling

Understanding Process Scheduling in Operating Systems

Operating System and Process Management

Process Scheduling and Synchronization in Multi-Programming Environment

Process Management and Interprocess Communication in Unix

Semaphores, Spinlocks, and Monitors: Understanding Synchronization in Operating Systems

Concurrency Control and Deadlock Prevention in Operating Systems

Memory Management and Swapping Techniques

Memory Management in Operating Systems

Understanding Paging and Memory Management in Operating Systems

Understanding Virtual Memory and Page Replacement Algorithms

Virtual Memory, Segmentation, and Disk Management

Disk Management and I/O Subsystem

Linux Kernel and System Structures

Thread Management and Synchronization in Operating Systems

Operating System Concepts: System Calls, Threads, and Signals

Operating System and Thread Pool

Operating System and Memory Management

Process Control and Memory Management

Linux Kernel, File Systems, Bootloaders and Distributions

Filters