Viswa45/ASAG huggingface dataset:
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: You have to keep up with where you are and you have to consider the predecessor and successor connections when inserting/deleting.
Score (0-5): 3
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: Each node requires an extra node, requires more memory, and is more difficult to insert and remove individual nodes
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: Double-linked lists require more space per node, and their elementary operations are more expensive
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: More difficult to delete and create nodes.
Score (0-5): 3
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: They use more memory and you have to make 2 pointers and update 2 pointers each time you change the list.
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: nodes take up more memory
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: Each node requires an extra pointer (space requirements increased), Insertion or deletion of a node takes a longer (more pointer operations).
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: its a little more confusing. The special cases at the end and beginning become more difficult to do.
Score (0-5): 3
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: increased actions to add and remove elements to the linked list.
Score (0-5): 3
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: Inserting and deleting in a double-linked list is more involved, and has special cases at the beginning and end.
Score (0-5): 3
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: The main disadvanate is that if hard to remove all items in the list.
Score (0-5): 2
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: each node requires an extra pointer, taking up more storage.  insertions and deletions require more pointer operations.
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: in a doubly linked list there are twice as many pointers for each element , therefore more memory is used
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: The process of adding and removing Nodes in a Doubly linked list is more complex than in a basic linked list
Score (0-5): 3.5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: Double linked lists require more space per node, and their elementary operation are more expensive
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: 1- each node requires an extra pointer, requiring more space<br>2- the insertion or deletion of a node takes a bit longer, more pointer operations
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: It takes up twice the storage needed.
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: using more pointers to enable the backward movement takes up more memory, having more pointers make it slightly more work to add or remove a node from the list
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: increased memory requirements, slightly more complicated when modifying elements in the list
Score (0-5): 5
Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.
Student answer: not answered
Score (0-5): 0
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A data structure for storing items which are to be accessed in last-in first-out order that can be implemented in three ways.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A stack is an abstract data type that is based on the principle that the last element inserted into the stack will be the first element removed from the stack.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: Stores a set of elements in a particular order.
Score (0-5): 2
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: An ADT whose most recently inserted item is the first item removed or retrieved. This property is called last in, first out (LIFO). Items enter and leave a stack at its top.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A list in which only the top (or last item added) can be modified.
Score (0-5): 4.5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: a stack is a data structure that uses push to insert an item and pop to remove ad item. The stack use a last in first out structure for inserting and removing items.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A data structure that stores data using LIFO.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A stack is similar to an array, but does not allow for random access. Stacks only allow a user to retrieve the last item put into the stack. Last in, fist out.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: Stores a set of elements in a particular order. Stack principle: LAST  IN  FIRST  OUT. It means: the last element inserted is the first one to be removed.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A stack is an ADT that stores a set of elements in a particular order.
Score (0-5): 2.5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: a data type that stores a set of elements in a certain order, last in, first out.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: a data structure that moves elements in last in first out
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: Stores a set of elements in a last in first out order.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A list that can be added to or removed from only from the top.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: a stack is an Abstract data type which operates on a last in first out basis for storing a list of objects, and does not support ( at least in the pure stack) peeking at a element without removing the rest of the stack first.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: Stores a set of elements in a particular order<br>based on the principle of Last In First Out (LIFO).
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: an object list that stores elements in a particular order, the first object inserted is at the bottom with the last object at the top so the first object in is the last object out.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: An ADT that stores a set of elements in a particular order. The stack principles are LIFO. The last item inserted in the list is the first out.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: An abstract data type that stores a set of elements in a particular order.
Score (0-5): 2.5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: a collection of data to be executed in the order of last in first out
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A stack is a data structure that allows data members to be added or removed one at a time, and in order. They are a "Last in First Out" structure.
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: Stores a set of element in a particular order
Score (0-5): 2
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: is a list of element where the first one to be removed is the last one inserted
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A data structure that puts elements in a list and only allows the user<br> access to the last element.
Score (0-5): 4.5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: a finite ordered list with zero or more elements
Score (0-5): 2
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: A storage container that holds objects in a certain order, which has a LIFO priority
Score (0-5): 5
Question: What is a stack?
Instructor answer: A data structure that can store elements, which has the property that the last item added will be the first to be removed (or last-in-first-out)
Student answer: Stacks are a type of container adaptors, specifically designed to operate in a LIFO context (last-in first-out), where elements are inserted and extracted only from the end of the container.
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push and pop are two main functions defined in a stack
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push which inserts an element on the top of the stack and pop which removes the last inserted element from the stack.
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push and pop.
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Pop function and Push function
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push and pop.
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push (insert an item)<br>pop (remove an item)
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Adding a new item and removing the item
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push (insert) and pop (retrieve).
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push and Pop.
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: pop and push
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push (add an element)<br>pop (remove an element)
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push ( to add to a item the Stack)<br>Pop  ( to pull the last item added from an array. )
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push and pop, push puts an object into the list, and pop takes the last object off.
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push and Pop are the two main functions of a stack
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push and Pop
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push, which adds an element to the stack... and pop which takes an element off the stack
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Push and Pop, which add and remove data from the stack, respectively.
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push and pop
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: pop - to remove item<br>push - to insert an element<br>
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: Pop and push
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push - adds an item to the top of the stack<br>pop - removes the top item from the stack
Score (0-5): 5
Question: What are the two main functions defined by a stack?
Instructor answer: push and pop
Student answer: push and pop.<br>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): 5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: An array has a fixed size.  You can add and delete elements to the end of the array and you use a pointer to keep track of the last element added.  Each time you add or delete an element you update the pointer and check if it is equal to the max size of the array.
Score (0-5): 5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: By implementing an array of a pre-defined size with the bottom stack element stored at element 0 and the last element stored in the array is the top. You increment top when an element is pushed and you decrement it when an item is popped.
Score (0-5): 5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: If you use a dynamically allocated array, you must provide a destructor and copy constructor.
Score (0-5): 3
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Create a int value that stores the "head" of the stack. Increment the top when one element is pushed and decrement after it is popped.
Score (0-5): 5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Use a pointer that always points to the end of the array list for push/pop modifications.
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: if you used an array to implement a stack when you add an element just add it to the end of an array and remove items from end of array also.
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: You predetermine the size of the stack as you would an array.  This type can not grow.
Score (0-5): 2.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Declare a variable that points the last item in the array, which increases (++) when items are pushed onto the stack, and decreases (--) when an item is popped off the top.
Score (0-5): 5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Allocate an array of some size. The bottom stack element is stored at some element. Last index in the array is the top. Increment top when one element is pushed, decrement after pop.<br>
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: You allocate an pre-defined array, the bottom element is stored at element 0, and the last index is the head.
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Make an array, make the bottom at spot 0, make the last spot in the array the top, and increment top when you ad
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: treat the beginning of the array as the beginning of the stack
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Use an index value called top to keep track of the last element in the array.
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: create an array and implement pointers that point to the next list item down and stack them up.
Score (0-5): 2
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: for efficiency it is easiest to implement the left to right method, with the right most item being the one that is retrieved when a pop is performed, and a push places an object on the furthest element.
Score (0-5): 3.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Create an array based on a pre-defined size N<br>There can't be more elements than N.<br><br>Bottom stack element stored at element 0<br>last index in the array is the top<br><br>Increment top when one element is pushed, decrement after pop
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: with the element added to the array, so that the last element added is at the end, and when the element is popped it takes the last element off the array
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Allocate an array of some pre-defined size. Bottom stack element stored at element 0. The last index in the array is the top. Increment top when one element is pushed.
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Create an array, size N.  N++ when one element is pushed.  N-- when one element is popped.
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: define an array and keep track of a pointer to the last element as items are added
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: By allocating an array of predetermined size, and an integer to track the top element of the stack. The bottom member of the stack will go in element 0 of the array, and for each element pushed the "top" tracking integer is incremented.
Score (0-5): 4.5
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Allocate an array of some size, bottom stack element stored at element 0
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: you store the stack in the array but you have to keep in mind the first element
Score (0-5): 3
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: You keep track of the last item entered into the array and do not<br> allow the user access to the other parts of the array.
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: using arrays, you are pushing one int at a time into the stack until you get to the end of your array
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: by having a max number of elements, allocating an array with that number of elements, storing the elements starting at 0, and keeping track of how many elements are currently in the list
Score (0-5): 4
Question: How can you implement a stack with an array?
Instructor answer: Keep the top of the stack toward the end of the array, so the push and pop operations will add or remove elements from the right side of the array.
Student answer: Stack usually holds a bunch of items with the same type, therefore u can use an array, to hold the content of the stack and an integer top that holds the index of the element at the top of the stack. u Choose an array size. Then the sequence of operations used. u have to decide what data types are needed for this stack data structure.
Score (0-5): 3
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: You can add an element to the end of the linked list and update a pointer called top each time you modify the list.
Score (0-5): 3
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: You implement a list in which the head pointer points to the element most recently pushed onto the list and the pop function changes the head pointer to point to the next to last element in the list and removes the element head pointer previously pointed to.
Score (0-5): 5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: This is the implementation of the stack using single linked list.<br>  The operations performed on a stack are<br><br>  1)push(): This is the function which is for insertion(pushing)of an element into stack<br>              <br>      It is similar to the insertion of an element at the end of a single linked list<br>     <br>            see  the function insert_end() in the program for operations of single linked list<br><br>  2)pop(): This is the function which is for deletion(popping up) of an element from the stack<br><br>           It is similar to the deletion of an element at the end of a single linked list<br><br>     see  the function delete_end() in the program for operations of single linked list<br><br>  3)stack_display():This is the function which is for displaying the elements of a stack
Score (0-5): 4
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Using nodes to keep track of the head of the stack. Then using Push( ) and Pop ( ) to create the stack as needed.
Score (0-5): 4
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Use the head as the top of the stack, only modify the head when you push/pop... push would add a new item to the head, pop would remove the item from the head.
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: you implement a stack with a list by changing the pointer to the first element of the list to the new item and move the pointer from the top of the stack to the next item when removing an item.
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: You dynamicly create space as the stack grows.  The stack can be as long as you need.
Score (0-5): 2.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Declare a pointer that points to the head of the linked list, only add and remove nodes from the beginning of the list.
Score (0-5): 5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Creating a linked list. Add an element to the top of the stack when pushing and deleting an element when popping.
Score (0-5): 4
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: A singly-linked list is already a lot like a stack, it just depends on the way you address moving the head.
Score (0-5): 3.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: make a list, make the bottom the head, add on the end and make the end top
Score (0-5): 3.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: use the add function with a list as the beginning of the stack and remove for pop
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Use head as the top and push and pop nodes from the head.
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: create a node based list that points to the next list item down.
Score (0-5): 1.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: have the head of the list be the last item added, and a push just adds a new head.
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Create a new list. <br>Pop elements in the stack as needed. <br>Push the stack to remove items, unless the stack is empty.<br><br>The top item is at the head of the list.<br>The last item is at the end.
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: adding the element to the end of the list so that it links to the element before it. when popping the element it takes the last element in the list and sets the previous one as the end of the list.
Score (0-5): 3.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: You can implement a stack using arrays or and linked list. By the use of pointers, that point element(node) to the next element in the stack. By the use of pointers, the stack becomes a linked list.
Score (0-5): 2.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Elements are only inserted and removed from the head of the list.  There is no header node or current pointer.
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: use a linked list and keep track of a pointer that points to the first item
Score (0-5): 4
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: A singly linked list can already be easily used for LIFO data storage. Members of a stack can simply be pushed and popped from a list, the first item in will be the last out.
Score (0-5): 4.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: using pointer
Score (0-5): 1.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: the top is the first pointer.
Score (0-5): 3
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Keep a pointer pointing to the last element entered at the front of<br> the array and move the pointer "back" when you delete an element.
Score (0-5): 2.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: using linked list, you are pushing the node that contains each int to the stack until you get to the end of your linked list
Score (0-5): 2.5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: have a linked list, and for each push, add an item onto beginning of the list, and for each pop remove the first element in the list.
Score (0-5): 5
Question: How can you implement a stack with a list?
Instructor answer: Keep the top of the stack pointing to the head of the linked list, so the push and pop operations will add or remove elements at the beginning of the list.
Student answer: Using a linked list is one way to implement a stack so that it can handle essentially any number of elements. It is usually convenient to put a data structure in its own module, thus, you'll want to create files stack.h and a stack.c
Score (0-5): 2
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 converted to post fix expressions.  It still follow the order of precedence for the operators.
Score (0-5): 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 first converted to postfix expressions and then evaluated.
Score (0-5): 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 cannot evaulate infix expressions, it must first convert infix to postfix expression then it can evaluate.
Score (0-5): 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 using parentheses to have order in the expression.
Score (0-5): 2.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: In postfix notation.
Score (0-5): 4
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 usually convert infix expressions to post fix expression and evaluate them using a stack.
Score (0-5): 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 converted to postfix
Score (0-5): 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 interpreted as postfix expressions by implementing stacks.
Score (0-5): 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 first converted into an equivalent postfix expression so it can be read by the computer.
Score (0-5): 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 translates the infix expression to a postfix expression, then solves.
Score (0-5): 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: in postfix format
Score (0-5): 4
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 use parenthisis and a stack to determine which evaluations need to be made first
Score (0-5): 3
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 throwing variables into a postfix expression and operands onto a parentheses regulated stack until end parentheses and enough variables to operate on are encountered.
Score (0-5): 4.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 being passed to the function by a leading term
Score (0-5): 1.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: 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.
Score (0-5): 2.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>
Score (0-5): 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
Score (0-5): 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.
Score (0-5): 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.
Score (0-5): 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
Score (0-5): 1.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
Score (0-5): 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
Score (0-5): 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
Score (0-5): 4
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.
Score (0-5): 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+)
Score (0-5): 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.
Score (0-5): 5