You are currently browsing the tag archive for the ‘Queue’ tag.
QUEUE :-It is a data structure which can be seen as a restricted type of linear list in which addition of elements is done from one end of the list called the rear and the deletion of elements is done from other end of the list called the front end of list.
This is also called as First-In,First-out(FIFO).
The Queues can be implemented using formula based representation and link based representation.The formula based representation has many disadvantages so we use a circular Queue in case of formula based representation.
This is program on Formula based representation of a Queue:
