Explain What are the use of front and rear pointers in CircularQueue implementation?

Question

What are the use of front and rear pointers in CircularQueue implementation? (a) Front pointer points to first element; rear pointer points to the last element (b) Rear pointer points to first element; front pointer points to the last element (c) Front and read pointers point to the first element (d) Front pointer points to the first element; rear pointer points to null object The question was asked by my school principal while I was bunking the class. Enquiry is from Data Structures-Queue in portion java.util – The Collections Framework of Java Select the correct answer from above options

Answer 1

Right answer is (c) Front and read pointers point to the first element For explanation: CircularQueue implementation is an abstract class where first and rear pointer point to the same object.