Process Synchronization Questions

MCQ bookmark_border

91.

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

Correct Answer: A

Resource allocation states are used to maintain the availability of the already and current available resources.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

92.

A state is safe, if ____________

A

the system does not crash due to deadlock occurrence

B

the system can allocate resources to each process in some order and still avoid a deadlock

C

the state keeps the system protected and safe

D

all of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

93.

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

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

94.

All unsafe states are ____________

A

deadlocks

B

not deadlocks

C

fatal

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

95.

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

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

96.

If no cycle exists in the resource allocation graph ____________

A

then the system will not be in a safe state

B

then the system will be in a safe state

C

all of the mentioned

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

97.

The resource allocation graph is not applicable to a resource allocation system ____________

A

with multiple instances of each resource type

B

with a single instance of each resource type

C

single and multiple instances of each resource type

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

98.

The Banker's algorithm is _____________ than the resource allocation graph algorithm.

A

less efficient

B

more efficient

C

equal

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

99.

The content of the matrix Need is ____________

A

Allocation- Available

B

Max- Available

C

Max- Allocation

D

Allocation- Max

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

100.

A system with 5 processes P0 through P4 and three resource types A, B, C have A with 10 instances, B with 5 instances, and C with 7 instances. At time t0, the following snapshot has been taken:

Process
P0               
P1               
P2           
P3           
P4       

Allocation (process-wise : P0 through P4 top TO bottom) 
A   B   C
0   1   0
2   0   0
3   0   2
2   1   1
0   0   2

MAX (process-wise: P0 through P4 top TO bottom)
A   B   C
7   5   3
3   2   2
9   0   2
2   2   2
4   3   3

Available
A   B   C
3   3   2

The sequence leads the system to ____________

A

an unsafe state

B

a safe state

C

a protected state

D

a deadlock

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion