How do I implement a linear queue in programming?

How do I implement a linear queue in programming?

To implement a linear queue, you can use an array or a linked list. Would you like a code example?

Yes, please provide a code example using an array.

Here's a simple implementation in Python:

class LinearQueue:
    def __init__(self, size):
        self.size = size
        self.queue = [None] * size
        self.front = -1
        self.rear = -1

    def enqueue(self, item):
        if self.rear == self.size - 1:
            print('Queue is full')
        else:
            if self.front == -1:
                self.front = 0
            self.rear += 1
            self.queue[self.rear] = item

    def dequeue(self):
        if self.front == -1:
            print('Queue is empty')
        else:
            item = self.queue[self.front]
            self.queue[self.front] = None
            self.front += 1
            if self.front > self.rear:
                self.front = self.rear = -1
            return item

What are the time complexities for enqueue and dequeue operations?

Both enqueue and dequeue operations in a linear queue have a time complexity of O(1), meaning they execute in constant time.