Question 1

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

Accepted Answer

A) the system can allocate resources to each process in some order and still avoid a deadlock 
B) there exist a safe sequence 
C) all of the mentioned 
D) none of the mentioned 
A) the system can allocate resources to each process in some order and still avoid a deadlock 
B) there exist a safe sequence 
C) all of the mentioned 
D) none of the mentioned A

Question 2

The request and release of resources are

Accepted Answer

A) command line statements 
B) interrupts 
C) system calls 
D) special programs 
A) command line statements 
B) interrupts 
C) system calls 
D) special programs C

Question 3

Write ahead logging is a way

Accepted Answer

A) to ensure atomicity 
B) to keep data consistent 
C) that records data on stable storage 
D) all of the mentioned 
A) to ensure atomicity 
B) to keep data consistent 
C) that records data on stable storage 
D) all of the mentioned D

Question 4

The number of resources requested by a process___________

Accepted Answer

A) must always be less than the total number of resources available in the system 
B) must always be equal to the total number of resources available in the system 
C) must not exceed the total number of resources available in the system 
D) must exceed the total number of resources available in the system 
A) must always be less than the total number of resources available in the system 
B) must always be equal to the total number of resources available in the system 
C) must not exceed the total number of resources available in the system 
D) must exceed the total number of resources available in the system

Question 5

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

Accepted Answer

A) resource allocation graph 
B) starvation graph 
C) inversion graph 
D) none of the mentioned 
A) resource allocation graph 
B) starvation graph 
C) inversion graph 
D) none of the mentioned

Question 6

The disadvantage of a process being allocated all its resources before beginning its execution is___________

Accepted Answer

A) low cpu utilization 
B) low resource utilization 
C) very high resource utilization 
D) none of the mentioned 
A) low cpu utilization 
B) low resource utilization 
C) very high resource utilization 
D) none of the mentioned

Question 7

What is a reusable resource?

Accepted Answer

A) that can be used by one process at a time and is not depleted by that use 
B) that can be used by more than one process at a time 
C) that can be shared between various threads 
D) none of the mentioned 
A) that can be used by one process at a time and is not depleted by that use 
B) that can be used by more than one process at a time 
C) that can be shared between various threads 
D) none of the mentioned

Question 8

Which one of the following is the deadlock avoidance algorithm?

Accepted Answer

A) banker's algorithm 
B) round-robin algorithm 
C) elevator algorithm 
D) karn's algorithm 
A) banker's algorithm 
B) round-robin algorithm 
C) elevator algorithm 
D) karn's algorithm

Question 9

The system periodically performs checkpoints that consists of the following operation(s)___________

Accepted Answer

A) putting all the log records currently in main memory onto stable storage 
B) putting all modified data residing in main memory onto stable storage 
C) putting a log record onto stable storage 
D) all of the mentioned 
A) putting all the log records currently in main memory onto stable storage 
B) putting all modified data residing in main memory onto stable storage 
C) putting a log record onto stable storage 
D) all of the mentioned

Question 10

A system is in a safe state only if there exists a___________

Accepted Answer

A) safe allocation 
B) safe resource 
C) safe sequence 
D) all of the mentioned 
A) safe allocation 
B) safe resource 
C) safe sequence 
D) all of the mentioned

Question 11

To avoid deadlock___________

Accepted Answer

A) there must be a fixed number of resources to allocate 
B) resource allocation must be done only once 
C) all deadlocked processes must be aborted 
D) inversion technique can be used 
A) there must be a fixed number of resources to allocate 
B) resource allocation must be done only once 
C) all deadlocked processes must be aborted 
D) inversion technique can be used

Question 12

A problem encountered in multitasking when a process is perpetually denied necessary resources is called___________

Accepted Answer

A) deadlock 
B) starvation 
C) inversion 
D) aging 
A) deadlock 
B) starvation 
C) inversion 
D) aging

Question 13

For an effective operating system, when to check for deadlock?

Accepted Answer

A) every time a resource request is made 
B) at fixed time intervals 
C) every time a resource request is made at fixed time intervals 
D) none of the mentioned 
A) every time a resource request is made 
B) at fixed time intervals 
C) every time a resource request is made at fixed time intervals 
D) none of the mentioned

Question 14

Each request requires that the system consider the___________  to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.

Accepted Answer

A) resources currently available 
B) processes that have previously been in the system 
C) resources currently allocated to each process 
D) future requests and releases of each process 
A) resources currently available 
B) processes that have previously been in the system 
C) resources currently allocated to each process 
D) future requests and releases of each process

Question 15

A deadlock avoidance algorithm dynamically examines the___________      to ensure that a circular wait condition can never exist.

Accepted Answer

A) resource allocation state 
B) system storage state 
C) operating system 
D) resources 
A) resource allocation state 
B) system storage state 
C) operating system 
D) resources

Question 16

For a deadlock to arise, which of the following conditions must hold simultaneously?

Accepted Answer

A) mutual exclusion 
B) no preemption 
C) hold and wait 
D) all of the mentioned 
A) mutual exclusion 
B) no preemption 
C) hold and wait 
D) all of the mentioned

Question 17

The two phase locking protocol consists of___________

Accepted Answer

A) growing & shrinking phase 
B) shrinking & creation phase 
C) creation & growing phase 
D) destruction & creation phase 
A) growing & shrinking phase 
B) shrinking & creation phase 
C) creation & growing phase 
D) destruction & creation phase

Question 18

Which of the following condition is required for a deadlock to be possible?

Accepted Answer

A) mutual exclusion 
B) a process may hold allocated resources while awaiting assignment of other resources 
C) no resource can be forcibly removed from a process holding it 
D) all of the mentioned 
A) mutual exclusion 
B) a process may hold allocated resources while awaiting assignment of other resources 
C) no resource can be forcibly removed from a process holding it 
D) all of the mentioned

Question 19

A state is safe, if___________

Accepted Answer

A) the system does not crash due to deadlock occurrence 
B) the system can allocate resources to each process in some order and still avoid a deadlock 
C) the state keeps the system protected and safe 
D) all of the mentioned 
A) the system does not crash due to deadlock occurrence 
B) the system can allocate resources to each process in some order and still avoid a deadlock 
C) the state keeps the system protected and safe 
D) all of the mentioned

Question 20

Which is the process of invoking the wait

Accepted Answer

A) transaction 
B) operation 
C) function 
D) all of the mentioned 
A) transaction 
B) operation 
C) function 
D) all of the mentioned

Exam 13: Concurrency Control and Deadlock Prevention in Operating Systems

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

The request and release of resources are

Write ahead logging is a way

The number of resources requested by a process___________

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

The disadvantage of a process being allocated all its resources before beginning its execution is___________

What is a reusable resource?

Which one of the following is the deadlock avoidance algorithm?

The system periodically performs checkpoints that consists of the following operation(s)___________

A system is in a safe state only if there exists a___________

To avoid deadlock___________

A problem encountered in multitasking when a process is perpetually denied necessary resources is called___________

For an effective operating system, when to check for deadlock?

Each request requires that the system consider the___________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.

A deadlock avoidance algorithm dynamically examines the___________ to ensure that a circular wait condition can never exist.

For a deadlock to arise, which of the following conditions must hold simultaneously?

The two phase locking protocol consists of___________

Which of the following condition is required for a deadlock to be possible?

A state is safe, if___________

Which is the process of invoking the wait

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

Deadlock and Resource Allocation in Computer 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