Question 31 : Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
1. resource allocation graph
2. starvation graph
3. inversion graph
4. none of the mentioned
View Answer   Discuss with Members

Question 32 : A problem encountered in multitasking when a process is perpetually denied necessary resources is called
1. deadlock
2. starvation
3. inversion
4. aging
View Answer   Discuss with Members

Question 33 : For effective operating system, when to check for deadlock?
1. every time a resource request is made
2. at fixed time intervals
3. every time a resource request is made at fixed time intervals
4. none of the mentioned
View Answer   Discuss with Members

Question 34 : The circular wait condition can be prevented by
1. defining a linear ordering of resource types
2. using thread
3. using pipes
4. all of the mentioned
View Answer   Discuss with Members

Question 35 : A system is in the safe state if
1. the system can allocate resources to each process in some order and still avoid a deadlock
2. there exist a safe sequence
3. all of the mentioned
4. none of the mentioned
View Answer   Discuss with Members

Question 36 : Which of the following condition is required for deadlock to be possible?
1. mutual exclusion
2. a process may hold allocated resources while awaiting assignment of other resources
3. no resource can be forcibly removed from a process holding it
4. all of the mentioned
View Answer   Discuss with Members

Question 37 : What is the reusable resource?
1. that can be used by one process at a time and is not depleted by that use
2. that can be used by more than one process at a time
3. that can be shared between various threads
4. none of the mentioned
View Answer   Discuss with Members