solution - Operating System : Deadlock (Test 2)

Question : Which process recovery method breaks deadlock by terminating processes?

Solution :
571120260314113401 Correct Answer : Process termination

Description -

Operating System : Deadlock (Test 2)

Question : Which recovery method involves returning the system to a previous safe state?

Solution :
24920260314113301 Correct Answer : Rollback

Description -

Operating System : Deadlock (Test 2)

Question : Which of the following is a deadlock recovery technique related to resources?

Solution :
179720260314113217 Correct Answer : Resource preemption

Description -

Operating System : Deadlock (Test 2)

Question : In a system with single-instance resources, what indicates a deadlock?

Solution :
37320260314113129 Correct Answer : Presence of a cycle in Resource Allocation Graph

Description -

Operating System : Deadlock (Test 2)

Question : In deadlock detection, the operating system periodically checks the system using which structure?

Solution :
639020260314113034 Correct Answer : Resource Allocation Graph

Description -

Operating System : Deadlock (Test 2)

Question : If resources have multiple instances and a cycle exists in the RAG, what does it mean?

Solution :
896420260314112838 Correct Answer : Deadlock may or may not exist

Description -

Operating System : Deadlock (Test 2)

Question : If a Resource Allocation Graph has a cycle and each resource has only one instance, what does it indicate?

Solution :
174520260314112756 Correct Answer : Deadlock

Description -

Operating System : Deadlock (Test 2)

Question : What does an edge from a process to a resource represent in RAG?

Solution :
166920260314112659 Correct Answer : Resource request

Description -

Operating System : Deadlock (Test 2)

Question : In a Resource Allocation Graph, processes are represented by:

Solution :
309720260314112614 Correct Answer : Circles

Description -

Operating System : Deadlock (Test 2)

Question : What is the main purpose of a Resource Allocation Graph (RAG) in Operating Systems?

Solution :
386820260314112513 Correct Answer : To detect deadlocks in a system

Description -

Operating System : Deadlock (Test 2)

Question : If a Resource Allocation Graph contains no cycle, then:

Solution :
330220260314112322 Correct Answer : Deadlock never occurs

Description -

Operating System : Deadlock (Test 2)

Question : An edge from a resource to a process (R → P) represents:

Solution :
854920260314112153 Correct Answer : Assignment edge

Description -

Operating System : Deadlock (Test 2)

Question : An edge from a process to a resource (P → R) indicates:

Solution :
613320260314112040 Correct Answer : Process waiting for resource

Description -

Operating System : Deadlock (Test 2)

Question : In a Resource Allocation Graph, a resource type is represented by:

Solution :
658820260314111935 Correct Answer : Rectangle

Description -

Operating System : Deadlock (Test 2)

Question : In a Resource Allocation Graph, a process is represented by which shape?

Solution :
705420260314111855 Correct Answer : Circle

Description -

Operating System : Deadlock (Test 2)