4. Regards, Kiran.
On Mon, Sep 12, 2011 at 2:43 PM, Prachi Bhise <[email protected]>wrote: > hey , plz help to solve this. > > There are 3 processes. Each process requires 2 units of resources. > Calculate the minimum number of units of resources required by all 3 > processes such that no deadlock occurs. > > Regards > Prachi Bhise > B.E. (final year) > Pune University > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
