Here you are given a single instance RAG, drive WFG (wait-for graph) from this graph and judge whether this system is with deadlock or not? If yes then represent it by drawing corresponding WFG?
Consider the following snapshot of the system
Use banker’s algorithm and write down all the intermediate steps to find out that either the system is in safe state or not. If system is in safe state then write down the safe sequence and if system is not in safe state then give reason to support your answer.
Note: Write down all the intermediate steps during finding out the safe sequence. If you will not write down the intermediate steps and if you will just write only the safe sequence then you will get zero marks.DOWNLOAD SOLUTION HERE