edited by
5,677 views

2 Answers

Best answer
12 votes
12 votes

(C) Deadlock Avoidance is solved by Banker's Algorithm.

Banker's algorithm pretends to have allocated te required resources to the processes, and if the system doesn't lead to deadlock, it actually allocates the resources.

selected by
3 votes
3 votes
C: Deadlock Avoidance. Using Banker's algorithm we can get to know about the safe or unsafe state.
Answer:

Related questions

0 votes
0 votes
1 answer
1
7 votes
7 votes
2 answers
2
sh!va asked May 7, 2017
6,411 views
Which of the following statement is true?Hard real time OS has less jitter than soft real time OSHard real time OS has more jitter than soft real time OSHard real time OS...
5 votes
5 votes
1 answer
3
sh!va asked May 7, 2017
7,444 views
The Linux command mknod myfifo b 4 16will create a character device if user is rootwill create a named pipe FIFO if user is rootwill create a block device if user is root...
6 votes
6 votes
4 answers
4
sh!va asked May 7, 2017
5,452 views
A critical regionis a piece of code which only one process executes at a timeis a region prone to deadlockis a piece of code which only a finite number of processes execu...