Question: How can you implement a queue with an array?
Instructor answer: Use a circular array. Keep the rear of the queue toward the end of the array, and the front toward the beginning, and allow the rear pointer to wrap around.

Student answer: Make use of a front pointer and a tail pointer.  When the tail pointer reaches the end of an array it gets reset to the front of the array.  If the two pointers are equal then the queue is either full or just has one element.
Score (0-5): 4.5

Student answer: you create an array with the max size of your queue and adjust the items to make them follow FIFO procedure.
Score (0-5): 3

Student answer: By implementing an array and only adding items to the end of the array and only removing items from the beginning of the array.
Score (0-5): 3

Student answer: For applications in which a fixed-sized queue does not present a problem, you can use an array to represent a queue.
Score (0-5): 2.5

Student answer: Keep track of the front and the back of the array as you increase and decrease the elements inside the array.
Score (0-5): 4

Student answer: Declare the size of an array, and have special conditional statements (pointers) to make sure you re-use ALL of the array. Say, you have an array of 20 elements, you load up 18, then dequeue 3, when you enqueue 4 more elements, you want to loop back to index 0 and continue from there... this process saves resources.
Score (0-5): 4.5

Student answer: you could use the first element of the list as the remove point and insert at the end f you do this you would have to shift the elements down each time you remove an item unless you make the array circular.
Score (0-5): 4

Student answer: Utilizing indexes for the front and the back.  Front is 0 and as you add items the back index is incremented.
Score (0-5): 4

Student answer: Declare two variables, “front” and “rear”, to be used to denote which elements in the array can be accessed. Increment “rear” whenever data is enqueued to the end and increment “front” whenever data is dequeued.
Score (0-5): 4.5

Student answer: It is an array of fixed size. A queue of maximum N elements.
Score (0-5): 2.5

Student answer: make an array of a size, and add on to the front and delete from the back, keep track of the two so that you know when it is full and where to add or subtract from
Score (0-5): 4

Student answer: By using the beginning of the array as the removal point of the queue (or beginning of the queue) and the ith element as the end of the queue.
Score (0-5): 3.5

Student answer: add in data from the first element to the last, take out data from the first element to the last.
Score (0-5): 3

Student answer: you can take the array and put it in a queue stack or you can just traverse the list and keep track of top and bottom
Score (0-5): 3.5

Student answer: create a fixed array size, with with 2 integers to point to the beginning and the end of the que, and special cases to know when the que is empty or full.
Score (0-5): 4

Student answer: Keep track of the front and rear indexes. Either:<br>1)Dequeue items by shifting the array left<br>2)Use wrapped configuration
Score (0-5): 4

Student answer: add items into a fixed size array, pull the items out by calling on them with the starting index, increase starting index so when it calls again its now the next index element in the array.
Score (0-5): 3.5

Student answer: To use and array to implement a Queue, element or item 0, should be the top element in the array. Every time an element is inserted, all the items in the array are pushed back one space. The top element is always removed first.
Score (0-5): 3

Student answer: fixed size array with max N elements.  Need to keep track of front and rear of array.
Score (0-5): 4

Student answer: by keeping track of a front item and a rear item, or with a circular array that uses the modulo function
Score (0-5): 5

Student answer: Using an array for a queue, the size of the array allocated limits the size of the queue. An array based queue class must keep track of both the front and back of the queue, which may need to wrap around the array.
Score (0-5): 5

Student answer: A pointer based implementation of a queue could use a linear linked list with two external pointers, one to the front and one to the back
Score (0-5): 2

Student answer: remove the element then shift the elements one space back
Score (0-5): 3

Student answer: By having the head pointer point to the first or least current data entered and having the tail point to the most current data entered. A method must be created so that the tail pointer doesn't leave the array.
Score (0-5): 5

Student answer: an array is a type of queue with a fixed length
Score (0-5): 1.5

Student answer: your storage class has an array, and you keep track of the index of the first and last item in the array, and wrap around when end of the array is full
Score (0-5): 5

Student answer: Boolean isFullQ(queue) ::= rear == MAX_QUEUE_SIZE-1
Score (0-5): 5