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

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

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

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

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

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

Student answer: You dynamicly create space as the stack grows.  The stack can be as long as you need.
Score (0-5): 2.5

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

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

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

Student answer: make a list, make the bottom the head, add on the end and make the end top
Score (0-5): 3.5

Student answer: use the add function with a list as the beginning of the stack and remove for pop
Score (0-5): 4.5

Student answer: Use head as the top and push and pop nodes from the head.
Score (0-5): 4.5

Student answer: create a node based list that points to the next list item down.
Score (0-5): 1.5

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

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

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

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

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

Student answer: use a linked list and keep track of a pointer that points to the first item
Score (0-5): 4

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

Student answer: using pointer
Score (0-5): 1.5

Student answer: the top is the first pointer.
Score (0-5): 3

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

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

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

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