What is a simple queue?

Can you explain what a simple queue is?

A simple queue is a data structure that follows the First In First Out (FIFO) principle, where the first element added is the first to be removed.

How is a simple queue different from a stack?

A stack follows the Last In First Out (LIFO) principle, meaning the last element added is the first to be removed, unlike a queue.

What are some common use cases for simple queues?

Simple queues are often used in scenarios like task scheduling, managing requests in web servers, and handling asynchronous data.

Can you show me a simple implementation of a queue in Python?

Sure! Here's a basic implementation using a list:

class SimpleQueue:
    def __init__(self):
        self.queue = []

    def enqueue(self, item):
        self.queue.append(item)

    def dequeue(self):
        return self.queue.pop(0) if self.queue else None

    def is_empty(self):
        return len(self.queue) == 0