Task 12

Concurrent access to shared data may result in ____________

• data consistency

• data insecurity

• data inconsistency

• none of the mentioned

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 ____________

• data consistency

• race condition

• aging

• starvation

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

• program

• critical section

• non – critical section

• synchronizing

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

• Mutual Exclusion

• Progress

• Bounded Waiting

• All of the mentioned

Mutual exclusion implies that ____________

• if a process is executing in its critical section, then no other process must be executing in their critical sections

• if a process is executing in its critical section, then other processes must be executing in their critical sections

• if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution

• 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 ____________

• after a process has made a request to enter its critical section and before the request is granted

• when another process is in its critical section

• before a process has made a request to enter its critical section

• none of the mentioned

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

• one

• two

• three

• four

In the bakery algorithm to solve the critical section problem ____________

• each process is put into a queue and picked up in an ordered manner

• each process receives a number (may or may not be unique) and the one with the lowest number is served next

• each process gets a unique number and the one with the highest number is served next

• each process gets a unique number and the one with the lowest number is served next

What will happen if a non-recursive mutex is locked more than once?

• Starvation

• Deadlock

• Aging

• Signaling

What is a semaphore?

• is a binary mutex

• must be accessed from only one process

• can be accessed from multiple processes

• none of the mentioned