Operating system mcqs deadlock avoidance

 

 Buy/Download all MCQ Ebook   >>>Click Here<<<

Operating system mcqs deadlock avoidance

Click on any option to know the CORRECT ANSWERS

Question 1
A system is in a safe state only if there exists a .....
A
safe allocation
B
safe resource
C
safe sequence
D
all of the mentioned
Geography Questions answers

Question 2
A deadlock avoidance algorithm dynamically examines the ..... to ensure that a circular wait condition can never exist.
A
resource allocation state
B
system storage state
C
operating system
D
resources
Reasoning Questions answers

Question 2 Explanation: 
Resource allocation states are used to maintain the availability of the already and current available resources.
Question 3
Given a priori information about the ..... number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
A
minimum
B
average
C
maximum
D
approximate
UPSC Questions answers

Question 4
The content of the matrix Need is .....
A
Allocation - Available
B
Max - Available
C
Max - Allocation
D
Allocation - Max
Data interpretation (DI) Questions answers

Question 5
A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. Process P0 P1 P2 Maximum needs (process-wise: P0 through P2 top to bottom) 10 4 9 Currently allocated (process-wise) 5 2 2 Which of the following sequence is a safe sequence?
A
P0, P1, P2
B
P1, P2, P0
C
P2, P0, P1
D
P1, P0, P2
English literature Questions answers

There are 5 questions to complete.

 

 Buy/Download all MCQ Ebook >>>CLICK HERE<<<