Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 61 views

    Topic 04 Queues

    Uploaded by

    Husnain Sabir
    This document defines a Queue class in C++ with methods to add and remove elements. The Queue is implemented with a fixed-size array and uses front and rear pointers to track the first and last elements. The add method inserts a new element at the rear of the queue, incrementing rear and wrapping it to the beginning of the array if needed. The remove method removes the front element, incrementing front and wrapping it if needed. Additional methods check if the queue is full or empty.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Topic 04 Queues

    Uploaded by

    Husnain Sabir
    61 views29 pages
    This document defines a Queue class in C++ with methods to add and remove elements. The Queue is implemented with a fixed-size array and uses front and rear pointers to track the first and last elements. The add method inserts a new element at the rear of the queue, incrementing rear and wrapping it to the beginning of the array if needed. The remove method removes the front element, incrementing front and wrapping it if needed. Additional methods check if the queue is full or empty.

    Original Description:

    data structures and alogrithms

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document defines a Queue class in C++ with methods to add and remove elements. The Queue is implemented with a fixed-size array and uses front and rear pointers to track the first and last elements. The add method inserts a new element at the rear of the queue, incrementing rear and wrapping it to the beginning of the array if needed. The remove method removes the front element, incrementing front and wrapping it if needed. Additional methods check if the queue is full or empty.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    61 views29 pages

    Topic 04 Queues

    Uploaded by

    Husnain Sabir
    This document defines a Queue class in C++ with methods to add and remove elements. The Queue is implemented with a fixed-size array and uses front and rear pointers to track the first and last elements. The add method inserts a new element at the rear of the queue, incrementing rear and wrapping it to the beginning of the array if needed. The remove method removes the front element, incrementing front and wrapping it if needed. Additional methods check if the queue is full or empty.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 29

    Data Structures

    Afsah Imtiaz Elahi, Data Structures 18


    class Queue {
    public:
    Queue(int s = 10); // constructor - default size = 10
    ~Queue() {delete [ ] QueueArray; } // destructor
    bool add (int);
    bool remove (int &);
    bool isFull() {return size == MaxSize;}
    bool isEmpty() {return size == 0; }
    private:
    int maxSize; // max Queue size
    int front, rear;
    int *QueueArray;
    int size; // no. of elements in the Queue
    };
    bool Queue::add(int n)
    {
    if (! isFull() ) {
    QueueArray[rear] = n;
    rear++;
    if (rear == maxSize) 3
    rear = 0;
    size++; 2
    return true;
    } 1
    else return false; MS-1 0
    }
    bool Queue::remove(int &n)
    {
    if (! isEmpty() {
    n = QueueArray[front];
    front++;
    3 if (front == maxSize)
    front = 0;
    2 size--;
    return true;
    1
    MS-1 0 }
    else return false;
    }
    Queue::Queue(int s)
    {
    if (s <= 0) MaxSize = 10; else MaxSize = s;
    QueueArray = new int[MaxSize];
    size = 0; rear = 0; front = 0; 3

    } 2
    bool Queue::isFull() {return size == MaxSize;} 1
    bool Queue::isEmpty() {return size == 0; }
    MS-1 0
    bool Queue::add(int n) bool Queue::remove(int &n)
    { {
    if (! isFull() ) { if (! isEmpty() ) {
    QueueArray[rear] = n; n = QueueArray[rear];
    rear++; front++;
    if (rear == maxSize) if (front == maxSize)
    rear = 0; front = 0;
    size++; size--;
    return true; return true;
    } }
    else return false; else return false;
    } }
    Add: rear = (rear + 1) % maxSize;

    Remove: front = (front + 1) % maxSize;


    3

    1
    MS-1 0
    bool Queue::add(int n) bool Queue::remove(int &n)
    { {
    if (! isFull() ) { if (! isEmpty() {
    QueueArray[rear] = n; n = QueueArray[front];
    rear++; front++;
    if (rear == maxSize) if (front == maxSize)
    rear = 0; front = 0;
    size++; size--;
    return true; return true;
    } }
    else return false; else return false;
    } }
    isEmpty: rear == front

    isFull: rear == (front + 1) % MaxSize


    3

    2
    isEmpty: size == 0
    1
    isFull: size == maxSize MS-1 0
    bool Queue::add(int n) bool Queue::remove(int &n)
    { {
    if (! isFull() ) { if (! isEmpty() {
    QueueArray[rear] = n; n = QueueArray[front];
    rear++; front++;
    if (rear == maxSize) if (front == maxSize)
    rear = 0; front = 0;
    size++; size--;
    return true; return true;
    } }
    else return false; else return false;
    } }
    Afsah Imtiaz Elahi, Data Structures 25
     Introduction to Data Structures and Algorithm
    Analysis With C++, by D. Samanta

     Data Structures and Algorithm Analysis in


    C++ by Mark Allen Weiss

    Afsah Imtiaz Elahi, Data Structures 29

    You might also like