Scribd Logo
Upload

Welcome to Scribd!

  • Circular Queue

    Uploaded by

    movingabdul
    12 views3 pages
    The useful property of a circular buffer is that it does not need to have its elements shuffled around when one is consumed. (If a non-circular buffer were used then it would be necessary to shift all elements when one is consumed.) In other words, the circular buffer is well-suited as a FIFO buffer while a standard, non-circular buffer is well suited as a LIFO buffer. Circular buffering makes a good implementation strategy for a queue that has fixed maximum size. Should a maximum size be adopted for a queue, then a circular buffer is a completely ideal implementation; all queue operations are constant time. However, expanding a circular buffer requires shifting memory, which is comparatively costly. For arbitrarily expanding queues, a linked list approach may be preferred instead. In some situations, overwriting circular buffer can be used, e.g. in multimedia. If the buffer is used as the bounded buffer in the producer-consumer problem then it is probably desired for the producer (e.g., an audio generator) to overwrite old data if the consumer (e.g., the sound card) is unable to momentarily keep up. Also, the LZ77 family of lossless data compression algorithms operates on the assumption that strings seen more recently in a data stream are more likely to occur soon in the stream. Implementations store the most recent data in a circular buffer.

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The useful property of a circular buffer is that it does not need to have its elements shuffled around when one is consumed. (If a non-circular buffer were used then it would be necessary to shift all elements when one is consumed.) In other words, the circular buffer is well-suited as a FIFO buffer while a standard, non-circular buffer is well suited as a LIFO buffer. Circular buffering makes a good implementation strategy for a queue that has fixed maximum size. Should a maximum size be adopted for a queue, then a circular buffer is a completely ideal implementation; all queue operations are constant time. However, expanding a circular buffer requires shifting memory, which is comparatively costly. For arbitrarily expanding queues, a linked list approach may be preferred instead. In some situations, overwriting circular buffer can be used, e.g. in multimedia. If the buffer is used as the bounded buffer in the producer-consumer problem then it is probably desired for the producer (e.g., an audio generator) to overwrite old data if the consumer (e.g., the sound card) is unable to momentarily keep up. Also, the LZ77 family of lossless data compression algorithms operates on the assumption that strings seen more recently in a data stream are more likely to occur soon in the stream. Implementations store the most recent data in a circular buffer.

    Copyright:

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

    Circular Queue

    Uploaded by

    movingabdul
    The useful property of a circular buffer is that it does not need to have its elements shuffled around when one is consumed. (If a non-circular buffer were used then it would be necessary to shift all elements when one is consumed.) In other words, the circular buffer is well-suited as a FIFO buffer while a standard, non-circular buffer is well suited as a LIFO buffer. Circular buffering makes a good implementation strategy for a queue that has fixed maximum size. Should a maximum size be adopted for a queue, then a circular buffer is a completely ideal implementation; all queue operations are constant time. However, expanding a circular buffer requires shifting memory, which is comparatively costly. For arbitrarily expanding queues, a linked list approach may be preferred instead. In some situations, overwriting circular buffer can be used, e.g. in multimedia. If the buffer is used as the bounded buffer in the producer-consumer problem then it is probably desired for the producer (e.g., an audio generator) to overwrite old data if the consumer (e.g., the sound card) is unable to momentarily keep up. Also, the LZ77 family of lossless data compression algorithms operates on the assumption that strings seen more recently in a data stream are more likely to occur soon in the stream. Implementations store the most recent data in a circular buffer.

    Copyright:

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

    /* INSERTION AND DELETION IN A CIRCULAR QUEUE ARRAY IMPLEMENTATION */

    /* QUEUEID.C */
    # include<stdio.h>
    # include<string.h>
    # include<ctype.h>
    # include<stdlib.h>
    # define size 6
    int L, U; /* L means lower bound U means upper bound */
    int ch;
    int q[size];
    int rear = -1;
    int front = -1;
    void Insert_queue();
    void Delete_queue();
    void Display_queue();
    /* Function to create queue */
    void Insert_queue()
    {
    if ((front == 0) && (rear == size-1))
    {
    printf("\n Overflow");
    rear = 1;
    return;
    }
    else
    if (front < 0) /* Insert first element */
    {
    front = 0;
    rear = 0;
    printf("\nInput the element :");
    scanf("%d", &ch);
    q[rear] = ch ;
    }
    else
    if (rear == size-1)
    {
    rear = 0;
    printf("\n Input the element :");
    scanf("%d", &ch);
    q[rear] = ch ;
    }
    else
    {
    rear ++;
    printf("\n Input the element :");
    scanf("%d", &ch);
    q[rear] = ch ;
    }
    }
    /* Function to perform delete operation */
    void Delete_queue()
    {
    if (front < 0)
    {
    printf("\nUnderflow");
    return ;
    }
    ch = q[front];
    q[front] = NULL;
    printf("\n Element deleted :", ch);
    if(front == rear)
    {
    front = -1;
    rear = -1;
    }
    else
    if ( front == size-1)
    {
    front = 0;
    }
    else
    {
    front++ ;
    }
    }
    /* Output function */
    void Display_queue()
    {
    int i;
    if (front < 0)
    return;
    if ( rear >= front)
    {
    for(i = front; i <= rear; i++)
    {
    printf("\n i = %d", i);
    printf(" %d ", q[i]);
    }
    }
    else
    {
    for(i = front; i < size; i++)
    {
    printf("\n i = %d", i);
    printf(" %d", q[i]);
    }
    for(i = 0; i <= rear; i++)
    {
    printf("\n i = %d", i);
    printf(" %d ", q[i]);
    }
    }
    }
    /* Function main */
    void main()
    {
    int k = 0;
    char choice;
    do
    {
    printf("\nInsert->i Delete->d Quit->q:");
    printf("\nInput the choice : ");
    do
    {
    choice = getchar();
    choice = tolower(choice);
    }while(strchr("idq",choice)==NULL);
    printf("Your choice is: %c",choice);
    switch(choice)
    {
    case 'i' :
    Insert_queue();
    printf("\nQueue after inserting ");
    Display_queue();
    break;
    case 'd' :
    Delete_queue();
    printf("\nQueue content after deleteion is as follows:\n
    ");
    Display_queue();
    break;
    case 'q':
    k = 1;
    }
    } while(!k);
    }

    You might also like