Which of the following is true about a circular queue ?

A circular queue is a linear data structure where the last position connects back to the first, forming a circle. This design allows efficient memory utilization by reusing empty spaces at the beginning of the array once they become available after dequeuing elements. Option D correctly describes this wrapping behavior, which is the defining characteristic of a circular queue. Option A is partially true but misleading since all queues use linear structures; the key distinction of a circular queue is its wrapping mechanism, not just linearity. Option B is incorrect because circular queues are typically implemented using arrays, not linked lists, though variations exist. Option C is false since a circular queue can become full when all positions are occupied, requiring specific logic to detect this state. The primary advantage of a circular queue over a linear one is its ability to prevent premature overflow by utilizing the entire allocated space cyclically.