Question: What is the advantage of linked lists over arrays?
Instructor answer: Linked lists are dynamic structures, which allow for a variable number of elements to be stored.

Student answer: A link list can grow to a infinite size as a array has a fixes size.
Score (0-5): 5

Student answer: The advantage of linked lists is that they are not limited in size like arrays.
Score (0-5): 5

Student answer: link lists dont have a fixed size
Score (0-5): 5

Student answer: Linked Lists can be of variable size, where arrays have fixed size.
Score (0-5): 5

Student answer: Linked lists do not have a definite size. They can be as big or as small as needed, and they don't have to allocate extra memory for elements you don't need. Arrays size must be defined.
Score (0-5): 5

Student answer: a linked list has a dynamic size , but an array only has a fixed size and takes allot of extra operations to increase its size.
Score (0-5): 5

Student answer: You do not have to predetermine your list size as you do with arrays.<br>Linked list have the ability to be as large as you want them adding memory as needed.
Score (0-5): 5

Student answer: The main advantage to a linked list is that it can have it's size adjusted during runtime.
Score (0-5): 5

Student answer: Linked lists are able to grow in size. So elements can be added to the list.
Score (0-5): 5

Student answer: Linked lists are not confined to a specific size, and can have elements added and removed far easier. They are also easier to traverse.
Score (0-5): 5

Student answer: There is no predetermined length
Score (0-5): 5

Student answer: Inserts into a linked list are far cheaper than an insert into an array. With an array, all items after the one being inserted must me shifted, with a linked list, only the pointers are replaced.
Score (0-5): 4.5

Student answer: Linked lists may be dynamically grown.
Score (0-5): 5

Student answer: Linked lists are very dynamic in that they can change and be added/subtracted to very easily because they are not linear in memory.<br>  Arrays are pre-specified in size to be cast over a certain amount of disk space.  This makes insertion into Arrays difficult because all elements must be shifted, and if you reach the end of the array, you are done even if you have more data to input.  Linked Lists do not run into these problems.
Score (0-5): 5

Student answer: linked lists have an indefinite size, whereas arrays are a specific size.
Score (0-5): 5

Student answer: Linked lists have no predefined length, and thus you can have virtually unlimited items in that list.
Score (0-5): 5

Student answer: They grow dynamically, unlike the fixed size array
Score (0-5): 5

Student answer: you can add as many nodes as you like without having to specify a list size, if an array gets too big you have to copy its entire contents to another larger array to get more room
Score (0-5): 5

Student answer: Linkded list does not have a fixed size. Arrays have a fixed size.
Score (0-5): 5

Student answer: Linked lists have a dynamic size, where as arrays have a static size.
Score (0-5): 5

Student answer: linked lists do not have a memory constraint other than total memory
Score (0-5): 5

Student answer: The primary advantage of linked lists over arrays is their ability to become larger or smaller as data is added and removed from the list, whereas arrays may waste memory for small data sets, and run out of space for large data sets.
Score (0-5): 5

Student answer: Array have fixed size, in Link List are flexible for adding or deleting an element.
Score (0-5): 5

Student answer: they are resizeable
Score (0-5): 5

Student answer: Linked lists can be dynamically allocated and their size can change as needed.
Score (0-5): 5

Student answer: linked lists do not have to have a specified size, they are easier to add to and remove from
Score (0-5): 5

Student answer: they dont have a fixed size, no shiftnig needs to be done for insertion/deletion.
Score (0-5): 5

Student answer: linked list many be dynamically grown. It has not limit<br><br>
Score (0-5): 5