1,180 views
0 0 votes
var occupied
var blocked
Enter Region:
{
If (occupied) {
then blocked= blocked +1
sleep ( );
}
else occupied= 1;
}
Exit Region:
{
occupied= 0
If (blocked) {
then wakeup (process);
blocked= blocked – 1;
}
}
(1) Mutual Exclusion is guaranteed
(2) Deadlock free Algorithm
(3) Progress is guaranteed
Which of the above statements are False?
(a) Only 1 (b) 1 & 2
(c) 1 & 3(d) none of the above

Please log in or register to answer this question.

Position:
Show:

Related questions

2 2 votes
1 1 answer
148
148 views
GO Classes asked Aug 26
148 views
Consider an integer semaphore $\texttt{S}$.Method $\textbf{1}$wait(S): disable interrupts while S <= 0: do nothing S = S - 1 enable interrupts signal(S): disable interrup...
3 3 votes
2 2 answers
139
139 views
GO Classes asked Jul 29
139 views
Which of the following statements are correct?Semaphore $\texttt{wait()}$ and $\texttt{signal()}$ operations must be atomic. A counting semaphore can represent the number...
3 3 votes
3 3 answers
174
174 views
GO Classes asked Jul 29
174 views
A semaphore $S$ is initialized to $1$.The following operations occur in order:$\texttt{wait(S)}$$\texttt{wait(S)}$$\texttt{signal(S)}$$\texttt{wait(S)}$$\texttt{signal(S)...
2 2 votes
2 2 answers
150
150 views
GO Classes asked Jul 29
150 views
Two semaphores are initialized as:$S = 1$$T = 0$Two processes execute repeatedly:Process P$\texttt{wait(S);}$$\texttt{print("A");}$$\texttt{signal(T);}$Process Q$\texttt{...