The document discusses queues as a linear data structure where elements are inserted at one end (rear) and deleted from the other (front), following a FIFO (first in, first out) approach. It introduces the concepts of enqueue to insert and dequeue to remove elements. A limitation of linear queues is that new elements cannot be added if the queue is full, even if space is available towards the front. To address this, a circular queue is proposed which joins the front and rear ends to allow continuous insertion and removal of elements.

1. Presented by :
Gitika
Bca2(m)

2. QUEUE IS A LINEAR DATA STRUCTURE, IN WHICH THE FIRST ELEMENT IS
INSERTED FROM ONE END CALLED RARE , AND DELTION OF THE EXISTING
ELEMENT TAKE PLACE FROM THE OTHER END CALLED AS FRONT.
THIS MAKE QUEUE AS FIFO DATA STRUCTURE,WHICH MEANS THE
ELEMENT INSERTED FIRST WILL ALSO BE REMOVED FIRST.

3. WHEN AN ELEMENT IS INSERTED IN A QUEUE ,THE COMPONENT IS
CALLED ENQUE, ANDWHENAN ELEMENT IS REMOVED FROMTHE
QUEUETHE COMPONENTIS CALLED DEQUEUE.

4. THE ONLY LIMITATION OF LINEAR QUEUE IS THAT:
IF THE LAST POSITION OF THE QUEUE IS OCCUPIED,IT IS NOT
POSSIBLE TOENQUEUE ANY MORE ELEMENTSEVEN THOUGH
SOME POSITION ARE VACCANT TOWARDSTHE FRONY
POSITIONOF THE QUEUE.

6. In a standard queue data structure re-buffering problem
occurs for each dequeue operation.
To solve this problem by joining the front and rear ends
of a queue to make the queue as a circular queue
Circular queue is a linear data structure.
It follows FIFO principle.

7. In circular queue the last node is connected back to the first node to
make a circle.
Circular linked list fallow the First In First Out principle
Elements are added at the rear end and the elements are deleted at front end
of the queue
Both the front and the rear pointers points to thebeginning of the array.