1. A solution to the problem of indefinite blockage of low – priority processes is ____________
a) Starvation
b) Wait queue
c) Ready queue
d) Aging
Explanation: Aging
2. Which of the following scheduling algorithms gives minimum average waiting time?
a) FCFS
b) SJF
c) Round – robin
d) Priority
Explanation: SJF
3. Concurrent access to shared data may result in ____________
a) data consistency
b) data insecurity
c) data inconsistency
d) none of the mentioned
Explanation: Concurrent access to shared data may result in data inconsistency
4. 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
Explanation: Race condition
5. 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
Explanation: The segment of code in which the process may change common variables, update tables, write into files is known as critical section
6. 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
Explanation: All of the mentioned
7. 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
Explanation: Mutual exclusion implies that if a process is executing in its critical section, then no other process must be executing in their critical sections
8. 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
Explanation: after a process has made a request to enter its critical section and before the request is granted
9. 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
Explanation: A minimum of two variable(s) is/are required to be shared between processes to solve the critical section problem.
10. 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
Explanation: each process receives a number (may or may not be unique) and the one with the lowest number is served next