edited by
533 views
3 votes
3 votes

Which of the following statements are not true?

  1. All unsafe states are deadlocks
  2. A deadlock state is unsafe state
  3. A system is in safe state only if there exists a safe sequence
  4. A state is said to be safe if the system can allocate resources to few processes even if all of them suddenly request their maximum number of resources.
  1. $3$ & $4$ only
  2. $1$ & $4$ only
  3. $2$ & $3$ only
  4. $1$, $3$ & $4$ only
edited by

2 Answers

Best answer
0 votes
0 votes

Not all unsafe states are deadlocks.  In safe state there is some scheduling order in which every process can run  to completion even if all of them suddenly request their maximum number of  resources.

edited by
0 votes
0 votes

In Deadlock Avoidance / Banker's Algorithm

A safe state is a state in which there exists sequence of execution.

An unsafe state is a state where there can't be any execution sequence.

A deadlocked state is when the availability of resources is 0.

 

Option B


Check this: https://gateoverflow.in/44404/isro-2013-58 (Everyone answered wrong here, except Dexter)

Answer:

Related questions

2 votes
2 votes
1 answer
1
Bikram asked Dec 26, 2016
262 views
Consider the following 3 processes with 3 binary semaphores with initial values $S_{0}=0, S_{1}=0, S_{2}=1$$$ \begin{array}{|c|c|c|} \hline \textbf{P} & \textbf{Q} & \tex...
2 votes
2 votes
3 answers
2
Bikram asked Dec 26, 2016
1,031 views
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns.The ...
1 votes
1 votes
1 answer
4
Bikram asked Dec 26, 2016
201 views
A counting semaphore is initialized to $10$. The $6$ P(wait) operations and $4$ V(signal) operations were completed in this semaphore. The resulting value of semaphore is...