QUEUE IMPLEMENTATION Queue data structure can be implemented in two ways. They are as follows... 1. Using Array 2. Using Linked List When a queue is implemented using an array, that queue can organize an only limited number of elements. When a queue is implemented using a linked list, that queue can organize an unlimited number of elements.Queue Using Array A queue data structure can be implemented using one dimensional array. But, queue implemented using array can store only fixed number of data values. The implementation of queue data structure using array is ific size and insert or delete the values into that very simple, just define a one dimensional array of specit array by using FIFO (First In First Out) principle with the help of variables 'front’ and ‘rear’. Initially both ‘front’ and ‘rear’ are set to -1. Whenever, we want to insert a new value into the queue, increment ‘rear’ value by one and then insert at that position. Whenever we want to delete a value from the queue, then increment ‘front’ value by one and then display the value at front’ position as deleted element.) perations using Array Queu Queue data structure using array can be implemented as follows. Before we implement actual operations, first follow the below steps to create an empty queue.Implementing Queue using Array A queue can be implemented either using an array ora linked list. Procedure: Anitialize the queue by assigning-1 to the front & rear variables to indicate that the array based queue is empty. Each time data is inserted rear value is incremented by one and when data is deleted front value is also incremented by one.Implementation of Queue (Array) * use Array with front and back pointers as implementation of queue Queue 7704/15 C$ 201| | | | Step 1: Include all the header fites which are used in the program and define a constant 'SIZE* with specific value. Step 2: Declare all the user defined functions which are used in queue implementation, ‘Step 3: Create a one dime ay with above defined SIZE (int quewe|SIZE]) ‘front’ and 'rear' and initialize both with '-1". (int front = 1) ‘Then implement main method by displaying menu of operations list and make suitable jon calls to perform operation selected by the user on queue. enQueue(value) - Inserting value into the queue In a queue data structure, enQueue() is a function used to insert a new element into the queue. In a queue, the new element is always inserted at rear position. The enQueue() function takes one integer value as parameter and inserts that value into the queue. We can use the following steps to insert an element into the ‘queue. + Step 1: Check whether queue is FULL. (rea + Step 2: If it is FULL, then display "Queue is FULL! the function. Step 3: If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear| ion is not possible!!!" and terminate value, deQueue() - Deleting In a queue data structure, deQueue() is a function used to delete an element from the queue. In a queue, element is always deleted from front position. The deQueue() function does not take any value as parameter. We can use the following steps to delete an element from the queue... from, the Queue the Step 1: Check whether queue is EMPTY. (front = rear) IM! Deletion is not possible! Step 2: If it is EMPTY, then display "Queue is EMPTY!! terminate the function. Step 3: Ifit is NOT EMPTY, then increment the front value by one (front ++). Then display queueffront] as deleted clement. Then check whether both front and rear are equal (front rear), if it TRUE, then set both front and rear to -1' (front = rear = -1) and display() - Displays the elements of a Queue We can use the following steps to display the elements of a queue... Step 1: Check whether queue is EMPTY. (front == rear) Step 2: If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function. Step 3: If it is NOT EMPTY, then define an integer variable ‘i’ and set ‘{= front+l’. Step 3: Display ‘queue[il' value and increment '' value by one (i++). Repeat the same until value is equal to rear (i <= rear)Queue using Linked List The major problem with the queue implemented using array is, It will work for only fixed number of data, That means, the amount of data must be specified in the beginning itself. Queue using array is not suitable when we don't know the size of data which we are going to use. A qucuc data structure can be implemented using linked list data structure. The queue which is implemented using linked list can work for unlimited number of values. That means, queue using linked list can work for variable size of data (No need to fix the size at beginning of the implementation). The Queue implemented using linked list can organize as many data values as we want In linked list implementation of a queue, the last inserted node is always pointed by ‘rear’ and the first node is always pointed by ‘front’. Example *rear GB Bel Biel Be In above example, the last inserted node is 50 and it is pointed by ‘rear’ and the first inserted node is 10 and is pointed by ‘front’, The order of elements inserted is 10, 15, 22 and 50. Operations To implement queue using linked list, we need to set the following things before implementing actual ‘operations. Step 1: Include all the header files which are used in the program. And declare all the user defined functions. Step 2: Define a ‘Node’ structure with two members data and next, Step 3: Define two Node pointers ‘front’ and ‘rear’ and set both to NULL. Step 4: Implement the main method by displaying Menu of list of operations and make suitable function calls in the main method to perform user selected operation. enQueue(value) - Inserting an element into the Queue We can use the following steps to insert a new node into the queue. Step 1: Create a newNode with given value and set 'newNode — next’ to NULL. Step 2: Check whether queue is Empty (rear == NULL) it is Empty then, set front = newNode and rear ~ newNode. Step 4: If it is Not Empty then, set rear — next = newNode and rear = newNodedeQueue() - Deleting an Element from Queue We can use the following steps to delete a node from the queue... Check whether quene is Empty (front == NULL). © Step 2:10 npty, then display "Queue is Empty!!! Deletion is not possible! from the function IFit is Not Empty then, define a Node pointer 'temp' and set it to ‘front. front — next’ and delete 'temp' (free(temp)). and terminate display() - Displaying the elements of Queue We can use the following steps to display the elements (nodes) of a queue... «Step 1: Check whether queue is Empty (front == NULL). Step 2: If it is Empty then, display ‘Queue is Empty!!!" and terminate the function. Step 3: If it is Not Empty then, define a Node pointer 'temp’ and initialize with front. + Step 4: Display ‘temp — data --->' and move it to the next node. Repeat the same until ‘temp’ reaches to ‘rear’ (temp —* next != NULL). + Step 4: Finally! Display 'temp — data > NULL’. Realization of Queues Using Arrays: Queues being a linear data structure can be represented in various ways such as arrays and linked lists. An array is a data structure that can store a fixed number of clements .The size of an array should be fixed before using it. Queue , on the other hand keeps an changing as we remove elements fornt end or add new elements at rear end . Decalring an array with a maximum size should be solve this problem . The maxmimum size should be large enough for a queue to expand or shrink, ‘The implementation of queue data structure just define a one dimensional array of specific size and insert or delete the values in to that array by using FIFO with the help of front and rear5000 «5004 5008 smi2 soe) 50 Ason4 = S028. [8000_] rrowr Insert at the rear a= a Shift one index all value rear to front after delete front value REAR | 5020| ex as | ono t I Rear Front Limited number of data we can store == = We can create unlimited (ignoring memory restriction) node and append to the queue.