isfull()As we are using single dimension array to implement queue, we just check for the rear pointer to reach at MAXSIZE to determine that the queue is full. In case we maintain the queue in a circular linked-list, the algorithm will differ. Algorithm of isfull() function −
590,000
625,000
6% off
1,499
2,499
40% off
590,000
625,000
6% off
3,999
5,499
27% off
999
1,499
33% off
590,000
0.0
5.0
Download the Study24x7 App, so you can connect and collaborate.
