DS | Practical-6 | C Program to Implement of Circular Queue Using Array

on

 

Write a C Program to Implement of Circular Queue Using Array.


GTU DS Practical-6

Write a program to implement Circular Queue using arrays that perform the following
operations. 

(a) INSERT (b) DELETE (c) DISPLAY


  1. #include<stdlib.h>
  2. #include<stdio.h>
  4. #define max 5
  6. int front=-1,rear=-1; // global variable
  7. int CQueue[max];
  9. void insert();
  10. int delete();
  11. void display();
  13. int main()
  14. {
  15. int w,no;
  16. for(;;)
  17. {
  18. printf("\n1. Insert");
  19. printf("\n2. Delete");
  20. printf("\n3. Display");
  21. printf("\n4. EXIT");
  22. printf("\nEnter what you want :");
  23. scanf("%d",&w);
  25. switch(w)
  26. {
  27. case 1:
  28. insert();
  29. break;
  30. case 2:
  31. no=delete();
  32. break;
  33. case 3:
  34. display();
  35. break;
  36. case 4:
  37. exit(1);
  38. default:
  39. printf("\nInvalid Choice !!\n");
  40. }
  41. }
  42. }
  44. void insert()
  45. {
  46. int no;
  47. if((front ==0 && rear == max-1) || front == rear+1)
  48. {
  49. printf("\nCircular Queue Is Full !\n");
  50. return;
  51. }
  52. printf("\nEnter a number to Insert :");
  53. scanf("%d",&no);
  54. if(front==-1)
  55. front=front+1;
  56. if(rear==max-1)
  57. rear=0;
  58. else rear=rear+1;
  59. CQueue[rear]=no;
  60. }
  62. int delete()
  63. {
  64. int e;
  65. if(front==-1)
  66. {
  67. printf("\nThe Circular Queue is Empty !!\n");
  69. }
  70. e=CQueue[front];
  71. if(front==max-1)
  72. front=0;
  73. else if(front==rear)
  74. {
  75. front=-1;
  76. rear=-1;
  77. }
  78. else front=front+1;
  79. printf("\n%d was deleted !\n",e);
  80. return e;
  81. }
  83. void display()
  84. {
  85. int i;
  86. if(front==-1)
  87. {
  88. printf("\nThe Circular Queue is Empty ! Nothing To Display !!\n");
  89. return;
  90. }
  91. i=front;
  92. if(front<=rear)
  93. {
  94. printf("\n\n");
  95. while(i<=rear)
  96. printf("%d ",CQueue[i++]);
  97. printf("\n");
  98. }
  99. else
  100. {
  101. printf("\n\n");
  102. while(i<=max-1)
  103. printf("%d ",CQueue[i++]) ;
  104. i=0;
  105. while(i<=rear)
  106. printf("%d ",CQueue[i++]);
  107. printf("\n");
  108. }
  109. }

Output

Go to Home Page :

Practical - 5 :

Practical - 7 :

Comments

Post a Comment