S-8 P(S) f if (System would stay in a Safe State) S=S-1; else OS moves the proce

Question

S-8 P(S) f if (System would stay in a Safe State) S=S-1; else OS moves the process to the queue waiting for S Update resource tables and the Resource Allocation Graph Pseudo code for Dijkstra semaphore true true true true false -If the number of resources is 0, then there is no need to update the RAG false -If the number of resources is 0, then the system is in an unsafe st false -This P function practices Deadlock Avoidance false - if S-3, the system still may not allocate one of the resources Record Answer

Explanation / Answer

Solution:

The first statement is false, because there are no resources available but the RAG will be updated anyway.

The second statement is false, If no resources are available we cannot say that the system was changed.

The third statement is true, Ensuring system to be in the safe state is to ensure there will be no deadlock.

The fourth statement is true.

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.