What is the need for a circular queue?
A. effective usage of memory
B. easier computations
C. to delete elements based on priority
D. implement LIFO principle in queues
Answer:A
What is the need for a circular queue?
A. effective usage of memory B. easier computations C. to delete elements based on priority D. implement LIFO principle in queues
Explanation: The dequeue operation in a linear queue causes the starting elements of the array to be zero, and there is no way to use that space, while in a circular queue, you can use that space effectively. The priority queue is used to delete elements according to their value. The elements with the highest priority would be removed first, followed by the elements with the lowest priority. The FIFO theory is often applied to queue data structures.