Question 36
Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1l,.... q[10]. The front and rear pointers are initialized to pointat q[2]. In whichposition will the ninth element be added?
Create a FREE account and get:
- Download Maths Shortcuts PDF
- Get 300+ previous papers with solutions PDF
- 500+ Online Tests for Free
Book Free CAT Mentorship
Get personalized CAT strategy from a 99%iler
500+ students mentored
OTP Verification
Enter the 6-digit code sent to your phone
Booking Summary
Session:Free CAT Mentorship
Phone:
Date:
Time:
Enter OTP
Didn't receive the OTP?
