Pizza Studying Problem

The Pizza Studying Problem

Background

Develop a C program, named pizzastudy.c, that solves the following scenario using semaphores and (or) mutexes:

You and a group of classmates get together to study, but (of course) you can only study while eating Seasons pizza. All students in your group can only study when eating pizza (slices are not shared between students). Thus, the basic algorithm that a student follows is:

while(true){

pick up a slice of pizza

study while eating pizza slice

}

If someone (you or of your study partners) finds that there are no more slices of pizza L, they take a nap until another pizza arrives. However, the first person that finds that there is no more pizza will call up Seasons to order another pizza before taking a nap.

Your developed code should take in a single runtime argument representing the number of students in study group and should be between 2-5. You can assume there are 8 slices per pizza and your program should quit after 13 pizzas are consumed.

Your solution must synchronize between the student threads (determined by the number of students in the study group passed in as a runtime parameter) and the pizza delivery thread. You must ensure that deadlock situations are avoided, and that Seasons is only called one time for each ordered pizza.

Finally, your solution should print to the console information that includes when a student eats a slice of pizza (“Student 1 eats slice 5 from pizza 3”), when a new pizza is ordered (“Student 3 orders pizza 4”), and when a pizza is delivered (“Pizza 6 is delivered”).

1. Once working, include three screenshots of successful runs of the program along with the source code.

To ensure concurrent execution, use the sleep() function from unistd.h to mimic a studying or napping student. The following puts the current thread to sleep for 0-2 seconds.

#include <unistd.h>

// Going to sleep until the sleep function returns

sleep(rand() % 3);

// Guh! I’m awake!