Static Implementation of Circular Queue

Static Implementation of Circular Queue

CODE

👇

1. #include<stdio.h>
2. #define MAX 50
3. typedef struct
4. {
5.   int data[MAX];
6.   int front,rear;
7. }QUEUE;
8. 
   
9. void InitQ(QUEUE *pq)
10. {
11.   pq->front = pq->rear = MAX-1;
12. }
13. 
    
14. void AddQ(QUEUE *pq, int num)
15. {
16.   pq->rear=(pq->rear+1)%MAX;
17. pq->data[pq->rear]=num;
18. }
19. 
    
20. int DelQ(QUEUE *pq)
21. {
22.   pq->front=(pq->front+1)%MAX;
23.   return(pq->data[pq->front]);
24. }
25. 
    
26. int isempty(QUEUE *pq)
27. {
28.   return(pq->front == pq->rear);
29. }
30. 
    
31. int isfull(QUEUE *pq)
32. {
33.   return((pq->rear+1)%MAX==pq->front);
34. }
35. 
    
36. void main()
37. {
38.   int num,choice;
39.   QUEUE q1;
40.   InitQ(&q1);
41.   printf(">>Static Implementation of Circular Queue<<\n");
42.   do
43.   {
44.     printf("\n1: Add \n");
45.     printf("2: Delete \n");
46.     printf("3: Exit \n");
47.     printf("Enter your choice: \t");
48.     scanf("%d",&choice);
49. 
    
50.     switch(choice)
51.     {
52.       case 1: printf("Enter Element To Be Added: \t");
53.       scanf("%d",&num);
54.       if(isfull(&q1))
55.       printf("Queue overflow \n");
56.       else
57.       AddQ(&q1,num);
58.       break;
59. 
    
60.     case 2: if(isempty(&q1))
61.       printf("Queue is empty \n");
62.       else
63.       printf("The Deleted Element is: %d \n",DelQ(&q1));
64.       break;
65. 
    
66.       case 3: printf("\t>>END<<");
67.       break;
68.      
69.       default: printf("\t>>Enter Right Choice<<");
70.  
71.     }
72.   }
73. while(choice!=3);
74. }

👉Execute👈

//Output

/*

>>Static Implementation of Circular Oueue<<

1: Add

2: Delete

3: Exit

Enter your choice:      1

Enter element to be added:      2

1: Add

2: Delete

3: Exit

Enter your choice:      2

The deleted element is 2

1: Add

2: Delete

3: Exit

Enter your choice:      4

        >>Enter Right Choice<<

1: Add

2: Delete

3: Exit

Enter your choice:      3

>>END<<

*/