hemavardhang/MohlerASAG huggingface dataset:
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: i have an hard time explaining this so i'll show how infix is evaluated instead.<br>Start with an infix expression, like, <br>(((5+2)*5)+(400/(2+3))), and  push items until you get a ")" and once that happens, perform the operations until you reach an "("... with that complete, you will now have <br>((7*5)+(400/(2+3))) as now the expression that will be evaluated... perform last step again...<br>(35+(400/(2+3))) is now the stack.... repeat agian...<br>(35+(400/5)) is now the stack after that.... repeat...<br>(35+80) is now the stack, repeat again...<br>115 is now the stack, and is returned.
Grade: 2.5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: The infix expression is converted to postfix form<br>
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: by converting them to postfix expressions and putting the operations in a stack
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: The computer converts the infix expression to postfix form. Then evaluates the postfix expression.
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: infix expressions are converted to postfix expressions before they can be evaluated by a computer.  Operands stay in the same order.  Operators always follow the operands.
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: infix expressions are pointers evaluated by reference to the memory location
Grade: 1.5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: computers convert infix expressions to postfix form before evaluation
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: convert infix expressions to postfix expression and evaluate the postfix expression
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: When an operand is entered, the computer<br>Pushes it onto a stack<br>When an operator is entered, the computer<br>Applies it to the top two operands of the stack<br>Pops the operands from the stack<br>Pushes the result of the operation onto the stack
Grade: 4 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: Computers convert an infix expression into a postfix expression. They then push the numbers onto a stack and pop them out as they are needed.
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: infix expressions are converted to postfix, (i.e. 3+2 is changed to 32+)
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: they are transformed into post-fix expressions, then evaluated with a stack.
Grade: 5 out of 5
Question: How are infix expressions evaluated by computers?
Instructor answer: First, they are converted into postfix form, followed by an evaluation of the postfix expression.
Student answer: Writing arithmetic expressions is called infix notation.  This is because a binary operator (like '+') is written in between its two operands (as in "a + b").  There are two alternative forms of notation used in certain situations.  One is prefix notation, in which an operator is written before its operands.  In prefix notation, the sum of a and b is written "+ a b".  This is the notation used to write function calls in mathematics and computer science.  It is also used in the Lisp and Scheme programming languages.  In postfix notation, an operator is written after its operands.  The sum of a and b is written "a b +".  (You may have seen this as "reverse Polish notation".)  Postfix notation forms the conceptual basis for the way that arithmetic expressions are evaluated by a computer.  One important characteristic of both postfix and prefix notations is that they are unambiguous; no parentheses are needed to indicate the order of operations.<br>
Grade: 5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: isEmptry()//determines if the stack is full or not<br>pop()//to remove the top element if it is not the on you are looking for<br>search()//you compare each element of the stack to the data you are looking for.
Grade: 3 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: You would have to keep using peek or getTop to see what the top element is then popping the top element until peek or getTop provides the element you are looking for.
Grade: 3 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Push adds a given node to the top of the stack leaving previous nodes below. Pop removes and returns the current top node of the stack.
Grade: 3 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Using linked lists and stacks, you would need a temp stack to retain the values. Then you would use the Pop( ) function to pop off each element and then compare it. If its not the element your looking for, Push ( ) it to the temp stack. Repeat until the element is found. When you find it,  Pop ( ) off the temp stack back onto the regular stack to have a complete stack again.
Grade: 5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Pop each item off the top until you find what you are looking for. If the stack ends up empty and you never found the item, then it does not exist in the stack. It may also be necessary to save the popped values in case you want to recreate the stack.
Grade: 5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: if the stack is implemented using an array you could simply search the array for the item. If the stack is implemented using a linked list you would have to pop the values off of the stack until either the value is found or the stack is empty, you would then have to have the items put back into the list.
Grade: 4.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: You need to pop each item on the stack and compare the item.  Once the item is found, no more items need to be removed.
Grade: 3.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Pop an element from one stack, check to see if it is the desired element, if not push it onto another stack. When finished, pop the items from the second stack and push them back onto the first stack (this will ensure the order of the elements is maintained).
Grade: 5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Basically pop the stack until you find the given element.
Grade: 3.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Iterate through the stack, checking the number against the current element.
Grade: 1.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: pop and push
Grade: 3 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: pop all elements off stack until you find that element and then push the popped elements back on the stack
Grade: 5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Keep popping nodes and storing them in an alternate stack until the given element is found, then pop the given element and push the previously popped nodes back onto the stack.
Grade: 5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: either traverse the entire list and pop the given part or create a pointer system that automatically points to it.
Grade: 3 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Depends on the type of stack, on a true stack you will haft to pop all of the elements of the stack until you find the element you want, and then after that you will need to push all the elements that where removed back in to the stack in the order that they where removed.<br><br>With a Java style stack, where there is a peek function, it will return the element you wanted instead of requiring you to perform all the excessive actions that are required from a true stack.
Grade: 5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: if top item != given element<br>pop the stack.<br>Repeat until item is found or stack is empty
Grade: 3.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: could traverse through the list/array to find the element.
Grade: 2 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: you need the pop opertation to go throught the stack and find the element.
Grade: 3.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: createStack, push, isEmpty, pop, and a boolean return value.
Grade: 3 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: you would have to traverse the stack popping each element to search it
Grade: 3.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: Pop each element off the stack (and into another stack for storage) until the desired element is found.
Grade: 4 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: pop operation
Grade: 2.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: to pop elements then push them back
Grade: 4.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: A function to keep track of the elements popped and a function to put<br> the popped elements backinto the function.
Grade: 4.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: you would pop each element and compare it to what you are looking for and then push it back on the stack so that it is not lost
Grade: 4.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: you would need to perform a search through the list of elements (i dont really understand what this question is asking....its not very clear?)
Grade: 1.5 out of 5
Question: What operations would you need to perform to find a given element on a stack?
Instructor answer: Pop all the elements and store them on another stack until the element is found, then push back all the elements on the original stack.
Student answer: StackPush()<br>StackPop()<br>StackIsEmpty()
Grade: 3 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A data structure in c++ which is a collection of data that is kept in order.  First in first out.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: a queue is a list of objects in a particular order that is read one at a time starting at the first followed by the second and so on.
Grade: 4 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A queue is an abstract data structure in which operations are performed at both ends giving the queue first in first out behavior.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A queue stores a set of elements in a particular order.  Its principle of operation is FIFO(first in first out), which means the first element inserted is the first one to be removed.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: An ADT whose first inserted item is the first item removed. This uses the FIFO idea where items enter a queue at its back and leave at its front.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: Last in, last out architecture. It works the same way a line at the bank would work, the person that's been waiting the longest gets served first.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: a queue is a data structure that stores elements in a First in First out order.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A waiting list of items that operation in a FIFO (first in first out) order.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A queue is similar to an array, except that the data can only be accessed sequentially rather than at random. Unlike a stack, a queue follows FIFO. First in, First out.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. First in First Out (FIFO Method).
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: Like a linked list but first in first out
Grade: 4.5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A queue is a FIFO data structure.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A queue is a first in first out data structure.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: Its like a stack, but uses the linked list to stack a little differently. It's FIFO so the first thing enqueued is the first thing dequeued
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A first in, first out Abstract Data type that can be used to store values.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: Stores a set of elements in a particular order<br>with a First In, First Out principle
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: object that stores elements in order that follows first in first out.  the first element added is the first one to come off.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A quese is an list that stores a set of elements in a particular order. It has Stack principle, but in this case, its "First In, First Out". The first element inserted is the first element to be removed.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: a finite ordered list with zero or more elements, based upon First In First Out
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: a data structure that performs operations in the order of first in first out FIFO
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A Queue is a "first in first out" data structure, such that the first element added is also the first removed.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: Queue is a buffer, which store element in a particular order
Grade: 3.5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: stores a set of elements where the first element in, is the first element to be removed
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: A data structure that removes nodes from the head and adds nodes at the tail.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: a queue is a list of things that follows the first in first out behavior
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: a queue is a storage container that holds its objects in a first in, first out priority
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the last to be removed (or first-in-first-out).
Student answer: The queue is another data structure. A physical analogy for a queue is a line at a bank. When you go to the bank, customers go to the rear (end) of the line and customers come off of the line (i.e., are serviced) from the front of the line.
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue which adds data to the queue and dequeue which deletes data from the queue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue , which inserts a specified element at the head of the specified queue, and dequeue , which removes the specified element from the queue.
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: The two main functions are enqueue which inserts an item at the back of the queue and dequeue which removes an item from the front of the queue.
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: The two main functions are enqueue and dequeue.
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: Enqueue and Dequeue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue - insert into queue<br>dequeue - remove element
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: Remove the item added first, add items to the back.
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: The two main functions of a queue are enqueue and dequeue.
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue and dequeue.
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue and dequeue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enque ( Data ),  Deque ( )
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: The two functions are, Enqueue and Dequeue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue, dequeue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue, that adds an item to the queue<br>dequeue, that takes the first item out of the queue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: Enqueue and dequeue, which add and remove elements from the queue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: dequeue and enqueue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: enqueue<br>dequeue
Grade: 5 out of 5
Question: What are the two main functions defined by a queue?
Instructor answer: enqueue and dequeue
Student answer: rear and front
Grade: 2.5 out of 5
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.
Grade: 4.5 out of 5
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: you create an array with the max size of your queue and adjust the items to make them follow FIFO procedure.
Grade: 3 out of 5
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: By implementing an array and only adding items to the end of the array and only removing items from the beginning of the array.
Grade: 3 out of 5
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: For applications in which a fixed-sized queue does not present a problem, you can use an array to represent a queue.
Grade: 2.5 out of 5
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: Keep track of the front and the back of the array as you increase and decrease the elements inside the array.
Grade: 4 out of 5
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: 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.
Grade: 4.5 out of 5
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: 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.
Grade: 4 out of 5
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: Utilizing indexes for the front and the back.  Front is 0 and as you add items the back index is incremented.
Grade: 4 out of 5
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: 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.
Grade: 4.5 out of 5
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: It is an array of fixed size. A queue of maximum N elements.
Grade: 2.5 out of 5
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 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
Grade: 4 out of 5
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: 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.
Grade: 3.5 out of 5
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: add in data from the first element to the last, take out data from the first element to the last.
Grade: 3 out of 5
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: 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
Grade: 3.5 out of 5
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: 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.
Grade: 4 out of 5
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: Keep track of the front and rear indexes. Either:<br>1)Dequeue items by shifting the array left<br>2)Use wrapped configuration
Grade: 4 out of 5
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: 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.
Grade: 3.5 out of 5
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: 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.
Grade: 3 out of 5
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: fixed size array with max N elements.  Need to keep track of front and rear of array.
Grade: 4 out of 5
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: by keeping track of a front item and a rear item, or with a circular array that uses the modulo function
Grade: 5 out of 5
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: 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.
Grade: 5 out of 5
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: 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
Grade: 2 out of 5
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: remove the element then shift the elements one space back
Grade: 3 out of 5
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: 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.
Grade: 5 out of 5
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: an array is a type of queue with a fixed length
Grade: 1.5 out of 5
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: 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
Grade: 5 out of 5
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: Boolean isFullQ(queue) ::= rear == MAX_QUEUE_SIZE-1
Grade: 5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: A list can have unlimited elements in it.  You can push a node onto the end of the list and pop the one in the front.
Grade: 5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: theoretically you could do it two ways one of which uses more processing power and memory no larger than the queue is ever at when full and the other which uses almost infinite memory. The more practical method would be two place the items in an array and remove the item in position one of the array after which you can shift the array and add another element if required. The other option which can use infinite memory when used for long term queues such as job scheduling that goes nonstop for extended periods. that is to implement an array and add the items read item one raise your counter value to two ecetera and continue adding more elements to the array. the downside to this method is after you use element one it is still in memory. or im crazy who knows
Grade: 2 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: By implementing a list in which a tail pointer points to the item most recently inserted onto the back of the list and a head pointer which points to the item least recently inserted onto the list. Also, items can only be removed from the front of the list and can only be added to the back of the list.
Grade: 5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: You can use list to represent the items in a queue.
Grade: 1.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: Have a pointer to the last element in the list and then use enqueue to insert items there. Link the first and last elements together to dequeue the list.
Grade: 3.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: Enqueue to the end of the linked list... dequeue items from the beginning (head) of the list.
Grade: 5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: you use the first element in the list as the remove point for the queue and insert items at the end of the list.
Grade: 5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: Utilizing a front pointer and a back pointer.  The front poiner and back pointer points to the first item into the queue.  As you add items, the front remains the same but the back poiner 'next' points to the new item and the new item is assigned to become the 'new' back pointer.
Grade: 4.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: Implement a linked list that only allows nodes to be added to the tail and can only be retrieved from the head.
Grade: 4.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: Check if list is empty and add elements to the list.
Grade: 2.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: make a linked list and add on to the front and delete from the back, keep track of both to do so.
Grade: 4.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: by making the head of the list the beginning of the queue and the last listed item the insertion point of the queue
Grade: 4.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: throw in data at the head and take it out at the tail
Grade: 4.5 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: You create a list of nodes that had a head and a top pointer, and the functions are basically the same substituting pop and push with enqueue and dequeue
Grade: 3 out of 5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: fairly easy... singly linked list with a pointer to the head and tail of hte list.<br><br>deque first item in que, create temp pointer to next element, delete head, and then make head the temporary pointer.<br><br>enque new item, use pointer to end of list, add a new item to the next item of the tail, and make the tail the next item of the current tail.
Grade: 4.5 out of 5