Question $11($Mandatory$)(3\mathrm{.}334$ points$)$

$$

In $\_\_\_\_\_\_\_\_\_,$ the process may be changing common variables, updating a table, writing a file, and so on$.$

Question $11$ options:

A$)$ entry section

B$)$ critical section

C$)$ exit section

D$)$ remainder section

Question $12($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following circumstances can cooperative scheduling take place?

Question $12$ options:

A$)$ when a process switches from the running state to the waiting state

B$)$ when a process switches from the running state to the ready state

C$)$ when a process switches from the waiting state to the ready state

D$)$ none of the above

Question $13($Mandatory$)(3\mathrm{.}334$ points$)$

$$

In $\_\_\_\_\_\_\_\_\_,$ the process requests permission to access and modify variables shared with others.

Question $13$ options:

A$)$ entry section

B$)$ critical section

C$)$ exit section

D$)$ remainder section

Question $14($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following critical$-$section problem$$s requirements ensures only one process is active in its critical section at a time?

Question $14$ options:

A$)$ mutual exclusion

B$)$ progress

C$)$ bounded waiting

D$)$ none of the above

Question $15($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following critical$-$section problem$$s requirements ensures programs will cooperatively determine what process will next enter its critical section?

Question $15$ options:

A$)$ mutual exclusion

B$)$ progress

C$)$ bounded waiting

D$)$ none of the above

Question $16($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following critical$-$section problem$$s requirements limits the amount of time a program will wait before it can enter its critical section?

Question $16$ options:

A$)$ mutual exclusion

B$)$ progress

C$)$ bounded waiting

D$)$ none of the above

Question $17($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following is true for the solutions to critical$-$section problems?

Question $17$ options:

A$)$ No deadlock implies progress, and progress implies bounded waiting

B$)$ Bounded waiting implies progress, and progress implies no deadlock

C$)$ Progress implies no deadlock, and no deadlock implies bounded waiting

D$)$ Bounded waiting implies no deadlock, and no deadlock implies progress

Question $18($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Saved

Which of the following is NOT true for Peterson$$s solution?

Question $18$ options:

A$)$ Mutual exclusion is preserved

B$)$ The progress requirement is satisfied

C$)$ The bounded$-$waiting requirement is met

D$)$ Peterson's solution works for synchronization among more than two processes

Question $19($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Saved

Which of the following variables are shared between the processes in Peterson$$s solution?

Question $19$ options:

A$)$ int turn

B$)$ boolean flag$[2]$

C$)$ both of the above

D$)$ none of the above

Question $20($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following indicates that Pi can enter the critical section in Peterson$$s solution?

Question $20$ options:

A$)$ flag$[$j$]==$ false or turn $==$ i

B$)$ flag$[$j$]==$ true or turn $==$ i

C$)$ flag$[$j$]==$ false or turn $==$ j

D$)$ flag$[$j$]==$ true and turn $==$ j

Question $21($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following is a software$-$based solution to the critical$-$section problem?

Question $21$ options:

A$)$ Peterson's solution

B$)$ test$\_$and$\_$set

C$)$ compare$\_$and$\_$swap

D$)$ all of the above

Question $22($Mandatory$)(3\mathrm{.}334$ points$)$

$$

Which of the following solutions needs hardware support for the critical section problem?

Question $22$ options:

A$)$ memory barriers

B$)$ compare$\_$and$\_$swap instruction

C$)$ atomic variables

D$)$ all of the above