🎓 Top 15 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare — All my Udemy courses are real-time and project oriented courses.
▶️ Subscribe to My YouTube Channel (178K+ subscribers): Java Guides on YouTube
▶️ For AI, ChatGPT, Web, Tech, and Generative AI, subscribe to another channel: Ramesh Fadatare on YouTube
1. Introduction
A queue is a linear data structure that follows the First In First Out (FIFO) principle. Elements are added (enqueued) to the back and removed (dequeued) from the front. In this post, we will learn how to implement a queue using Python's built-in list.
2. Program Overview
1. Define a class called Queue.
2. Initialize an empty list in the constructor to represent the queue.
3. Define methods: enqueue, dequeue, is_empty, size, and peek.
4. Demonstrate the queue operations with some sample values.
3. Code Program
class Queue:
def __init__(self):
# Initialize an empty list to store elements of the queue
self.items = []
def enqueue(self, item):
# Add the item to the end of the list (rear of the queue)
self.items.append(item)
def dequeue(self):
# Remove the item from the front of the list (front of the queue) and return it
if not self.is_empty():
return self.items.pop(0)
return None
def is_empty(self):
# Check if the queue is empty
return len(self.items) == 0
def size(self):
# Return the number of items in the queue
return len(self.items)
def peek(self):
# View the front item without removing it
if not self.is_empty():
return self.items[0]
return None
# Demonstration:
queue = Queue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
print("Front of the queue:", queue.peek())
print("Size of the queue:", queue.size())
print("Dequeued:", queue.dequeue())
print("Size after dequeue:", queue.size())
Output:
Front of the queue: 1 Size of the queue: 3 Dequeued: 1 Size after dequeue: 2
4. Step By Step Explanation
1. A class named Queue is defined.
2. Inside the __init__ method, an empty list items is initialized. This list will act as our queue.
3. The enqueue method appends an item to the end of the list, thus adding it to the rear of the queue.
4. The dequeue method removes and returns the item at the start of the list, representing the front of the queue.
5. is_empty checks if the queue is empty by verifying the length of the items list.
6. size returns the count of items in the queue.
7. peek provides a view of the front item without removing it.
8. In the demonstration part, we initialize the queue, enqueue three items, peek at the front, and then dequeue an item, displaying the results at each step.
My Top and Bestseller Udemy Courses. The sale is going on with a 70 - 80% discount. The discount coupon has been added to each course below:
Build REST APIs with Spring Boot 4, Spring Security 7, and JWT
![[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25](https://img-c.udemycdn.com/course/750x422/6852721_b512_2.jpg "[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25")
[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25
ChatGPT + Generative AI + Prompt Engineering for Beginners
Spring 7 and Spring Boot 4 for Beginners (Includes 8 Projects)
Available in Udemy for Business
Building Real-Time REST APIs with Spring Boot - Blog App
Available in Udemy for Business
Building Microservices with Spring Boot and Spring Cloud
Available in Udemy for Business
Java Full-Stack Developer Course with Spring Boot and React JS
Available in Udemy for Business
Build 5 Spring Boot Projects with Java: Line-by-Line Coding
Testing Spring Boot Application with JUnit and Mockito
Available in Udemy for Business
Spring Boot Thymeleaf Real-Time Web Application - Blog App
Available in Udemy for Business
Master Spring Data JPA with Hibernate
Available in Udemy for Business
Spring Boot + Apache Kafka Course - The Practical Guide
Available in Udemy for Business
Comments
Post a Comment
Leave Comment