מערכות הפעלה

n the bounded buffer problem, there are the empty and full semaphores that

1

מיין לפי

In the bounded buffer problem

1

מיין לפי

To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.

1

מיין לפי

The dining – philosophers problem will occur in case of

1

מיין לפי

A deadlock free solution to the dining philosophers problem

1

מיין לפי

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. signal(mutex); ..... critical section ..... wait(mutex); In this situation :

1

מיין לפי

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. wait(mutex); ..... critical section ..... wait(mutex);

1

מיין לפי

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. Method used by P1 : while(S1==S2); Critical section S1 = S2; Method used by P2 : while(S1!=S2); Critical section S2 = not(S1); Which of the following statements describes properties achieved?

1

מיין לפי

Which of the following condition is required for a deadlock to be possible?

1

מיין לפי

A system is in the safe state if

1

מיין לפי

Discuss, Learn and be Happy דיון בשאלות

n the bounded buffer problem, there are the empty and full semaphores that

In the bounded buffer problem

To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.

The dining – philosophers problem will occur in case of

A deadlock free solution to the dining philosophers problem

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. signal(mutex); ..... critical section ..... wait(mutex); In this situation :

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. wait(mutex); ..... critical section ..... wait(mutex);

Which of the following condition is required for a deadlock to be possible?

A system is in the safe state if