CSE410	HOMEWORK #n (n=last)		Due: Thursday, May 29

1. BS, p.103, Question 12. Assume that there are many processes that may 
invoke the reader() and writer() functions. If starvation is possible, 
describe an execution sequence containing starvation of some process;
otherwise, argue why starvation is not possible.

2. BS, p.145, Question 9. 

3. BS, p.174, Question 13. 

4. BS, p.202, Question 16.