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).ĭisplay() - Displays the elements of a Queue Step 3 - If it is NOT EMPTY, then increment the front value by one ( front ++).Step 2 - If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the function.Step 1 - Check whether queue is EMPTY.We can use the following steps to delete an element from the queue. The deQueue() function does not take any value as parameter. In a queue, the element is always deleted from front position. In a queue data structure, deQueue() is a function used to delete an element from the queue. Step 3 - If it is NOT FULL, then increment rear value by one ( rear++) and set queue = value.ĭeQueue() - Deleting a value from the Queue.Step 2 - If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the function.We can use the following steps to insert an element into the queue. The enQueue() function takes one integer value as a parameter and inserts that value into the queue. In a queue, the new element is always inserted at rear position. In a queue data structure, enQueue() is a function used to insert a new element into the queue. Step 5 - Then implement main method by displaying menu of operations list and make suitable function calls to perform operation selected by the user on queue.ĮnQueue(value) - Inserting value into the queue.Step 4 - Define two integer variables 'front' and ' rear' and initialize both with '-1'.Step 3 - Create a one dimensional array with above defined SIZE ( int queue).Step 2 - Declare all the user defined functions which are used in queue implementation.Step 1 - Include all the header files which are used in the program and define a constant 'SIZE' with specific value.Queue data structure using array can be implemented as follows.īefore we implement actual operations, first follow the below steps to create an empty queue. Whenever we want to delete a value from the queue, then delete the element which is at 'front' position and increment 'front' value by one. Whenever, we want to insert a new value into the queue, increment ' rear' value by one and then insert at that position. Initially both ' front' and ' rear' are set to -1. Just define a one dimensional array of specific size and insert or delete the values into that array by using FIFO (First In First Out) principle with the help of variables 'front' and ' rear'. The implementation of queue data structure using array is very simple.
The queue implemented using array stores only fixed number of data values.
A queue data structure can be implemented using one dimensional array.
0 kommentar(er)
