hemavardhang/MohlerASAG huggingface dataset:
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is a variable that contains a memory address for something that you can use, such as a value, array, or even a function.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: its a data type with a memory address and a value
Grade: 3.5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: a form of storing data that keeps the location in memory of an data type or object.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: it contains a object's memory address
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: variable that contains the memory address of a data object.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is an element that references a memory location.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: an object that points to a specific place in memory, where a variable or value is stored.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: a variable that stores the address of a memory location
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is a variable that points to an address in memory, which contains some data. The pointer does not contain or point to any data, only a memory address.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: Pointer is a variable which have a memory address of a variable.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: a pointer points to a location in memory where data is stored
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: a variable that holds the address of another variable and can access the contents of the variable.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: a pointer is a memory address that points to a data member
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A data type that stores the memory address of another variable.
Grade: 5 out of 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: its like a variable but only holds an address in meomrry not the physical address.
Grade: 3 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: Try several sets of data on an algorithm that includes worst case, best case, and random cases.  Also try and run the same program on a different computer with the same specs
Grade: 4.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: not answered
Grade: 0 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: time complexity using big O <br>logarthmic O(log n)<br>linear O(n)<br>exponential O(n^2)<br>quadratic O(n^k) k&gt;=1<br>Polynomial O(a^n) n&gt;1<br>
Grade: 2.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: Using some sort of counting principle of the number of operations performed in an algorithm.
Grade: 4.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: Experimental means you would actually write a prototype of the algorithm and measure the time it takes to run given certain parameters.
Grade: 5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: measuring the relationship of running an algorithm with different input sizes.
Grade: 4.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: Oposite of a theoretical assessment of the algorithm to determine runtime, but to run the code first to determine the the runtime.  This is not recommended because it is a limited test.  It does not include all possibilities of the data, nor the hardware used to process the data.
Grade: 4.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: The experimental approach for measuring the running time is by using the Big O equation which tells you the running time.
Grade: 3 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: You create and run  the algorithm multiple times, while measuring the amount of time it takes, you then average the results.
Grade: 5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: keep a value of how many operations it takes and add to this value each time a function is called.
Grade: 3.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: BIG-OH
Grade: 2.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: Running the program with various input data and measuring the running time with system time.
Grade: 5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: You run a program with different data sizes, like 10^x.  As you increase x and measure the completion speeds for the program, you can find patterns and attempt the measure the running time.  It's very important to keep the same software and hardware however, which makes experimental testing inferior to theoretical in the eyes of most.
Grade: 4 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: to run the program through and see how many times each thing is called and the runtime of each function is based on that.
Grade: 4.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: the number of times a specific segments get called per unit work.
Grade: 3 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: For every call into memory, add/ multiply it into an equation of type O(n)
Grade: 2.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: adding a time marker at the before the algorithm is called and another time marker immediately after so that you have the change in time, then you can calculate the efficiency by the speed of the computers cpu.
Grade: 3.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: Big O(h) notation
Grade: 2.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: the experimental approach measures actual running time in t.  t= seconds.
Grade: 5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: running an algorithm on a specific set of data
Grade: 4 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: In experimental terms, the running time of an algorithm is measured by the number of operations required to complete the function. This number can usually be expressed in big-O notation.
Grade: 3.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: run the code for n-times and get average values, drop the constant and lowest number. for example if <br>           f(x) = 3n +1<br>the running time will bef  f(x) = O(n)
Grade: 4 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: to measure the actual time of the program to run. and calculate the running time using the input and operations done
Grade: 5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: adding up the number of operations performed based on the worst case possible.
Grade: 2.5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: the experimental approach would be to run through the algorithm and see how long it takes
Grade: 5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: trying it with different sets of inputs, and measuring the amount of time that the algorithm actually takes.
Grade: 5 out of 5
Question: What is the experimental approach for measuring the running time of an algorithm?
Instructor answer: Implement the algorithm and measure the physical running time.
Student answer: running the input with various inputs measuring the running time with  system time
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: it scans the list and selects the smallest(largest) element and places it in the front, increment the curPtr by one, scan the list again for the next smallest(largest) element and place it in with respect with the other sorted elements.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sort searches the array for the lowest value and swaps it with the first value in the array. Then searches for the next lowest value and swaps it with the second item in the array, and so on.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Compare the largest element to the front element and swap data according to value if needed.
Grade: 4 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sort is a sorting algorithm that divides a list in half and has two lists. It then compares the first elements in both these lists and puts these elements in another list, having the smaller element before the bigger one.
Grade: 2 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Iterate through the list (assume list of integers), find the smallest one, and put it in a separate "sorted" list... then traverse again and find the next smallest, and move it to the sorted section... and repeat until you run out of elements to sort.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: selection sort selects the smallest element out of the list then the second smallest ....and sorts them acordingly.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: You select the smallest element and place it on the left.  You select the smallest element and sort it with respect the the item already on the left.  You continue this till the end of the collection of items.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: A selection sort scrolls through the data structure looking for the lowest (or highest) unsorted piece of data, moves it to the held spot, increments that spot by one, and starts the process over.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sort works by finding the smallest element and then compares it with the largest and sorts the elements.
Grade: 2 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sort is usually a recursive sorting method where you divide the elements to be sorted in half repeatedly. You then sort the smallest case, then work your way up, sorting each until they are all sorted.
Grade: 2.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: goes to the middle of the list, checks to see if it is greater or less then the value given and moves through the list accordingly to add the value into the proper place.
Grade: 2 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: selection sort finds the lowest element in the data set and places it behind the pivot point.
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sort iterates through the array one element at a time, seeking the least value from the right and replacing the current value with it.
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sort traverses an unsorted array looking for the smallest value, when it's found it is put at the beginning of the unsorted array.  Performed several times, this will output a sorted array.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: it runs through the list and finds the smallest (or largest) value and puts it at the appropriate position
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: pick a number, and set all values less than that number to the left, while all numbers on the right of that number is larger.
Grade: 3 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: It takes the largest item in the unsorted array and swaps it with last item in the unsorted array.
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: by selecting the first object and comparing it with the next objects to find one that is smaller, if it does it switches the two.  then it comes back the other way and sees if the objects previous to the last one is greater, if it does it switches them.  it does this while decreasing the range it looks at until it finishes in the middle.
Grade: 2.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sorts works by going through a certain list. Goes through the unsorted list and selecting the largest item in the list and placing it in a sorted array. There are two arrays, unsorted and sorted. Complete these steps until the list is sorted.
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: selection sort works by pulling all of the values off to the side, leaving one value in the list.  It will then insert a value into the list.  if the value is bigger it will go to the right, if smaller if will go to the left.
Grade: 2.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: selection sort searches for the smallest element of the remaining data organization and places it at the largest point of the new data organization
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: Selection sort sorts an array one element at at time. It first finds the element with the smallest key and puts it into the first location within its array or list, then finds the next smallest and puts it in the second location, and so on.
Grade: 5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: select an element compare it with 2nd element if it is greater, swap it
Grade: 3 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: it selects the smallest element in a list and switches it with the element in its correct position, then it selects the next smallest and does the same...
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: It starts at the first element and replaces it with the smallest element found to the right. It then repeats with the next element in the list.
Grade: 4.5 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: selection sort is when you pick a data member and put it in a new array, then you pick another data member and put it in order with the new array, then pick another and insert it in the correct place in the new array, etc etc
Grade: 3 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: it searches through the entire data set for the best element to go in the current position, then it moves up a position and searches through the remainder of the set for the best element for the new position.
Grade: 4 out of 5
Question: Briefly, how does selection sort work?
Instructor answer: It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
Student answer: selection sort  iterates through the array one element @ a time searching for the right and replacing current value with it.
Grade: 4 out of 5
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.
Grade: 5 out of 5
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: The advantage of linked lists is that they are not limited in size like arrays.
Grade: 5 out of 5
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: link lists dont have a fixed size
Grade: 5 out of 5
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: Linked Lists can be of variable size, where arrays have fixed size.
Grade: 5 out of 5
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: 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.
Grade: 5 out of 5
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 linked list has a dynamic size , but an array only has a fixed size and takes allot of extra operations to increase its size.
Grade: 5 out of 5
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: 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.
Grade: 5 out of 5
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: The main advantage to a linked list is that it can have it's size adjusted during runtime.
Grade: 5 out of 5
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: Linked lists are able to grow in size. So elements can be added to the list.
Grade: 5 out of 5
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: Linked lists are not confined to a specific size, and can have elements added and removed far easier. They are also easier to traverse.
Grade: 5 out of 5
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: There is no predetermined length
Grade: 5 out of 5
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: 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.
Grade: 4.5 out of 5
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: Linked lists may be dynamically grown.
Grade: 5 out of 5
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: 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.
Grade: 5 out of 5
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: linked lists have an indefinite size, whereas arrays are a specific size.
Grade: 5 out of 5
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: Linked lists have no predefined length, and thus you can have virtually unlimited items in that list.
Grade: 5 out of 5
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: They grow dynamically, unlike the fixed size array
Grade: 5 out of 5
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: 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
Grade: 5 out of 5
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: Linkded list does not have a fixed size. Arrays have a fixed size.
Grade: 5 out of 5
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: Linked lists have a dynamic size, where as arrays have a static size.
Grade: 5 out of 5
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: linked lists do not have a memory constraint other than total memory
Grade: 5 out of 5
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: 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.
Grade: 5 out of 5
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: Array have fixed size, in Link List are flexible for adding or deleting an element.
Grade: 5 out of 5
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: they are resizeable
Grade: 5 out of 5
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: Linked lists can be dynamically allocated and their size can change as needed.
Grade: 5 out of 5
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: linked lists do not have to have a specified size, they are easier to add to and remove from
Grade: 5 out of 5
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: they dont have a fixed size, no shiftnig needs to be done for insertion/deletion.
Grade: 5 out of 5
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: linked list many be dynamically grown. It has not limit<br><br>
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A data structure in C++ where the the first element in the queue is the first element taken out of the queue.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is an abstract data type that performs operations on both ends of the list and exhibits first-in first-out behavior.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: First in first out.
Grade: 4.5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is an abstract data type that involves putting an element at the back of the list. Queues use the FIFO, first in first out, idea where the first element in the list is the first that comes out.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A data structure that implements first in, first out. The element that has been there the longest is the first to get served.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: a data structure that inserts elements at the end of it and removes elements from the front.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is a collection of elements with the characteristics of first in first out (FIFO).  The first item in is the first item out.  All additional items are added to the end of the list.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is a data structure that inserts data into a FIFO configuration, that is, data input to the structure is always at it's end, and data taken is always from the beginning.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: It is a particular set of entities that are put in to a certain order by the enqueue and the dequeue functions.
Grade: 3.5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is a data type that operates under a FILO (First In Last Out) method. This means that the first element inserted into the queue is the first element removed.
Grade: 4 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: like a linked list except it is first in last out
Grade: 2.5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is like a stack except it follows FIFO (First in first out) .
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is a data structure where the first node in is the first node out.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is a First in First out data structure much like a line for a movie theatre.  The first object in line is the first object to be handled or enacted upon.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: its a lot like a stack, except that the first item put into the list is the first item to be taken from the list.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: a first in first out list of items, like if you put 5, 4, 3, 2, and 1 in the queue it will when you dequeue items remove the items in the same order as put in, so thus it will put out, 5, 4, 3, 2, and 1 in that exact order.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A linked list with a First In, Out structure<br>dequeue at the head of the list<br>enqueue at the end of the list
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: a list of objects that follow the rule first in first out, essentially a linked list that goes in order of the first object in the list is the first to be taken off.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is an abstract data type that is based off of the priniple of first in first out. FIFO. The first item inserted into the list will the first item taken out.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: It is a "first in first out" data structure.  It can be implemented with either a linked list or an array.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: an ordered list that performs task in the order of first in first out. adding items to the queue places items behind the rest of them. taking items off the queue takes the one that has waited the longest.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is a linear, first-in first-out data structure. Data must be accessed in the same order it was put into the queue, so only the oldest item in the queue is accessible at any time. Main functions defined are enqueue and dequeue.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: Queue is a buffer, it follows the rule of First In and First out. Queue is very useful in computer science for scheduleing .
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: a queue is a set of elements where 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 stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: Is a list of items where the the user only has access to the first element and each new element is added at the end.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: a queue is a list of data that follows the fifo principle, an example of this would be when you get into a line at a movie theater...the first one there gets to buy a ticket first
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: A queue is a data structure that holds a set of objects, which has a FIFO (first in first out) priority.
Grade: 5 out of 5
Question: What is a queue?
Instructor answer: A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
Student answer: like a linked list expect first in last out
Grade: 1.5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: push and pop
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Pop, which removes the head, or least recently inserted node from the stack. Push, which inserts a new node at the head of the stack.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Push and pop
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: The Push function and the Pop function.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: push - puts an element on the stack<br>pop- takes an element off the stack
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Push  and pop.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Push and Pop
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: push and pop.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Push and Pop. Push adds an element to the stack, while Pop removes the top element from a stack.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: pop and push
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: push,pop,search,isEmpty
Grade: 4.5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Push, Pop, isEmpty, isFull<br><br>Maybe List to show all elements or an operation to count how many elements in the stack.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: pop, push
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: isempty, push and pop, along with usually,
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: push and pop. push puts objects into the stack and pop takes them out following the first in last out rule.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: The main operations in a stack are push and pop. Push adds an item to the top of the stack, pop removes the top item from the stack.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: push, which adds an item to the top of the stack, and<br>pop, which takes the first item off the top to the stack
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: the main functions defined for a stack are push, which puts an element on the top of the stack, and pop, which removes an item from the top.
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Push()<br>Pop()<br>Full()<br>IsEmpty()
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: pop and push<br>to remove an element and to insert an element
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: Push, Pop
Grade: 5 out of 5
Question: What are the main operations associated with a stack?
Instructor answer: push and pop
Student answer: push - Add an element to the top of the stack<br>pop - remove the top element from the stack
Grade: 5 out of 5
Question: What is the Euler tour traversal of a tree?
Instructor answer: A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
Student answer: When you traverse a tree of any size you will visit each node three times.  Its on the order of 3n or O(n) running time.
Grade: 4 out of 5
Question: What is the Euler tour traversal of a tree?
Instructor answer: A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
Student answer: The Euler tour traversal of a tree begins at the root and visits each node in the tree from the left, then bottom, then right sides.
Grade: 5 out of 5
Question: What is the Euler tour traversal of a tree?
Instructor answer: A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
Student answer: Where you visit the in order according to its data value.
Grade: 3 out of 5
Question: What is the Euler tour traversal of a tree?
Instructor answer: A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
Student answer: It is a tree that shows how it functions. It contains parents, children, siblings, ancestors and descendents. The use of tree type algorithm is also an alternative sorting algorithm.
Grade: 2 out of 5