What is the optimistic assumption made in the deadlock-detection algorithm? How can this assumption be violated?
Answers
Answered by
11
Answer:
- Deadlock : In an operating system, deadlock state happens when two or more processes are waiting for the same event to happen which never happen, then we can say that those processes are involved in the deadlock.
- Circular wait : It is that condition where the processes are circularity waiting on each other for the resources.
{Your required answer is in given attachment, prefer that.}
Attachments:
Answered by
0
Answer:
The assumption is that no further request will be made by a task, that has already been done. If a further request is made then a system violation will occur, and there will be a deadlock.
Explanation:
Similar questions