Implement Deque using circular array
Write a C Program to implement Deque using circular array. Here’s simple Program to implement Deque using circular array in C Programming Language.
What is Queue ?
Queue is also an abstract data type or a linear data structure, in which the first element is inserted from one end called REAR, and the deletion of existing element takes place from the other end called as FRONT.
This makes queue as FIFO data structure, which means that element inserted first will also be removed first.
Basic Operations : :
- enqueue() − add (store) an item to the queue.
- dequeue() − remove (access) an item from the queue.
- peek() − Gets the element at the front of the queue without removing it.
- isfull() − Checks if the queue is full.
- isempty() − Checks if the queue is empty.
Below is the source code for C Program to implement Deque using circular array which is successfully compiled and run on Windows System to produce desired output as shown below :
SOURCE CODE : :
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 |
/* C Program to implement Deque using circular array */ #include<stdio.h> #include<stdlib.h> #define MAX 7 int deque_arr[MAX]; int front=-1; int rear=-1; void insert_frontEnd(int item); void insert_rearEnd(int item); int delete_frontEnd(); int delete_rearEnd(); void display(); int isEmpty(); int isFull(); int main() { int choice,item; while(1) { printf("\n\n1.Insert at the front end\n"); printf("2.Insert at the rear end\n"); printf("3.Delete from front end\n"); printf("4.Delete from rear end\n"); printf("5.Display\n"); printf("6.Quit\n"); printf("\nEnter your choice : "); scanf("%d",&choice); switch(choice) { case 1: printf("\nInput the element for adding in queue : "); scanf("%d",&item); insert_frontEnd(item); break; case 2: printf("\nInput the element for adding in queue : "); scanf("%d",&item); insert_rearEnd(item); break; case 3: printf("\nElement deleted from front end is : %d\n",delete_frontEnd()); break; case 4: printf("\nElement deleted from rear end is : %d\n",delete_rearEnd()); break; case 5: display(); break; case 6: exit(1); default: printf("\nWrong choice\n"); }/*End of switch*/ printf("\nfront = %d, rear =%d\n", front , rear); display(); }/*End of while*/ }/*End of main()*/ void insert_frontEnd(int item) { if( isFull() ) { printf("\nQueue Overflow\n"); return; } if( front==-1 )/*If queue is initially empty*/ { front=0; rear=0; } else if(front==0) front=MAX-1; else front=front-1; deque_arr[front]=item ; }/*End of insert_frontEnd()*/ void insert_rearEnd(int item) { if( isFull() ) { printf("\nQueue Overflow\n"); return; } if(front==-1) /*if queue is initially empty*/ { front=0; rear=0; } else if(rear==MAX-1) /*rear is at last position of queue */ rear=0; else rear=rear+1; deque_arr[rear]=item ; }/*End of insert_rearEnd()*/ int delete_frontEnd() { int item; if( isEmpty() ) { printf("\nQueue Underflow\n"); exit(1); } item=deque_arr[front]; if(front==rear) /*Queue has only one element */ { front=-1; rear=-1; } else if(front==MAX-1) front=0; else front=front+1; return item; }/*End of delete_frontEnd()*/ int delete_rearEnd() { int item; if( isEmpty() ) { printf("\nQueue Underflow\n"); exit(1); } item=deque_arr[rear]; if(front==rear) /*queue has only one element*/ { front=-1; rear=-1; } else if(rear==0) rear=MAX-1; else rear=rear-1; return item; }/*End of delete_rearEnd() */ int isFull() { if ( (front==0 && rear==MAX-1) || (front==rear+1) ) return 1; else return 0; }/*End of isFull()*/ int isEmpty() { if( front == -1) return 1; else return 0; }/*End of isEmpty()*/ void display() { int i; if( isEmpty() ) { printf("\nQueue is empty\n"); return; } printf("\nQueue elements :\n"); i=front; if( front<=rear ) { while(i<=rear) printf("%d ",deque_arr[i++]); } else { while(i<=MAX-1) printf("%d ",deque_arr[i++]); i=0; while(i<=rear) printf("%d ",deque_arr[i++]); } printf("\n"); }/*End of display() */ |
OUTPUT : :
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 |
/* C Program to implement Deque using circular array */ 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 1 Input the element for adding in queue : 1 front = 0, rear =0 Queue elements : 1 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 2 Input the element for adding in queue : 2 front = 0, rear =1 Queue elements : 1 2 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 1 Input the element for adding in queue : 3 front = 6, rear =1 Queue elements : 3 1 2 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 2 Input the element for adding in queue : 4 front = 6, rear =2 Queue elements : 3 1 2 4 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 1 Input the element for adding in queue : 5 front = 5, rear =2 Queue elements : 5 3 1 2 4 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 2 Input the element for adding in queue : 6 front = 5, rear =3 Queue elements : 5 3 1 2 4 6 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 3 Element deleted from front end is : 5 front = 6, rear =3 Queue elements : 3 1 2 4 6 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 4 Element deleted from rear end is : 6 front = 6, rear =2 Queue elements : 3 1 2 4 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 5 Queue elements : 3 1 2 4 front = 6, rear =2 Queue elements : 3 1 2 4 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 3 Element deleted from front end is : 3 front = 0, rear =2 Queue elements : 1 2 4 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 4 Element deleted from rear end is : 4 front = 0, rear =1 Queue elements : 1 2 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 3 Element deleted from front end is : 1 front = 1, rear =1 Queue elements : 2 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 4 Element deleted from rear end is : 2 front = -1, rear =-1 Queue is empty 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 5 Queue is empty front = -1, rear =-1 Queue is empty 1.Insert at the front end 2.Insert at the rear end 3.Delete from front end 4.Delete from rear end 5.Display 6.Quit Enter your choice : 6 Process returned 1 |
If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.
Thanks for reading the post….
Thanks! A clean code snippet