Producer-Consumer Problem Solution with Circular Buffer

This code represents a solution to the producer-consumer problem using a circular buffer of size 'n'. The procedure entry 'put(item)' is executed by the producer to add an item to the buffer, while the procedure entry 'get(item)' is executed by the consumer to retrieve an item from the buffer.

The variables 'in', 'out', and 'count' keep track of the position of the next available slot in the buffer, the position of the next item to be retrieved from the buffer, and the number of items currently in the buffer, respectively.

The 'notfull' and 'notempty' conditions are used to signal when the buffer is not full and not empty, respectively. If the buffer is full, the producer will wait until a slot becomes available. If the buffer is empty, the consumer will wait until an item becomes available.

At the beginning, the 'in' and 'out' variables are set to 0, indicating that the buffer is initially empty. The 'count' variable is also set to 0, indicating that there are no items in the buffer yet.

Procedure entry put(item)

```if count ≥n then notfull.wait;
```buffer(in):=nextp;
```in:=(in+1)mod n
```count:=count+1;
```if notempty.queue then notempty.signal;
```end

**Procedure entry get(item)**
```begin
```if count ≤ 0 then notempty.wait;
```nextc:=buffer(out);
```out:=(out+1)mod n
```count:=count-1;
```if notfull.queue then notfull.signal;
```end

```Begin in:=out:=0; count:=0 end