This document provides code for implementing a queue data structure in Python. The code defines functions for enqueueing (adding) an item to the rear of the queue, dequeuing (removing) an item from the front of the queue, and getting the front and rear items. It also includes sample output showing items being added and removed from the queue and the front and rear items being retrieved.

1. Implemeting queue in
python
Actual source code

2. def enqueue(self, item):
if self.is_full():
return
self.rear = (self.rear + 1) % self.capacity
self.array[self.rear] = item
self.size += 1
print(f"{item} enqueued to queue")
def dequeue(self):
if self.is_empty():
return None
item = self.array[self.front]
self.front = (self.front + 1) % self.capacity
self.size -= 1
return item
def get_front(self):
if self.is_empty():
return None
return self.array[self.front]
def get_rear(self):
if self.is_empty():

3. OUTPUT OF THE CODE
"D:KYUYEAR 3 SEM 1Data structuresAssignment
1venvScriptspython.exe" "D:KYUYEAR 3 SEM 1Data
structuresAssignment 1queesinpython.py"
10 enqueued to queue
20 enqueued to queue
30 enqueued to queue
40 enqueued to queue
10 dequeued from queue
Front item is 20
Rear item is 40