Process Synchronization Questions

MCQ bookmark_border

41.

In the bounded buffer problem ____________

A

there is only one buffer

B

there are n buffers (n being greater than one but finite)

C

there are infinite buffers

D

the buffer size is bounded

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

42.

The dining-philosophers problem will occur in case of ____________

A

5 philosophers and 5 chopsticks

B

4 philosophers and 5 chopsticks

C

3 philosophers and 5 chopsticks

D

6 philosophers and 5 chopsticks

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

43.

The dining-philosophers problem will occur in case of ____________

A

5 philosophers and 5 chopsticks

B

4 philosophers and 5 chopsticks

C

3 philosophers and 5 chopsticks

D

6 philosophers and 5 chopsticks

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

44.

A deadlock free solution to the dining philosophers problem ____________

A

necessarily eliminates the possibility of starvation

B

does not necessarily eliminate the possibility of starvation

C

eliminates any possibility of any kind of problem further

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

45.

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward.
Suppose a process executes in the following manner.

signal(mutex);
.....
critical section
.....
wait(mutex);

In this situation :

A

a deadlock will occur

B

processes will starve to enter critical section

C

several processes maybe executing in their critical section

D

all of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

46.

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.

Method used by P1 :
while(S1==S2);
Critical section
S1 = S2;
 
Method used by P2 :
while(S1!=S2);
Critical section
S2 = not(S1);

Which of the following statements describes properties achieved?

A

Mutual exclusion but not progress

B

Progress but not mutual exclusion

C

Neither mutual exclusion nor progress

D

Both mutual exclusion and progress

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

47.

A monitor is a type of ____________

A

semaphore

B

low level synchronization construct

C

high level synchronization construct

D

none of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

48.

A monitor is characterized by ____________

A

a set of programmer defined operators

B

an identifier

C

the number of variables in it

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

49.

A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters.

A

process, semaphore

B

process, monitor

C

semaphore, semaphore

D

monitor, monitor

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

50.

The monitor construct ensures that ____________

A

only one process can be active at a time within the monitor

B

n number of processes can be active at a time within the monitor

C

the queue has only one process in it at a time

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion