1.

) there’s a deadlock inevitable between the passage going to P and Q want A when going to 1
and 2 its located at the arrow 3, There’s also a deadlock inevitable when going to P and Q want
b at the arrow number 4 where it can’t pass by through 5 and 6.

2.) they would get blocked by the deadlock inevitable because they would cross by it.
3.) going with P and Q want A where it goes to 1 and 2 directly before going back and be
encountered by the deadlock.
4.) the path 2 is getting the resources at P and Q want A and going back which have
encountered two deadlocks at path 3 and 4 and releases resources A at B which is the progress
of P.
5.) Yes, going to the path of 3 and 4 which this where the deadlock is the deadlock inevitable
will occur.

6.) indirect method, to actually avoid of being locked and preventing this will make progress
faster and more efficient.
7.) Banker’s algorithm, it allocates deadlock avoidance algorithm which test all the request
made by
The processes for resources, it checks for the safe state, after granting request system remains
in
The safe state and it allows the request and if there is no safe state it doesn’t allow the request
made by the process.
8.) In my understanding that deadlock is possible if the four conditions hold simultaneously:
Mutual exclusion, hold and wait, no pre-emption, and circular wait. If each process is allocated
one resource, then all three resources will be held. There is no forth resource available.
9.) Path 1 - It starts at zero and acquires one B resource before moving on to one A resource.
Then it releases resources B and A, in that order. Path 2 - It turns right after getting B and A
resources.