Chapter 24

Question 1

What are 3 classical problems of synchronization

Answer 1

1- Bounded-buffer problem
2- Readers and writers problem
3- Dining philosophers problem

Question 2

What mutex stands for

Answer 2

mutual exclusion

Question 3

What is reader and writers problems

Answer 3

There is a shared object in multiple readers and writers. Multiple processes can read. That is fine but if something is writing on shared object then read should not be allowed. If write operation is on the go, and we allow multiple readers to read it then every reader might get different value. And there should not be multiple write operations at a time.

Question 4

What are 2 solutions of readers and writers problem

Answer 4

1. First readers and writers problem

2. Second readers and writers problem

Question 5

What is First readers and writers problem

Answer 5

No reader will be kept waiting unless a writer has already obtained permission to use the shared object.

Question 6

What is second readers and writers problem

Answer 6

It a writer is ready, it waits for the minimum amount of time.

Question 7

What are dining philosophers problem

Answer 7

There are 5 philosophers and their life is thinking and eating. They have only 2 chopstick and they agreed first they will carry right chopstick and then left chopstick. But one sad day all 5 become hungry at the same time and all of them picked right chopstick. They halted and all died because of hunger. It is problem of starvation.