Suppose that a process is in ‘BLOCKED’ state waiting for some I/O service. When the service is completed, it goes to thea)RUNNING stateb)READY statec)SUSPENDED stated)TERMINATED stateCorrect answer is option 'B'. Can you explain this answer?

Question

Suppose that a process is in &lsquo;BLOCKED&rsquo; state waiting for some I/O service. When the service is completed, it goes to thea)RUNNING stateb)READY statec)SUSPENDED stated)TERMINATED stateCorrect answer is option 'B'. Can you explain this answer?

Answer

A state of deadlock. This means that two or more processes are waiting for each other to release resources that they are holding. As a result, none of the processes can proceed, and the system is effectively stuck.

To resolve deadlock, several approaches can be taken, such as:

1. Prevention: This involves designing the system in such a way that deadlock cannot occur. For example, by using resource allocation algorithms that ensure that resources are always available when needed.

2. Avoidance: This involves detecting the possibility of deadlock before it occurs and taking appropriate measures to avoid it. For example, by using algorithms that predict the likelihood of deadlock and taking steps to avoid it.

3. Detection: This involves detecting the occurrence of deadlock and taking appropriate measures to resolve it. For example, by using algorithms that identify the processes involved in the deadlock and releasing the resources they are holding.

4. Recovery: This involves restarting the affected processes or resetting the system to resolve the deadlock. This approach is usually a last resort and can result in data loss or system instability.

Overall, the best approach to resolving deadlock depends on the specifics of the system and the resources involved. It is important to carefully analyze the situation and choose the most appropriate approach to ensure a successful resolution.

Similar Computer Science Engineering (CSE) Doubts

When a process is in a “Blocked” state waiting for some I/O service. When the service is completed, it goes to the __________

In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the RUNNING state to the

In a timeshare operating system, when the time slot assigned to a process is completed, the process switches from the current state to?

A _________ process is moved to the ready state when its time allocation expires.

Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

Top Courses for Computer Science Engineering (CSE)

Suggested Free Tests

Related Content

Mock Test Series

Subject-wise Courses

Subject-wise Courses

Other Engg Branches

Company