Q. For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?

View solution

Q. Semaphores

View solution

Q. What is the initial value of the semaphore to allow only one of the many processes to enter their critical section?

View solution

Q. Part of a program where the shared memory is accessed and which should be executed invisibly, is called

View solution

Q. A critical region is

View solution

Q. For procedure, the system prevent the overlap of buffer

View solution

Q. In implementation of Semaphores, for a single processor system, it is possible to inhibited

View solution

Q. In message passing a process receives information by executing the

View solution

Q. In a uniprocessor system concurrent processes cannot have overlapped

View solution

Q. In addressing, a many to one relationship is useful for

View solution

Q. The controller process services writes a

View solution

Q. Using Semaphores, each process has a critical section used to access the

View solution

Q. The global variable read count is used to keep the track of the number of

View solution

Q. In readers/writers problems, Readers are processes that are not required to

View solution

Q. Requirement for mutual exclusions a process remains inside its critical section for a

View solution

Q. For synchronization, the communication of a message between two processes implies some level of

View solution

Q. The operating system must allocate and deal various resources for each active

View solution

Q. During process interaction concurrent processes come into conflict with each other when they are

View solution

Q. In Semaphores, two or more processors can cooperate by means of simple

View solution

Q. What is the name of the state in which the system allocate resources to each process so that a deadlock cannot occur?

View solution