(Challenger Problem) in Implementing a Queue Using an Array, a Problem

question 10

Essay

(Challenger Problem) 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 can not occur, why?
?

---

Definitions:

Transferred-In Costs

Costs accumulated from a previous process or department that are carried into the cost of goods in the next phase of production.

Average Cost Method

An inventory costing method that calculates the cost of goods sold and ending inventory based on the weighted average cost of all items available for sale during the period.

Conversion Costs

Costs associated with converting raw materials into finished products, typically including labor and manufacturing overhead.

Conversion Costs

Costs in manufacturing that are directly related to converting raw materials into finished goods, primarily consisting of labor and overhead expenses.