Lab Cycle 2 — Stack & Queue

#include <iostream>
using namespace std;
#define MAX 5

int cqueue[MAX], front = -1, rear = -1;

void enqueue(int val) {
    if ((rear + 1) % MAX == front) { cout << "Queue Full\n"; return; }
    if (front == -1) front = 0;
    rear = (rear + 1) % MAX;
    cqueue[rear] = val;
}

void dequeue() {
    if (front == -1) { cout << "Queue Empty\n"; return; }
    cout << "Dequeued: " << cqueue[front] << endl;
    if (front == rear) front = rear = -1;
    else front = (front + 1) % MAX;
}

int main() {
    enqueue(10); enqueue(20); enqueue(30);
    dequeue();
    enqueue(40);
    return 0;
}