Scribd Logo
Upload

Welcome to Scribd!

  • Nitish

    Uploaded by

    saikatdebbarma61
    3 views3 pages
    This C program implements a circular queue using an array. It defines functions to insert, delete, and display elements in the queue. The main function contains a menu loop that calls the appropriate queue function based on the user's choice and checks if the queue is full or empty before each operation. The cqinsert function inserts an element into the queue by incrementing the rear index. The cqdelete function removes an element by incrementing the front index. And the display function prints all elements in the queue by traversing from front to rear.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C program implements a circular queue using an array. It defines functions to insert, delete, and display elements in the queue. The main function contains a menu loop that calls the appropriate queue function based on the user's choice and checks if the queue is full or empty before each operation. The cqinsert function inserts an element into the queue by incrementing the rear index. The cqdelete function removes an element by incrementing the front index. And the display function prints all elements in the queue by traversing from front to rear.

    Copyright:

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

    Nitish

    Uploaded by

    saikatdebbarma61
    This C program implements a circular queue using an array. It defines functions to insert, delete, and display elements in the queue. The main function contains a menu loop that calls the appropriate queue function based on the user's choice and checks if the queue is full or empty before each operation. The cqinsert function inserts an element into the queue by incrementing the rear index. The cqdelete function removes an element by incrementing the front index. And the display function prints all elements in the queue by traversing from front to rear.

    Copyright:

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

    #include<stdio.

    h>

    #include<stdlib.h>

    #define size 10

    void cqinsert(char queue[], int *rear, int *count);

    void cqdelete(char queue[], int *front, int *count);

    void display(char queue[], int front, int count);

    void main()

    char queue[size];

    int front = 0, rear = -1, ch, count = 0;

    for(;;)

    printf("\nMenu\n");

    printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n");

    scanf("%d", &ch);

    switch(ch)

    case 1:

    if(count == size)

    printf("Queue is Full\n");

    else
    cqinsert(queue, &rear, &count);

    break;

    case 2:

    if(count == 0)

    printf("Queue is Empty\n");

    else

    cqdelete(queue, &front, &count);

    break;

    case 3:

    if(count == 0)

    printf("Queue is Empty\n");

    else

    display(queue, front, count);

    break;

    case 4:

    exit(0);

    void cqinsert(char queue[], int *rear, int *count)

    char ele;

    printf("Enter a Character\n");

    scanf(" %c", &ele);


    *rear = (*rear + 1) % size;

    queue[*rear] = ele;

    (*count)++;

    void cqdelete(char queue[], int *front, int *count)

    printf("Deleted Character is %c\n", queue[*front]);

    *front = (*front + 1) % size;

    (*count)--;

    void display(char queue[], int front, int count)

    int i;

    printf("The Characters are\n");

    for(i=0; i<count; i++)

    printf("%c\t", queue[front]);

    front = (front + 1) % size;

    printf("\n");

    You might also like