1.In the Readers-Writers problem, more than one writer can access the buffer at the same time to write True False 2.Given that processes P1 and P2 are using semaphores to lock resources, determine whether or not the following sequence of requests results in a deadlock. Initially, all resources are available. P1: P2: wait(A) wait(C) wait(B) wait(B) ... .... signal(A) signal(B) signal(B) signal(C) Yes No Insufficient information 3.If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely. Which option describe best Mutual Exclusion Progress Bounded Waiting None of the above
1.In the Readers-Writers problem, more than one writer can access the buffer at the same time to write
True
False
2.Given that processes P1 and P2 are using semaphores to lock resources, determine whether or not the following sequence of requests results in a deadlock. Initially, all resources are available.
P1: P2:
wait(A) wait(C)
wait(B) wait(B)
... ....
signal(A) signal(B)
signal(B) signal(C)
Yes
No
Insufficient information
3.If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely. Which option describe best
Mutual Exclusion
Progress
Bounded Waiting
None of the above
4.In the producer-consumer problem, the "out" will be used to point to the index in the buffer where a producer can produce next.
True
False
5.Entry section and Exit section in the code together are referred to as a solution for Critical Section Problem
True
False
“Since you have posted multiple questions, we will provide the solution only to the first 3 questions as per our Q&A guidelines. Please repost the remaining questions separately”.
Readers-Writers Problem: Managing simultaneous access to a shared resource, allowing multiple readers but only one writer.
Semaphores and Deadlock: Tools to control shared resource access; deadlocks occur when processes get stuck waiting for each other.
Concurrency Properties:
- Mutual Exclusion: One process in critical section at a time.
- Progress: No indefinite waiting for resource access.
- Bounded Waiting: Limits wait time for resource access.
Step by step
Solved in 3 steps
