Untitled

#include<stdic ho

#include<conio.

#define max 5

int queue max

int front-1, rear-1;

int choices

void main()

void insert()

void delet)

void display();

clrscr(

    printf (1 ansert n
    
    printf (2 delete
    
    printf (3.display In
    
    printf (4 exit :
    
    while (1)
    
    All green color lines indicates, these lines are same as in the program for queue
    
    printf("enter choice:");
    
    scanf("%d", &choice)
    
    switch (choice)
    
    void insert()
    
    case 1. insert();
    
    cane 2: delet()
    
    case 3: display (X
    
    cane 4: exit(1);
    
    break
    
    break;
    
    break
    
    break:
    
    default printf("invalid choice\n"); break;
    
    14
    
    (

        if (front & rear max 1 front rear+1)

        printf overflow \n");

        else if (rear-1)

        All red color lines indicates, these lines are to be written only for the circular queue

        front

        else if (rear max-1)

        else

        rear Q

        1

        printf("insert an element:
        
        scanf("%d", & queue[rear]):
        
        1
        
        void delet()
        
        (

            if (front-1)

            printf ("underflow \n");

            retum

            else if (front rear)

            front-1 rear-1

            else if (front так-1)

            4

            front Q

            1

            else

            front++

            1

            printf (element is deleted in
            
            void display)

            int (front)

            printf ("queue is empty in
            
            1
            
            else if (front rear)
            
            printf("\n-elements of queue are for(i-front; ix-max-1;i++)
            
            priritf ("%d", queun[i]);
            
            for(i=0;irear;i++) printf idqueue[i])
            
            alse //front rear
            
            1
            
            pomf)
        ))
    ))))))
)