Scribd Logo
Upload

Welcome to Scribd!

  • Queues

    Uploaded by

    Yash
    7 views3 pages
    This document defines a Queue class in C++ with methods to push and pop elements, check if the queue is empty, and access the front and back elements. It implements a queue using a fixed size array, tracking the front and rear indices. Methods are provided to add and remove elements from the queue, check for emptiness, and access the front and back elements without removing them. The main function demonstrates using the class by pushing and popping elements and printing results.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document defines a Queue class in C++ with methods to push and pop elements, check if the queue is empty, and access the front and back elements. It implements a queue using a fixed size array, tracking the front and rear indices. Methods are provided to add and remove elements from the queue, check for emptiness, and access the front and back elements without removing them. The main function demonstrates using the class by pushing and popping elements and printing results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views3 pages

    Queues

    Uploaded by

    Yash
    This document defines a Queue class in C++ with methods to push and pop elements, check if the queue is empty, and access the front and back elements. It implements a queue using a fixed size array, tracking the front and rear indices. Methods are provided to add and remove elements from the queue, check for emptiness, and access the front and back elements without removing them. The main function demonstrates using the class by pushing and popping elements and printing results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    #include <iostream>

    #include <bits/stdc++.h>

    # define MAX 1000

    using namespace std;

    class Queue

    int front,rear;

    public:

    int a[MAX];

    Queue(){

    front=rear=-1;

    bool push(int x);

    int pop();

    int fronts();

    int back();

    bool isEmpty();

    };

    bool Queue:: isEmpty()

    return (front==rear && front==-1);

    int Queue:: fronts()

    return a[front];

    int Queue:: back()

    return a[rear];

    bool Queue::push(int x)
    {

    if(rear>=MAX-1)

    cout<<"Queue is full";

    return false;

    else{

    if(front==-1){

    front=rear=0;

    a[front]=x;

    return true;

    else{

    a[++rear]=x;

    return true;

    int Queue::pop()

    if(front==-1){

    cout<<"Queue is empty";

    return -1;

    if(rear==front && front!=-1){

    int x=a[front];

    front=rear=-1;

    return x;

    else{

    int x=a[front++];
    return x;

    int main()

    Queue q;

    q.push(10);

    q.push(20);

    q.push(30);

    q.push(40);

    cout<<"Element popped is "<<q.pop()<<endl;

    q.pop();

    q.push(50);

    cout<<"Last element is "<<q.back()<<endl;

    while(!q.isEmpty())

    cout<<q.fronts()<<" ";

    q.pop();

    return 0;

    You might also like