Viswa45/ASAG huggingface dataset:
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: one declared as static is one that is already defined. The program knows the length and the array from the start, whereas non-static arrays are declared or assigned later.
Score (0-5): 3
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: a non static array must reinitialize itself every function call, while a static array will only initialize itself once, unless otherwise forced.
Score (0-5): 5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: A static array retains any modified values after a function call.<br>Automatic arrays reset to their initial values when the function ends.
Score (0-5): 4.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: a static array is one that keeps its values and is not initialized every time a class function is called, it's data is not lost at function end.
Score (0-5): 4.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: an array that is declared as static can only be used in the function that its being called in. Its a constant array. Static is another way of say const.
Score (0-5): 2.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: Values in an array that is not delcared as static will remain constant.  When an array is declared const values within the array can be manipulated.
Score (0-5): 2.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: the data of a static array cannot be changed
Score (0-5): 2.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: Standard arrays terminate when the functions that call them finish.<br>A static array is not removed from memory when it's parent function terminates, leaving it available for other functions (or new instances of the original function).
Score (0-5): 4
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: by defining static array it doese not lose scope in locala function. static array makes programm more scalable.<br>non static array lose scope inside the local function.
Score (0-5): 4.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: static arrays can be called from anywhere
Score (0-5): 2
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: A static array cannot be changed. A regular array can be changed when it is passed to a function or manually.
Score (0-5): 2.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: a static array can be can be edited throughout the program, while a non-static array can only be edited within a given function
Score (0-5): 3.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: An array that is declared static is allocated when the program begins to run, and is not freed until the program exits, but has limited scope. A non-static array is allocated and freed every time that it comes in and out of scope.
Score (0-5): 4.5
Question: What is the difference between an array that is declared as static and one that is not?
Instructor answer: The static arrays are intialized only once when the function is called.
Student answer: static has a predetermined size that cannot be passed while vis versa.
Score (0-5): 3
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: the type char[] has a  null ('\n' ) element at the very end.
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: a variable char is basically any non command key on the keyboard that you can press. A string is a collection of letters or numbers that is stored together to be used later. Comonly strings are used for words. Chars can be used for less but can have opperations performed on them in a useful way.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: The programmer must provide the null terminating character in a string of characters using type char[] and must also ensure that the array is large enough to contain the input string of characters and the null terminating character.
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: String of characters are followed by a null statement.  type string is for example <br><br>string s;
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: String contains a word where as char can contain phrases or a string of characters.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: a string is a variable with a single entinty of letters combined into one while in a char[] each letter is assigned a memory value and each has its own variable assigned i.e. char[0] char[1].
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: A string contains a null character at the end of the string, which makes it easily possible to get the string length. A char array can have a virtually unlimited length, therefore, its size must be declared/limited.
Score (0-5): 4
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: an array of characters stores a null character at the end
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: When you read a string of characters, you also read in the white space.  When you read characters declared char you only read the characters, no white space.
Score (0-5): 3
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: Character arrays will terminate at any whitespace, including spaces. Strings terminate when they encounter the new line character.
Score (0-5): 3.5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: The difference is that a string that is declared a variable of type char[] is each char is included in the array versus the string of characters that is read into a variable.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: An array of strings reads the string literals, meaning anything within "quotes". A char array reads a string as each individual character.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: character arrays can call on individual letters were a string array can only call words.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: The character array has an end of line character at the end of it.
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: Type char[] may contain a null value as the last element, whereas type string will not.
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: The variable of type string has a terminating character \0 at the end of it.
Score (0-5): 4
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: the one that is type string has an extra string member. The /0 at the end.
Score (0-5): 4
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: a string has variable size and function calls available, while an character array usually has a static size.
Score (0-5): 3.5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: a string char[] adds a null value to the end of the string.
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: char array needs an end character signature and is made up of characters each separate from each other, a string is an object in itself, with a value that the user enters.
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: the variable of type char[], each character is stored into a different memory address and can be accessed easly, where as in a string of character, its not easy to be able to access each character in the string.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: When the string is passed into the array char, individual characters are stored and can be manipulated.  Although when a word is stored into a string variable, it is stored as one word and not as individual characters.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: a string variable can change in size and is passed to functions by value, whereas a type char[] cannot change in size and is passed to functions by reference only
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: A string type string acts as a single object, with individual char entities accessible only through specific string class functions.<br>A char array is less robust, but allows direct access to specific char entities.
Score (0-5): 3
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: In arrays strings are stored as a characters (char[]), each character of string will be stored in each memory location of the array, while string of characters is only one memory location.
Score (0-5): 2
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: an array of characters has one more element, its last element,the terminating element, or null, which doesnt exist in a variable of type string
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: A string of characters is a specific variable type that has no extra data at the end. A string of type char[] is all the characters and a null ('\0')
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: a string of characters will have a null character or value at the end of the string
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: when the characters are put in a char array, there is also a null terminating character added to the end, '\0'
Score (0-5): 5
Question: What is the main difference between a string of characters that is read into a variable of type string versus a variable of type char[]?
Instructor answer: The char[] will automatically add a null \0 character at the end of the string.
Student answer: string of characters that is read into a variable of type string includes,
Score (0-5): 1.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: For example we have an array on n elements, the divide and conquer splits up the array into equal halves and repeats this process until each element is by itself
Score (0-5): 4
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Divide and coquer means dividing a problem into 2+ problems which are solved and then merged  back together for a final solution to the whole problem.
Score (0-5): 5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: The divide and conquer paradigm divides a problem into smaller and smaller portions that are easier to solve.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Divide elements,recur then conquer, which works in merge sort and quicksort.
Score (0-5): 4
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: To divide and conquer, you divide the program in half once or multiple times to the extent that the program as a whole is easier to work in groups to solve the problem.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: to divide one larger string/line of values and sepereate them into smallers lines to easily manipulate them and then replace them in the order in which they should be.
Score (0-5): 3.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Split the problem into smaller, more manageable parts, and proceed to address the smaller problems.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: dived and conquer is the breaking up of a large complex program into small easy to solve components.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Dividing a larger problem into the smallest incident of the problem and solving the smallest incident.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Break up very large data structures into smaller sub-units, that are easier to manipulate.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: The divide-and-conquer technique is where it takes the sorting algorithm and breaks up the array into smaller elements of the array to tackle the problem and run the algorithm.
Score (0-5): 4
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: The divide-and-conquer paradigm divides the problem into two pieces and works on each piece separately, allowing for a faster approach to 2 separate smaller problems.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Take a problem and divide it into a smaller problem and solve that smaller problem, or divide it into a smaller problem and solve it, thus solving the whole problem in the process.
Score (0-5): 5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: The idea is to split the problem into half and solve for the smaller split-problems.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: The divide and conquer paradigm, splits a large problem into simpler problems, at which point it solves the simpler problems and merges the simple solutions together to answer the large problem.
Score (0-5): 5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Divide-and-conquer refers to abstraction, the act of separating large, complex problems into smaller, easier problems that can be solved by a relatively simple algorithm.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: It takes a large problem and splits it into two or more easier or faster solutions, and  makes for better readability.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: it is the taking of a larger problem and splitting it into simpler smaller problems.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: It divides the problem into singular units and works on the problem piece by piece until the problem is solved.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: smaller parts are easier to compare than comparing the whole, so it divides the problem down in halves until it can easily compare, then works backwards putting it back together to give the solution.
Score (0-5): 5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: a divide-and-conquer paradigm. takes some data, divides it into two parts, and works on each part indiviually until the item is found.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: The idea of divide and conquer is to take a large problem, split it into n smaller problems, making the program easier to read and modify.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: the divide and conquer paradigm is a recursive solution that keeps dividing the problem into halves until a base case is reached.
Score (0-5): 4.5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: dividing and conquering means breaking a problem into two smaller problems, solving both of those, and putting the two solutions together.
Score (0-5): 5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: Divide the big problem into small problem, solve small problem and join small solved elements of the problem.<br>if there is two ore more elements in the array, divide the array into parts and compare the elements, after comperison, conquer the elements. If array have n element, first half have n/2 elements
Score (0-5): 5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: divide the array in half, sort each half, then sort them back in one array
Score (0-5): 3
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: You take a class and break down everything it is supposed to do into easily managed functions.
Score (0-5): 3
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: this is shown by the use of .cpp and header files.  by splitting the program up into smaller subsections of individual code, it becomes easier to write and keep up with as opposed to having all of your code in one file
Score (0-5): 3
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: When a problem is too big, split it into smaller problems of the same type, and solve those, then from the solutions of the smaller problem, give the solution to the larger original problem.
Score (0-5): 5
Question: Briefly describe the divide-and-conquer paradigm.
Instructor answer: Divide a problem into smaller subproblems, solve them recursively, and then combine the solutions into a solution for the original problem.
Student answer: it is the separating of large program into smaller classes then until target is reached.
Score (0-5): 3.5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: It uses the divide and conqure technique recursively and then when merging back together it compares each element together in a sorted list, this is done by reversing the divide and conquer technique
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: A merge sort works by removing all items to sepperate memory locations and merging them back together in order.
Score (0-5): 3.5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: It divides the array into two halves, sorts each half, then merges the two halves together.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Divide into two sublists and then those sublists break into length 1, then merges the sublists sorted.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Merge sort uses the "divide and conquer" idea where it divides the array in half multiple times and then joins each element of the array back into one sorted array. This is one of the best sorting algorithms besides Quicksort.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: divides the line in half coninuously until you get to only a single value then recombine the values to form a sorted line.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Continually split array in half, sort each side of the halves, then put them back together once organized.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: merge sort splits the array of elements into smaller arrays until the arrays reach size 1 and then the merge sort merges the smaller arrays into arrays of size 2 then it moves to the next step and merges the next arrays.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: By divide and conquer.
Score (0-5): 3.5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Break a single array down into many arrays with individual elements, then sort the elements as you reconstruct them back into a single array.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Merge sort breaks the array in half, and continues to do so until it has 2 elements to compare and sorts them, after doing so it "merges" back as it keeps on sorting the algorithm as it does so.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Merge sort divides the problem in half, organizes each half, then brings the two halves together again.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Take an array and split it into two, then solve these simpler problems and merge the two answers in correct order.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: A merge sort recursively divides the array into half until only one element remains, then it sorts the data on its way out of the recursive call by merging the cells.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Merge sort recursively divides an array into two arrays until all arrays have 1 element, at which point it merges the 1 element arrays into larger sorted arrays, the final returned array being the sorted version of the initial array.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Merge sort continuously breaks an array in half then sorts the arrays as it concatenates them back together into one sorted array.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: It takes an array, splits itself in half, sorts the two halves (either by recursion or iteration) and compares them together giving a third array a full sorted list with both halves rejoined.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: it splits a large array into small arrays and recurs until the array is a size of 1, and then merges all of the arrays back together until the source array is completely sourted.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Mergesort divides the array into smaller halves and then combines the sorted subarrays into one sorted array.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: merge sort breaks the array down in halves until it is comparing two values, sorts those two values, then merges that back with the other broken down parts that it sorted, each level merging more sets together till you return back to your whole array in order.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Divides the data into twor separate arrays, sorts the two arrays and merges them back to back together recursively.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Take the initial array and split it into two, temporary, smaller arrays, sort the two smaller arrays, and merge them back into a single array.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: merge sort divides the data into halves until data of one element is reached and then merges each element together according to its placement in comparison to the rest of the data
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: merge sort uses the divide and conquer strategy, sorting an array in parts, then merging the sorted parts back together.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Divide recursuivly big array into two arrays, sort two array and merge them togather recuruivly.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: divides an array in half and sorts each half by calling its self, thus dividing each half again and again and sorting it until the array is sorted. then putting the elements back in the original array sorted.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: Merge sort takes an array and splits it in half and sends each half back to itself recursively and merges and sorts the two halves when it starts going back up.
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: merge sort splits an array into two halves and then sorts the two smaller arrays, and then merges them back together to form a sorted array
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: the merge sort continually divides the array (or set of containers) into halves, until it reaches the point where there is just one element left, then merges each of the sets of two sorted arrays (containers).
Score (0-5): 5
Question: Briefly describe in one sentence how does merge sort work?
Instructor answer: It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays.
Student answer: merge sort splits an array of elements into smaller and smaller array's till the value of 1 is reached.
Score (0-5): 4
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A variable in memory that hold the address of another memory location to which it points too
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is a variable that contains the memory address of a given value.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is a variable that stores the address of another variable.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is a variable that holds a memory address or location of another variable.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A data type that points to an address in memory which contains certain information. Used for pass-by-reference to save memory.
Score (0-5): 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 of a certain data type
Score (0-5): 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 the address location of another variable.  Represented by (*).
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is a variable that holds the address of a given variable (and of a given data type)
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: pointer is a programming data type whose value points to another value stored in computer memory by its address.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A data type that points to a specific memory address.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: Its like a variable except it only holds the address in memory of the variable not the physical information.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: a pointer is a reference to a memory location.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: A pointer is an alias to an object in memory.
Score (0-5): 4
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.
Score (0-5): 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
Score (0-5): 3.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.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: The address of a location in memory.
Student answer: it contains a object's memory address
Score (0-5): 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.
Score (0-5): 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.
Score (0-5): 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.
Score (0-5): 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
Score (0-5): 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.
Score (0-5): 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.
Score (0-5): 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
Score (0-5): 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.
Score (0-5): 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
Score (0-5): 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.
Score (0-5): 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.
Score (0-5): 3
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
Score (0-5): 4.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
Score (0-5): 0
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>
Score (0-5): 2.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.
Score (0-5): 4.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.
Score (0-5): 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.
Score (0-5): 4.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.
Score (0-5): 4.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.
Score (0-5): 3
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.
Score (0-5): 5