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 − - Study24x7
Social learning Network
22 Mar 2019 10:52 AM study24x7 study24x7

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 −

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles