Scribd Logo
Upload

Welcome to Scribd!

  • Insert Circular

    Uploaded by

    nsalgaocar
    5 views1 page
    This document describes how to insert an item into a circular queue. It involves checking if the queue is full by comparing the front and rear pointers, and if not full, inserting the item into the queue array at the rear position and incrementing the rear pointer. If the rear is at the end of the array, it is set back to 1 to circularly increment in the queue array.

    Original Description:

    Original Title

    insert-circular

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes how to insert an item into a circular queue. It involves checking if the queue is full by comparing the front and rear pointers, and if not full, inserting the item into the queue array at the rear position and incrementing the rear pointer. If the rear is at the end of the array, it is set back to 1 to circularly increment in the queue array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views1 page

    Insert Circular

    Uploaded by

    nsalgaocar
    This document describes how to insert an item into a circular queue. It involves checking if the queue is full by comparing the front and rear pointers, and if not full, inserting the item into the queue array at the rear position and incrementing the rear pointer. If the rear is at the end of the array, it is set back to 1 to circularly increment in the queue array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    www.eazynotes.com Gursharan Singh Tatla Page No.

    INSERT INTO CIRCULAR QUEUE

    Insert Circular ( ):
    Description: Here QUEUE is an array with N locations. FRONT and REAR points to the front and rear
    elements of the QUEUE. ITEM is the value to be inserted.

    1. If (FRONT == 1 and REAR == N) or (FRONT == REAR + 1) Then


    2. Print: Overflow
    3. Else
    4. If (REAR == 0) Then [Check if QUEUE is empty]
    (a) Set FRONT = 1
    (b) Set REAR = 1
    5. Else If (REAR == N) Then [If REAR reaches end if QUEUE]
    6. Set REAR = 1
    7. Else
    8. Set REAR = REAR + 1 [Increment REAR by 1]
    [End of Step 4 If]
    9. Set QUEUE[REAR] = ITEM
    10. Print: ITEM inserted
    [End of Step 1 If]
    11. Exit

    You might also like