Scribd
Upload
13 views

Queue Using Array C

The document defines a Queue class with methods to add and remove elements from the queue. It includes functions for enqueue, dequeue, checking if full or empty, and displaying the queue. It tests the class by enqueueing and dequeueing elements and checking for overflow and underflow conditions.

Uploaded by

Vansh Pahuja
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
13 views

Queue Using Array C

The document defines a Queue class with methods to add and remove elements from the queue. It includes functions for enqueue, dequeue, checking if full or empty, and displaying the queue. It tests the class by enqueueing and dequeueing elements and checking for overflow and underflow conditions.

Uploaded by

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

#include <iostream>

using namespace std;

class Queue{
private:
int size;
int front;
int rear;
int* Q;
public:
Queue(int size);
~Queue();
bool isFull();
bool isEmpty();
void enqueue(int x);
int dequeue();
void display();
};

Queue::Queue(int size) {
this->size = size;
front = -1;
rear = -1;
Q = new int [size];
}

Queue::~Queue() {
delete [] Q;
}

bool Queue::isEmpty() {
if (front == rear){
return true;
}
return false;
}

bool Queue::isFull() {
if (rear == size-1){
return true;
}
return false;
}

void Queue::enqueue(int x) {
if (isFull()){
cout << "Queue Overflow" << endl;
} else {
rear++;
Q[rear] = x;
}
}

int Queue::dequeue() {
int x = -1;
if (isEmpty()){
cout << "Queue Underflow" << endl;
} else {
front++;
x = Q[front];
}
return x;
}

void Queue::display() {
for (int i=front+1; i<=rear; i++){
cout << Q[i] << flush;
if (i < rear){
cout << " <- " << flush;
}
}
cout << endl;
}

int main() {

int A[] = {1, 3, 5, 7, 9};

Queue q(sizeof(A)/sizeof(A[0]));

// Enqueue
for (int i=0; i<sizeof(A)/sizeof(A[0]); i++){
q.enqueue(A[i]);
}

// Display
q.display();

// Overflow
q.enqueue(10);

// Dequeue
for (int i=0; i<sizeof(A)/sizeof(A[0]); i++){
q.dequeue();
}

// Underflow
q.dequeue();

return 0;
}

You might also like