A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________

• A. Data consistency
• B. Race condition
• C. Aging
• D. Starvation

The segment of code in which the process may change common variables, update tables, write into files is known as ____________

• A. Program
• B. Critical section
• C. Non €? critical section
• D. Synchronizing

Which of the following conditions must be satisfied to solve the critical section problem?

• A. Mutual exclusion
• B. Progress
• C. Bounded waiting
• D. All of the mentioned

Mutual exclusion implies that ____________

• A. If a process is executing in its critical section, then no other process must be executing in their critical sections
• B. If a process is executing in its critical section, then other processes must be executing in their critical sections
• C. If a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
• D. None of the mentioned

Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________

• A. After a process has made a request to enter its critical section and before the request is granted
• B. When another process is in its critical section
• C. Before a process has made a request to enter its critical section
• D. None of the mentioned

A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.

• A. One
• B. Two
• C. Three
• D. Four

In the bakery algorithm to solve the critical section problem ____________

• A. Each process is put into a queue and picked up in an ordered manner
• B. Each process receives a number (may or may not be unique) and the one with the lowest number is served next
• C. Each process gets a unique number and the one with the highest number is served next
• D. Each process gets a unique number and the one with the lowest number is served next

A monitor is a type of ____________

• A. Semaphore
• B. Low level synchronization construct
• C. High level synchronization construct
• D. None of the mentioned

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

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