Which queue implementation is used for circular buffering?

What is the main characteristic of a queue data structure?

A. Last In, First Out (LIFO)

B. First In, First Out (FIFO)

C. Last In, Last Out (LILO)

D. First In, Last Out (FILO)

Which of the following operations is used to add an element to the end of a queue?

A. Enqueue

B. Dequeue

C. Peek

D. Push

What is the time complexity of the dequeue operation in a queue implemented using a linked list?

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

Which queue implementation is used for circular buffering?

A. Circular queue

B. Priority queue

C. Double-ended queue

D. Simple queue