1. Simulate the Producer Consumer code discussed in the class.
2. Extend the producer consumer simulation in Q1 to sync access of critical data using Petersons algorithm.
3. Dictionary Problem: Let the producer set up a dictionary of at least 20 words with three attributes (Word, Primary meaning, Secondary meaning) and let the consumer search for the word and retrieve its respective primary and secondary meaning.
Note: This can be implemented using either Mutex locks or Petersons algorithm.
Non-Mandatory (Extra credits):
4. Extend Q3 to avoid duplication of dictionary entries and implement an efficient binary search on the consumer side in a multithreaded fashion.
5. Trace and understand the working of synchronization algorithms like Dijkstra, Dekker’s algorithm
