Process Synchronization Questions

MCQ bookmark_border

101.

The wait-for graph is a deadlock detection algorithm that is applicable when ____________

A

all resources have a single instance

B

all resources have multiple instances

C

all resources have a single 7 multiple instances

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

102.

An edge from process Pi to Pj in a wait for graph indicates that ____________

A

Pi is waiting for Pj to release a resource that Pi needs

B

Pj is waiting for Pi to release a resource that Pj needs

C

Pi is waiting for Pj to leave the system

D

Pj is waiting for Pi to leave the system

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

103.

If the wait for graph contains a cycle ____________

A

then a deadlock does not exist

B

then a deadlock exists

C

then the system is in a safe state

D

either deadlock exists or system is in a safe state

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

104.

If deadlocks occur frequently, the detection algorithm must be invoked ________

A

rarely

B

frequently

C

rarely

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

105.

What is the disadvantage of invoking the detection algorithm for every request?

A

overhead of the detection algorithm due to consumption of memory

B

excessive time consumed in the request to be allocated memory

C

considerable overhead in computation time

D

all of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

106.

A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

A

increase

B

drop

C

stay still

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

107.

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________

A

the set of processes that have been deadlocked

B

the set of processes in the deadlock queue

C

the specific process that caused the deadlock

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

108.

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________

A

can never occur

B

may occur

C

has to occur

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

109.

A deadlock can be broken by ____________

A

abort one or more processes to break the circular wait

B

abort all the process in the system

C

preempt all resources from all processes

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

110.

The two ways of aborting processes and eliminating deadlocks are ____________

A

Abort all deadlocked processes

B

Abort all processes

C

Abort one process at a time until the deadlock cycle is eliminated

D

All of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion