Homework #3
Due Monday 10/17/2011 In-Class

1. Give pseudocode for a version of the banker's algorithm that prevents the memory-contention deadlock discussed in class.
   
   Provide a brief description as to why/how your pseudocode works.
   
   Give the time complexity for your psuedocode in big O notation.