0% found this document useful (0 votes)
6 views

Document

Uploaded by

nishitsavaliya5
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views

Document

Uploaded by

nishitsavaliya5
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Class Queue:

Def __init__(self, size):

Self.size = size

Self.queue = []

Def is_empty(self):

Return len(self.queue) == 0

Def is_full(self):

Return len(self.queue) == self.size

Def enqueue(self, item):

If self.is_full():

Print(“Queue is full!”)

Else:

Self.queue.append(item)

Print(f”Enqueued: {item}”)

Def dequeue(self):

If self.is_empty():

Print(“Queue is empty!”)

Else:

Item = self.queue.pop(0)

Print(f”Dequeued: {item}”)

Return item

Def display(self):
If self.is_empty():

Print(“Queue is empty!”)

Else:

Print(“Queue:”, self.queue)

# Initialize a queue with size 5

Queue = Queue(5)

# Example usage

Queue.enqueue(10)

Queue.enqueue(20)

Queue.enqueue(30)

Queue.enqueue(40)

Queue.enqueue(50)

Queue.display()

# Trying to enqueue another element (should display “Queue is full!”)

Queue.enqueue(60)

# Dequeue elements

Queue.dequeue()

Queue.dequeue()

Queue.display()

You might also like