IBPS IT SO-Operating system-The Critical Section (CS) Problem and Solution

The Critical Section (CS) Problem and Solution

1) Concurrent access to shared data may result in :
a) data consistency
b) data insecurity
c) data inconsistency
d) None of these

Answer: c
Explanation: None.

2) 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

Answer: b
Explanation: None.

3) 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

Answer: b
Explanation: None.

4) The following three conditions must be satisfied to solve the critical section problem : (choose three)
a) Aging
b) Mutual Exclusion
c) Deadlock
d) Progress
e) Bounded Waiting

Answer: b,d and e
Explanation: None.

5) 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 these

Answer: a
Explanation: None.

6) 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 these

Answer: a
Explanation: None.

7) 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

Answer: b
Explanation: None.

8) 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

Answer: b
Explanation: None