CSE410		HOMEWORK #6	Due: Thursday, May 22 

1. Give a non-computer, and practical, example of each of i) deadlock 
and ii) starvation. 

2. Let the entry code for a critical section be: 
		loop:	comp	busy, #1
			beq	loop 
			move	busy, #1 

  Let the exit code be: move busy, #0 

  Assume that two processes, A and B, are each attempting to enter their 
  critical sections and that busy is 0 initially.

  a) Exhibit an interleaved execution sequence that illustrates how A 
  can enter its critical section and how B can be prevented from entering
  until A exits. 

  b) List an interleaved execution sequence that has both A and B executing 
  in their critical sections at the same time. 

3. Page 68(BS), question 11. The processes are independent of each other 
except for the possibility of semaphore operations that may appear at 
the beginning or end of their code. 

4. Page 68 (BS), question 12.