1. Computer Science Engineering (CSE)
  2. Data Structure (DS)
  3. Consider a standard Circular Queue 'q' i...

Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?

A. q[0]
B. q[1]
C. q[9]
D. q[10]
Answer» A. q[0]
View all MCQs in:   Data Structure (DS)