In an array based implementationof a queue a possible solution to dealing with the full condition is to
a. all other answers
b. check for frontindex equal to backindex
c. wait for an arrayfullexception to be thrown
d. maintain a count of queue items

D.Maintain a count of queue items.

Explanation:

In array based implementation of queue we use two variables suppose frontindex and rearindex which points to the front of the queue and the rear of the queue respectively and one variable size to keep count of the variables in the queue So whenever we insert an element we insert it at rear index and whenever we remove an element we do it at front index.When the size becomes equal to the capacity of the array we can say that the queue is full.

you have to be a moderator in order to delete questions. ask jaysl the community associate any questions about the application if you don't understand anything. happy to   : )   here's the application link if you want to apply http: