Circular queue using array in c program first line contains the menu followed input for given menu.
Answers
circular queue is a very important data structure because it can store data in a very practical way. The circular queue is a linear data structure. It follows FIFO principle. In circular queue, the last node is connected back to the first node to make a circle. Circular array list fallows the First In First Out principle. Elements are added at the rear end and the elements are deleted at the front end of the queue.
Circular queue in data structure
Image source: - http://scanftree.com/Data_Structure/circularqueues.png
In the Code below there are four parts. First three function to implement three different operations like Insert a node, delete a node and display the list. The Fourth part is the main function, in that a do while loop is implemented to keep the user engaged and provide him the all the given choices, according to the choice one of the three function get called.
The First function checks whether the queue is empty, rear is at last position of queue or Queue is full. If the queue is not full it adds up the item.