Circular Queue

Answered On : Dec 16th, 2008

It is also a linear data structure. By using this linear data structure we can avoid the data wastage while here two ends of both rear and front are combined. so the linking between the front & rear we can avoid the data wastage. 
From: MAHESWAR REDDY.Y; M.Sc [Computers],
from S V University,
Tirupati.
THANQ.

Answered On : Apr 13th, 2009

In a normal Queue when queue becomes full we can not add more items, so
following items are lost.  But in a circular queue when queue becomes full
it will start overwriting the items from beginning so that new items/data won't
waste. It is logical also because it is assumed that if an item is useful it
would have been fetched before queue get full and if it is still there when
queue has reached to it's capacity that means it is not very useful and
overwriting this won't harm.
So circular queue will preserve the useful information.

Answered On : Jul 6th, 2014

In linear queue once the size is full we cannot add another items cause rear is at rightmost .
but in circular list to add element even if its full you will move front and rear in clockwise direction.