What is a circular queue and why is it useful?

A circular queue is a linear data structure that connects the last position back to the first position, forming a circle. Unlike regular queues that waste space after dequeue operations, circular queues reuse freed spaces by wrapping around. This makes them memory-efficient and ideal for buffering (like CPU scheduling, IO buffers) where fixed-size storage with continuous reuse is needed.