{"id":11859,"date":"2023-01-20T06:44:43","date_gmt":"2023-01-20T06:44:43","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=11859"},"modified":"2023-09-22T07:57:39","modified_gmt":"2023-09-22T07:57:39","slug":"implementation-of-queue-using-array","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/implementation-of-queue-using-array\/","title":{"rendered":"Implementation of Queue using Array"},"content":{"rendered":"

\"\"<\/p>\n

Queues are essential in data structures for orderly data processing. Queue implementation becomes a powerful technique for organizing and controlling data flow when arrays are used as the foundation. This method enables first-in, first-out (FIFO) operations, which optimize tasks requiring structured data handling. In this article, we will see the implementation of Queue using Array.<\/p>\n

What is the Queue?<\/h2>\n

A queue is a linear data structure in which there are two sides: the front side and the rear side. It follows the first in first out (FIFO) methodology. This is why it has two sides. From the front side, we will delete the data and from the rear side, we will insert the data in a queue. For example, people who stand in the queue at a bus station to buy a ticket. <\/p>\n

Algorithm for the Implementation of Queue using Array<\/h2>\n

For Insertion:<\/h3>\n

Step 1:<\/strong> Get the position of the first empty space ( value of the rear variable)<\/p>\n

Step 2:<\/strong> Assign the new value to position the rear in an array if the queue is not full.<\/p>\n

Step 3:<\/strong> Increment the value of the rear variable<\/p>\n

For Deletion:<\/h3>\n

Step 1:<\/strong> Get the position of the first non-empty element ( value of the front variable )<\/p>\n

Step 2:<\/strong> return the value of the element present at the index front if the queue is not empty<\/p>\n

Step 3:<\/strong> increment the value of the front variable<\/p>\n

Algorithm of the Queue Implementation with an Example<\/h2>\n

We understood the concept of the queue. Now, we will learn about queue with the algorithm of a queue implementation with an example.<\/p>\n

Initialize the front and rear variables with (-1).<\/p>\n

\"\"<\/p>\n

Operation 1: enqueue(10)<\/strong>
\nIn this operation, we will insert a new value 10 at the rear position. Before this operation value of the rear was (-1). we will increment the value of the rear position by 1.So now, the new value of the rear will be 0.and the value 10 will be added at position 0.
\nIt is first element into the queue, that is why we will also increment the front position by 1 and the new value of the front will be also 0.<\/p>\n

\"\"<\/p>\n

Operation 2: enqueue(20)<\/strong>
\nIn this operation, we will insert a second value 20 at the rear position. Before this operation value of the rear was 0. we will increment the value of the rear position by 1.So now, the new value of the rear will be 1.and the value 20 will be added at position 1.So now, the new value of the front and rear will be 0 and 1 respectively.<\/p>\n

\"\"<\/p>\n

Operation 3: dequeue()<\/strong>
\nIn this operation, we will delete the value 10 at the front position. Before this operation value of the front was 0 and the value 10 will be removed at position 0. After the deletion value, we will increment the value of the front position by 1. So now, the new value of the front and rear will be 1 and 1 respectively.<\/p>\n

\"\"<\/p>\n

Operation 4: enqeue(30)<\/strong>
\nIn this operation, we will insert a third value 30 at the rear position. Before this operation value of the rear was 1. we will increment the value of the rear position by 1.So now, the new value of the rear will be 2.and the value 30 will be added at position 2.So now, the new value of the front and rear will be 1 and 2 respectively.<\/p>\n

\"\"<\/p>\n

Operation 5: enqueue(40)<\/strong>
\nIn this operation, we will insert a fourth value 40 at the rear position. Before this operation value of the rear was 2. we will increment the value of the rear position by 1.So now, the new value of the rear will be 3.and the value 40 will be added at position 3. So now, the new value of the front and rear will be 1 and 3 respectively.<\/p>\n

\"\"<\/p>\n

Operation 6: dequeue()<\/strong>
\nIn this operation, we will delete the value 20 at the front position. Before this operation value of the front was 1 and the value 20 will be removed at position 1. After the deletion value, we will increment the value of the front position by 1. So now, the new value of the front and rear will be 2 and 3 respectively.<\/p>\n

\"\"<\/p>\n

Program for the Implementation of Queue using Array:<\/h2>\n

We have already seen how an array can be used to implement a queue. Now, let\u2019s see how to write a program for the implementation of queue using array.<\/p>\n

Code Implementation<\/strong>
\n\t\t\t\t\t\t