Viswa45/ASAG huggingface dataset:
Question: What is the scope of global variables?
Instructor answer: File scope.
Student answer: The entire program or file.
Score (0-5): 5
Question: What is the scope of global variables?
Instructor answer: File scope.
Student answer: throught the programm
Score (0-5): 4.5
Question: What is the scope of global variables?
Instructor answer: File scope.
Student answer: the whole code
Score (0-5): 4.5
Question: What is the scope of global variables?
Instructor answer: File scope.
Student answer: File scope
Score (0-5): 5
Question: What is the scope of global variables?
Instructor answer: File scope.
Student answer: can be referenced by any function that follows their declarations or definitions in the source file
Score (0-5): 5
Question: What is the scope of global variables?
Instructor answer: File scope.
Student answer: global variables have program scope (accessible anywhere in program)
Score (0-5): 4.5
Question: What is the scope of global variables?
Instructor answer: File scope.
Student answer: variables that exist throught the entire script. their values can be changed anytime in the code and fucntions.
Score (0-5): 4.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: It expands the function's definition in that place.  Once the functions is called you can use it as many times as you need.  The compiler just expands on the function.
Score (0-5): 4.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: When the compiler inline-expands a function call, the function's code gets inserted into the caller's code stream (conceptually similar to what happens with a #define macro). This can, depending on a zillion other things, improve performance, because the optimizer can procedurally integrate the called code — optimize the called code into the caller. <br><br>
Score (0-5): 4.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: The inline keyword advises the compiler to copy the function's code in place to avoid function calls; however the compiler can and typically does ignore the inline qualifier for all but the smallest functions.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: The compiler can ignore the inline qualifier and typically does so for all but the smallest functions.
Score (0-5): 3
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: Placing the qualifier inline before a function's return type in the function definition "advises" the compiler to generate a copy of the function's code in place to avoid a function call.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: You declare your inline function in the header or before your int main(). You then can call that function at anytime in your main program quickly and easily.
Score (0-5): 2
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: It expands a small function out... making your code longer, but also makes it run faster.
Score (0-5): 4
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: the function is not treated as a separate unit like other functions
Score (0-5): 3.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: When the program compiles,it will copy the function inplace, avoiding a function call.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: It replaces all instances of that function call with the inline code itself, resulting in longer but faster programs.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: Ignores the inline qualifier and typically does so for all but the smallest functions.
Score (0-5): 3
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: If the function is small enough it will expand it but it will run faster as it will avoid making so many calls to the function.
Score (0-5): 4.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: it treats them as the same function
Score (0-5): 2
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: Inline functions are copied in place, instead of being referenced.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: For inline functions, the compiler creates a copy of the function's code in place so it doesn't have to make a function call and add to the function call stack.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: it generates a copy of the function's coding which eliminates calling the function
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: not answered
Score (0-5): 0
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: It generates a copy of the function's code by by inserting it in the program.
Score (0-5): 4.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: tells the compiler to make a copy of function's code in place to avoid a function call.  it typically ignores it, except for the smallest functions.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: The compiler can ignore the inline qualifier and typically does so for all but the smallest functions.
Score (0-5): 2
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: Multiple copies of the function code are inserted into the program, making it bigger.
Score (0-5): 4.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: compiler ignores inline qualifier
Score (0-5): 2.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: It generates a copy of the function, if it is needed again.
Score (0-5): 3.5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: The complier includes copies of inline functions instead of making function calls, but usually only with very small functions.
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: Compiler generate a copy of the function's code in place (when appropriate) to avoid a function call
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: instead of calling the function every time it is invoked, the compiler will replace the function call with a copy of the function body
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: Expands the function into the program
Score (0-5): 4
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: it generates a copy of the functions code in place to avoid a function call
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: the function call will be replaced by the code that was defined in the inline function
Score (0-5): 5
Question: How does the compiler handle inline functions?
Instructor answer: It makes a copy of the function code in every place where a function call is made.
Student answer: When the compiler inline-expands a function call, the function's code gets inserted into the caller's code stream (conceptually similar to what happens with a #define macro). This can, depending on a zillion other things, improve performance, because the optimizer can procedurally integrate the called code — optimize the called code into the caller.
Score (0-5): 4.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Overall the program has better performance (means it is faster) because it does not have to copy large amounts of data.
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: because you can't change the original and passing by reference limits memory needed for the program.
Score (0-5): 4.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Passing by reference can eliminate the pass-by-value overhead of copying large amounts of data.
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: It is often more efficient to pass references, rather than large objects, to functions. This allows the compiler to pass the address of the object while maintaining the syntax that would have been used to access the object.
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Pass by reference is good for performance reasons, because it can eliminate the pass by value overhead of copying large amounts of data.
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: You do not alter the original value of the variable that was passed.
Score (0-5): 3
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Don't have to make copies of stuff.
Score (0-5): 4.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: you do not use unessesary memory space to copy variables between functions
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: It elimitates the need to copy large amonts of data
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: The function can change the data stored in a variable passed by reference directly.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Gives called function the ability to access and modify the caller’s argument data.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Gives called function the ability to access and modify the caller’s argument data directly.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: It is more efficient and it changes the variable not online inside the function but outside so that the new value can be used elsewhere.
Score (0-5): 3
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: you don't make another copy and waste memory
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Passing by reference eliminates the copying of large amounts of data, typical with pass by value.
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: If a function's arguments are large in size, computing time and memory space is not wasted copying down the argument and passing it to the function.  Also pass by reference gives the function called the permission to read edit the argument directly.
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Gives access to the caller data directly, also it allows for modifying the data.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: less overhead overall, and you modify the variable directly.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: The original variable being referenced can be modified directly by the called function.
Score (0-5): 3
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: gives function ability to access and modify the caller's argument data directly
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Gives the called function the ability to access and modify the caller's argument data directly.
Score (0-5): 3
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Less overhead than passed by value, especially when using large numbers.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: large data items can be passed without copying the entire data point, reducing execution time and the amout of memory space needed<br>
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: The data can be modified directly instead of making a copy of the data. Improves execution time with large amounts of data.
Score (0-5): 4
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Functions can directly modify arguments that are passed by reference.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: It gives access and modify the caller's argument data directly. It eliminate the pass by value overhead of copying large amounts ofdata
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: it takes less memory, thus it would make the program faster
Score (0-5): 4
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: You are able to modify the variable that is referenced directly.
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: if you pass by reference, you can modify the value as opposed to passing by value where you cannot change the value
Score (0-5): 3.5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: only the memory address is sent to the function, so no copy of the object sent needs to be made. It makes the function run faster, and saves memory.
Score (0-5): 5
Question: What is the main advantage associated with function arguments that are passed by reference?
Instructor answer: It avoids making copies of large data structures when calling functions.
Student answer: Actual arguments are associated with dummy arguments when a function or subroutine is referenced. In a procedure reference, the actual argument list identifies the correspondence between the actual arguments provided in the list and the dummy arguments of the subprogram
Score (0-5): 3
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: The compiler selects the proper functions to execute based on number, types and order of arguments in the function call.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: They differentiated by the compiler by the conditions/inputs used for one of the overloaded functions.
Score (0-5): 3
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: The compiler distinguishes overloaded functions by their signatures. It encodes each function identifier with the number and types of its parameters to generate type-safe linkage, which ensures the proper overloaded function is called.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: Overloaded functions are distinguished by their signatures, Name mangling or name decoration, and type-safe linkage ensures that proper overloaded functions is called and types of the arguments conform to tpes to the parameters.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: The compiler selects proper function to execute based on number, types and order of arguments in the function call.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: By the type they are initilized with (int, char, etc.)
Score (0-5): 3
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: It selects the proper function to execute based on number, types and order of arguments in the function call.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: overloaded functions must have the same return type but different input parameters
Score (0-5): 3
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: It examines the names, types, and order of arguments on each function.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: unique function signatures
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: Is based on number, types, and order of arguments in the function call.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: Compiler selects proper function to execute based on number, types and order of arguments in the function call.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: not answered
Score (0-5): 0
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: they have to have same return type, but different input parameters
Score (0-5): 3
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: Overloaded functions are differentiated by their parameters.
Score (0-5): 4.5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: The compiler selects the right function to execute from the number, types and order of arguments in the function call.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: it creates a set of candidate functions then a set of viable functions
Score (0-5): 3
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: their function signature.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: The number and type of its parameters.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: by their function signature
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: They have the same name, just different parameters.
Score (0-5): 3.5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: They are differntiated by number, types and order of arguments in the function call.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: it looks at the number, types, and order of arguments in the function call<br>
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: The compiler differentiates overloaded functions by their signature.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: By the number, types, and order of their arguments
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: paremeters
Score (0-5): 4.5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: By the number, and the types and order of the  parameters.
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: by the number and type of arguments
Score (0-5): 5
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: by their signature (return type, argument list)
Score (0-5): 4
Question: How are overloaded functions differentiated by the compiler?
Instructor answer: Based on the function signature. When an overloaded function is called, the compiler will find the function whose signature is closest to the given function call.
Student answer: overloaded function simply invovles haing a method with the same name within the class. is used to implement a method for subclass which overrides in other words replaces the implementation of the super class. Overloading the concept of providing different meaning to a object based on the context of its presence. Overloading is one type of polymorphism and this is also a feature in programing.
Score (0-5): 3
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: A base case that is the simplest case for a problem so that the function will lead to it, if this does not happen then it will end up as an infinite loop. And a condition to know when to terminate.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: badly designed algorithyms. using recursion for a non recursive problem.
Score (0-5): 2.5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Infinite recursion can occur when the base case is omitted or the recursion step is written incorrectly so that it never converges on the base case.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Infinite recursion is an infinite loop if the condition is not met.  Either omitting the base case, or writing the recursion step incorrectly so that it does not converge on the base case causes "indefinite" recursion, eventually exhausting memory.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Either omitting the base case or writing the recursion step incorrectly so that it does not converge on the base case can cause an infinite recursion.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Not having a base case that returns a base value.
Score (0-5): 4
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Incorrect or missing base case. Must reduce to the base case. The function must get simpler each time it is run (converge to the base case).
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: no base case<br>no change in values.
Score (0-5): 4.5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: If at each recursive call the problem does not diminish or if it does not diminish to a base case, can cause infinite recursion.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Omitting the base case or incorrectly calling the recursive step.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: The recursive problem cannot be reduced to reach the base case.
Score (0-5): 4.5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Lack of defining a base case, or writing the recursion step incorrectly so that it does not converge on the base case
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Not having the proper case to leave the recursion
Score (0-5): 4
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: no base case, or the recursive calls do not converge to the base case
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: No base case, or an incorrectly written recursion step that does not converge on the base case will lead to infinite recursion.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: If the recursion function never reaches or successfully defines the base case it will recurse forever.<br><br>This happens many ways, such as the function doesn't progress towards the base case, or the function is coded poorly and doesn't even contain a base case.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: <br>not creating a base case, or in the case where the base case will never be met.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: improper handling of cases such that not all possible values are able to be handled.
Score (0-5): 3.5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: There is no base case.<br>The recursion step doesn't reduce the problem during each recursive call.
Score (0-5): 4.5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: no base case, as in a single return that does not include calling the function again.  a static value to end at.
Score (0-5): 3.5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Either omitting the base case, or writing the recursion step incorrectly so the it does not reach the base case can cause infinite recursion.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: omitting the base case or writing the recursive call so that it does not converge upon the base case.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Either omitting the base case, or writing the recursion step incorrectly so that it does not converge on the base case
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Infinite recursion may occur if no base case is defined or if the call is not varied.
Score (0-5): 4.5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Not having a base case, or building a recursion process that doesn't converge on the base case.
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: Either omitting the base case, or writing the recursion step incorerectly
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: no base case<br>or if the programmar does not define the base case as the simplest case and it never gets reached
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: No easily reached base case and no base case at all
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: function is never allowed to reach the 'base case'
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: it has no base case, or the base case is never met
Score (0-5): 5
Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.
Student answer: recursion refers to situations in which functions call themselves. These types of functions are known as recursive functions. That being said Infinite recursion occurs when the function is designed in such a way as to call it self forever without stopping possible causes
Score (0-5): 3
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both involve a controlled repetition structures, and they both have a termination test.  Also both of them can loop forever.
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: As discussed earlier, recursion may be used to process iterative actions. Recursion is used for calculations where the answer can be described in a function that relates to itself.
Score (0-5): 2
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both iteration and recursion are based on control statements and involve repetition. They can both also occur indefinitely.
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both are based on a control statement<br>        - Iteration-repetition structure<br>        - Recursion-selection structure<br><br>      Both involve repetition<br>        -Iteration-explicitly uses repetition structure<br>        -Recursion-repeated function calls<br><br>      Both involve a termination test<br>        -Iteration-loop-termination test<br>        -Recursion-base case <br><br>      Both gradually approach termination<br>        -Iteration-modifies counter until loop-termination test fails<br>        -Recursion-produces progressively simpler versions of problem<br><br>      Both can occur indefinitely<br>        -Iteration-if loop-continuation condition never fails<br>        -Recursion-if recursion step does not simplify the problem
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Iteration and recursion have many similarities: both are based on a control statement, involve repetition, involve a termination test, gradually approach termination and can occur infinitely.
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both rely on repetition, both have a base case, both can become an infinite loop. Anything recursive can also be solved with iteration.
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both will repeat (loop) until a condition is met, and exit the loop. Both are capable of entering an infinite loop.
Score (0-5): 4
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: anything you can do iterativly you can do recursively
Score (0-5): 3
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both are repetative and both have a end test.
Score (0-5): 4.5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Incorrectly writing either can result in infinite loops, both perform the same task over and over.
Score (0-5): 3.5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both are based on a control statement.<br>Both involve repetition.<br>Both involve a termination test.<br>Both gradually approach termination.<br>Both can occur infinitely.<br><br>
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Both are based on a control statement, Both involve repetition, Both involve a termination test, Both gradually approach termination, Both can occur infinitely
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: not answered
Score (0-5): 0
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: anything you can do recursively you can do iteratively
Score (0-5): 3
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Many problems can be solved by both iteration and recursion, and either may go into a condition of infinite execution if a termination test is omitted.
Score (0-5): 3.5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: Iteration and recursion both use repetition and perform several simple operations and algorithms successively until they reach a certain limit.  So both involve a termination test to find that limit and both slowly approach that termination limit.  Both are based on a control statement as well.  <br><br>If coded poorly, both can continue on for forever until the compiler or the computer either locks up, shuts down or halts the operation.
Score (0-5): 5
Question: What are the similarities between iteration and recursion?
Instructor answer: They both involve repetition; they both have termination tests; they can both occur infinitely.
Student answer: both based on control statement, involve repetition, and involve a termination test within loops
Score (0-5): 5