In implementing a Queue using an array, a problem might arise if the Queue is implemented in such a way that items in the Queue are inserted at the next available location and removed from the next leading position, but such that, once deleted, the emptied space is unused. The problem that arises is one where there is free space still in the array, but it is not usable because it is not at the end. Demonstrate this problem with a Queue that is stored in an array of size 5 for the following instructions. Next, explain how you might resolve this problem. Queue q = new Queue(5); // assume the Queue constructor takes 5 as the size of the array q.enqueue(3); q.enqueue(4); q.enqueue(1); q.dequeue( ); q.dequeue( ); q.enqueue(6); q.enqueue(5); q.dequeue( ); // at this point, // there are only 2 item2 in the queue q.enqueue(7);
(a) In implementing a Queue using an array, a problem might arise if the Queue
is implemented in such a way that items in the Queue are inserted at the
next available location and removed from the next leading position, but
such that, once deleted, the emptied space is unused. The problem that
arises is one where there is free space still in the array, but it is not usable
because it is not at the end.
Demonstrate this problem with a Queue that is stored in an array of size 5
for the following instructions. Next, explain how you might resolve this
problem.
Queue q = new Queue(5); // assume the Queue constructor takes 5 as
the size of the array
q.enqueue(3);
q.enqueue(4);
q.enqueue(1);
q.dequeue( );
q.dequeue( );
q.enqueue(6);
q.enqueue(5);
q.dequeue( ); // at this point,
// there are only 2 item2 in the queue
q.enqueue(7); // this enqueue cannot occur, why??
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
