Process Synchronization Questions

MCQ bookmark_border

81.

For a Hold and wait condition to prevail ____________

A

A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it

B

A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes

C

A process must hold at least one resource and not be waiting to acquire additional resources

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

82.

Deadlock prevention is a set of methods ____________

A

to ensure that at least one of the necessary conditions cannot hold

B

to ensure that all of the necessary conditions do not hold

C

to decide if the requested resources for a process have to be given or not

D

to recover from a deadlock

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

83.

For non sharable resources like a printer, mutual exclusion ____________

A

must exist

B

must not exist

C

may exist

D

none of the mentioned

Correct Answer: A

A printer cannot be simultaneously shared by several processes.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

84.

For sharable resources, mutual exclusion ____________

A

is required

B

is not required

C

may be or may not be required

D

none of the mentioned

Correct Answer: B

They do not require mutually exclusive access, and hence cannot be involved in a deadlock.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

85.

To ensure that the hold and wait condition never occurs in the system, it must be ensured that ____________

A

whenever a resource is requested by a process, it is not holding any other resources

B

each process must request and be allocated all its resources before it begins its execution

C

a process can request resources only when it has none

D

all of the mentioned

Correct Answer: D

A process may request some resources and use them. Before it can can request any additional resources, however it must release all the resources that it is currently allocated.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

86.

The disadvantage of a process being allocated all its resources before beginning its execution is ____________

A

Low CPU utilization

B

Low resource utilization

C

Very high resource utilization

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

87.

To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it ____________

A

then the process waits for the resources be allocated to it

B

the process keeps sending requests until the resource is allocated to it

C

the process resumes execution without the resource being allocated to it

D

then all resources currently being held are preempted

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

88.

One way to ensure that the circular wait condition never holds is to ____________

A

impose a total ordering of all resource types and to determine whether one precedes another in the ordering

B

to never let a process acquire resources that are held by other processes

C

to let a process wait for only one resource at a time

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

89.

Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.

A

resources currently available

B

processes that have previously been in the system

C

resources currently allocated to each process

D

future requests and releases of each process

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

90.

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

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion