Q. 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 :

View solution

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

View solution

Q. The following three conditions must be satisfied to solve the critical section problem :

View solution

Q. Mutual exclusion implies that :

View solution

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

View solution

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

View solution

Q. In the bakery algorithm to solve the critical section problem :

View solution

Q. An un-interruptible unit is known as :

View solution

Q. The TestAndSet instruction is executed :

View solution

Q. Semaphore is a/an _______ to solve the critical section problem.

View solution

Q. The two atomic operations permissible on semaphores are :

View solution

Q. Spinlocks are :

View solution

Q. The main disadvantage of spinlocks is that :

View solution

Q. The wait operation of the semaphore basically works on the basic _______ system call.

View solution

Q. The signal operation of the semaphore basically works on the basic _______ system call.

View solution

Q. If the semaphore value is negative :

View solution

Q. The code that changes the value of the semaphore is :

View solution

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

View solution

Q. A semaphore :

View solution

Q. The two kinds of semaphores are :

View solution