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, q, q.....,q. The front and rear pointers are initialized to point at q . In which position will the ninth element be added?
|Answer» A. q|
Login to Continue
It will take less than 2 minutes