Tag Archives: Use banker’s algorithm and write down all the intermediate steps to find out that either the system

CS604 Operating Systems Assignment 3 Solution Fall 2013

Question No.1[Marks:5] 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? Question No.2[Marks:10] Consider the following snapshot of the system Use banker’s algorithm and write down all the intermediate steps […]