Question

3.6. Assuming the same code as in question 3.5, describe, in detail, a solution that uses only semaphores. Would this solution work free of deadlocks and starvation? [4]

question 3.5 code below:

Algorithm 1: Execution function of a single philoso- pher Data: philosopherK; Result: ; // the philosopher ID // no return value 1 run( philosopherK) 2 think 3 | pick-left-fork(); pick_right _fork): 5 eat( 6 releaseleftfork0; 7 release_right fork)

Answer 1

no this is not work free from dead lock and starvation.when philospher is thinking then he not able to eat.so until he release the right fork the other person cant pick his left fork.so by this reason the other person has to wait for long time.

for left the fork once philospher realease his right fork then that person can be able to pick the left fork in that concondition dead lock and starvation wont occur.

but here because of starvation the deadlock is occuring.