Question 1

A locking protocol is one that

Accepted Answer

A) governs how locks are acquired 
B) governs how locks are released 
C) governs how locks are acquired and released 
D) none of the mentioned 
A) governs how locks are acquired 
B) governs how locks are released 
C) governs how locks are acquired and released 
D) none of the mentioned

Question 2

What is the drawback of banker's algorithm?

Accepted Answer

A) in advance processes rarely know how much resource they will need 
B) the number of processes changes as time progresses 
C) resource once available can disappear 
D) all of the mentioned 
A) in advance processes rarely know how much resource they will need 
B) the number of processes changes as time progresses 
C) resource once available can disappear 
D) all of the mentioned

Question 3

The circular wait condition can be prevented by___________

Accepted Answer

A) defining a linear ordering of resource types 
B) using thread 
C) using pipes 
D) all of the mentioned 
A) defining a linear ordering of resource types 
B) using thread 
C) using pipes 
D) all of the mentioned

Question 4

For non sharable resources like a printer, mutual exclusion___________

Accepted Answer

A) must exist 
B) must not exist 
C) may exist 
D) none of the mentioned 
A) must exist 
B) must not exist 
C) may exist 
D) none of the mentioned

Question 5

The growing phase is a phase in which?

Accepted Answer

A) a transaction may obtain locks, but does not release any 
B) a transaction may obtain locks, and releases a few or all of them 
C) a transaction may release locks, but does not obtain any new locks 
D) a transaction may release locks, and does obtain new locks 
A) a transaction may obtain locks, but does not release any 
B) a transaction may obtain locks, and releases a few or all of them 
C) a transaction may release locks, but does not obtain any new locks 
D) a transaction may release locks, and does obtain new locks

A locking protocol is one that

What is the drawback of banker's algorithm?

The circular wait condition can be prevented by___________

For non sharable resources like a printer, mutual exclusion___________

The growing phase is a phase in which?

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

Exam 13: Concurrency Control and Deadlock Prevention in Operating Systems

A locking protocol is one that

What is the drawback of banker's algorithm?

The circular wait condition can be prevented by___________

For non sharable resources like a printer, mutual exclusion___________

The growing phase is a phase in which?

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