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.
Score (0-5): 3

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.
Score (0-5): 3

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.
Score (0-5): 3

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.
Score (0-5): 5

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.
Score (0-5): 5

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.
Score (0-5): 4.5

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.
Score (0-5): 3.5

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).
Score (0-5): 5

Student answer: Basically pop the stack until you find the given element.
Score (0-5): 3.5

Student answer: Iterate through the stack, checking the number against the current element.
Score (0-5): 1.5

Student answer: pop and push
Score (0-5): 3

Student answer: pop all elements off stack until you find that element and then push the popped elements back on the stack
Score (0-5): 5

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.
Score (0-5): 5

Student answer: either traverse the entire list and pop the given part or create a pointer system that automatically points to it.
Score (0-5): 3

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.
Score (0-5): 5

Student answer: if top item != given element<br>pop the stack.<br>Repeat until item is found or stack is empty
Score (0-5): 3.5

Student answer: could traverse through the list/array to find the element.
Score (0-5): 2

Student answer: you need the pop opertation to go throught the stack and find the element.
Score (0-5): 3.5

Student answer: createStack, push, isEmpty, pop, and a boolean return value.
Score (0-5): 3

Student answer: you would have to traverse the stack popping each element to search it
Score (0-5): 3.5

Student answer: Pop each element off the stack (and into another stack for storage) until the desired element is found.
Score (0-5): 4

Student answer: pop operation
Score (0-5): 2.5

Student answer: to pop elements then push them back
Score (0-5): 4.5

Student answer: A function to keep track of the elements popped and a function to put<br> the popped elements backinto the function.
Score (0-5): 4.5

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
Score (0-5): 4.5

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?)
Score (0-5): 1.5

Student answer: StackPush()<br>StackPop()<br>StackIsEmpty()
Score (0-5): 3