$156.$ keeping shared data consistency needs:

A$.$ solutions to guarantee the organized running between several processes

B$.$ Many copies of shared data

C$.$ Non ordered execution between several processes

D$.$ IPC

$157.$ We can identify the code of critical section based on:

A$.$ the resource used by all processes

B$.$ the resources non used by all processes

C$.$ Number of statement

D$.$ the type of resources

$158.$ A waiting for a solution to a critical$-$section must be:

A$.$ Limited

B$.$ unlimited

C$.$ Great

D$.$ Little

$159.$ Peterson's Critical$-$Section Solution is a:

A$.$ One process solution

B$.$ Two process solution

C$.$ Three process solution

D$.$ Four process solution

$160.$ Many systems provide hardware support for implementing the critical section code which is

related to:

A$.$ System calls

B$.$ Traps

C$.$ Interrupts

D$.$ Triggers

$161.$ Mutex Locks is a $........$ critical section solution:

A$.$ Simple

B$.$ Complicated

C$.$ Inefficient

D$.$ Obsolete

$162.$ Semaphore is a synchronization tool that does not need:

A$.$ Semaphore S $$ integer variable

B$.$ wait$()$ system call

C$.$ Signal$()$ system call

D$.$ push system call

$163.$ This system call exit$()$ belongs to the.......services:

A$.$ Accounting

B$.$ User interface

C$.$ Program execution

D$.$ I$/$O operations

$164.$ This system call exec$()$ belongs to the.......services:

A$.$ Accounting

B$.$ User interface

C$.$ Program execution

D$.$ I$/$O operations