Scribd Logo
Upload

Welcome to Scribd!

  • Double Ended Queue

    Uploaded by

    joshi
    5 views10 pages
    The document describes operations for adding and removing items from the rear and front of a deque data structure. It provides code to check for overflow and underflow conditions and update pointers and counters when adding or removing items from either end of the deque.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes operations for adding and removing items from the rear and front of a deque data structure. It provides code to check for overflow and underflow conditions and update pointers and counters when adding or removing items from either end of the deque.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    5 views10 pages

    Double Ended Queue

    Uploaded by

    joshi
    The document describes operations for adding and removing items from the rear and front of a deque data structure. It provides code to check for overflow and underflow conditions and update pointers and counters when adding or removing items from either end of the deque.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 10

    Add Rear Operation in Deque

    if(te==size)
    {
    printf("Queue is full\n");
    }
    else
    {
    R=(R+1)%size;
    arr[R]=new_item;
    te=te+1;
    }
    Delete Rear Operation in Deque

    if(te==0)
    {
    printf("Queue is empty\n");
    }
    else
    {
    if(R==-1)
    {
    R=size-1;
    }
    printf("Number Deleted From Rear End = %d",arr[R]);
    R=R-1;
    te=te-1;
    }
    Add Front Operation in Deque
    Add Front Operation in Deque
    if(te==size)
    {
    printf("Queue is full");
    }
    else
    {
    if(F==0)
    {
    F=size-1;
    }
    else
    {
    F=F-1;
    }
    arr[F]=new_item;
    te=te+1;
    }
    Delete Front Operation in Deque
    Delete Front Operation in Deque

    if(te==0)
    {
    printf("Queue is empty");
    }
    else
    {
    printf("Number Deleted From Front End = %d",arr[F]);
    F=(F+1)%size;
    te=te-1;
    }

    You might also like