Static Implementation of Linear Queue

 Static Implementation of Linear 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 = -1;
12. }
13. 
    
14. void addQ(QUEUE *pq, int num)
15. {
16. pq->rear++;
17. pq->data[pq->rear] = num;
18. }
19. 
    
20. int delQ(QUEUE *pq)
21. {
22. int num;
23. pq->front++;
24. num=pq->data[pq->front];
25. return (num);
26. }
27. 
    
28. int isempty(QUEUE *pq)
29. {
30. return(pq->front == pq->rear);
31. }
32. 
    
33. int isfull(QUEUE *pq)
34. {
35. return(pq->rear == MAX-1);
36. }
37. 
    
38. void main()
39. {
40. int n, choice;
41. QUEUE q1;
42. initQ(&q1);
43. printf(">>Static Implementation Of Queue<<");
44. do
45. {
46. printf("\n1.ADD \n");
47. printf("2.DELETE \n");
48. printf("3.EXIT \n");
49. printf("Enter Your Choice: \t");
50. scanf("%d", &choice);
52. switch(choice)
53. {
54. case 1:
55. printf("Enter Element To Be Added:");
56. scanf("%d", &n);
57. if(isfull(&q1))
58. printf(">>Queue Overflow<<");
59. else
60. addQ(&q1, n);
61. break;
63. case 2:
64. if(isempty(&q1)==1)
65. printf(">>Queue Is Empty<<");
66. else
67. printf("The Deleted Element Is:%d \n", delQ(&q1));
68. break;
70. case 3:
71. printf("\t>>End <<\n");
72. break;
74. default:
75. printf(">>Enter Right Choice<<\n");
76. break;
77. }
78. }while(choice!=3);
79. }

👉Execute👈

//OUTPUT

/*

>>Static Implementation Of Queue<<

1.ADD

2.DELETE

3.EXIT

Enter Your Choice:      1

Enter Element To Be Added:5

1.ADD

2.DELETE

3.EXIT

Enter Your Choice:      2

The Deleted Element Is:5

1.ADD

2.DELETE

3.EXIT

Enter Your Choice:      4

>>Enter Right Choice<<

1.ADD

2.DELETE

3.EXIT

Enter Your Choice:      3

        >>End <<

*/

                                                                                          //ThE ProFessoR