id
stringlengths 11
11
| question
stringclasses 79
values | instructor_answer
stringclasses 80
values | student_answer
stringlengths 1
959
| score_grader_1
float32 0
10
| score_grader_2
float32 0
10
| score_avg
float32 0
5
|
|---|---|---|---|---|---|---|
E03.Q03.A25
|
How does the compiler handle inline functions?
|
It makes a copy of the function code in every place where a function call is made.
|
Compiler generate a copy of the function's code in place (when appropriate) to avoid a function call
| 5
| 5
| 5
|
E03.Q03.A26
|
How does the compiler handle inline functions?
|
It makes a copy of the function code in every place where a function call is made.
|
instead of calling the function every time it is invoked, the compiler will replace the function call with a copy of the function body
| 5
| 5
| 5
|
E03.Q03.A27
|
How does the compiler handle inline functions?
|
It makes a copy of the function code in every place where a function call is made.
|
Expands the function into the program
| 4
| 4
| 4
|
E03.Q03.A28
|
How does the compiler handle inline functions?
|
It makes a copy of the function code in every place where a function call is made.
|
it generates a copy of the functions code in place to avoid a function call
| 5
| 5
| 5
|
E03.Q03.A29
|
How does the compiler handle inline functions?
|
It makes a copy of the function code in every place where a function call is made.
|
the function call will be replaced by the code that was defined in the inline function
| 5
| 5
| 5
|
E03.Q03.A30
|
How does the compiler handle inline functions?
|
It makes a copy of the function code in every place where a function call is made.
|
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.
| 5
| 4
| 4.5
|
E03.Q04.A00
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Overall the program has better performance (means it is faster) because it does not have to copy large amounts of data.
| 5
| 5
| 5
|
E03.Q04.A01
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
because you can't change the original and passing by reference limits memory needed for the program.
| 4
| 5
| 4.5
|
E03.Q04.A02
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Passing by reference can eliminate the pass-by-value overhead of copying large amounts of data.
| 5
| 5
| 5
|
E03.Q04.A03
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
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.
| 5
| 5
| 5
|
E03.Q04.A04
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Pass by reference is good for performance reasons, because it can eliminate the pass by value overhead of copying large amounts of data.
| 5
| 5
| 5
|
E03.Q04.A05
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
You do not alter the original value of the variable that was passed.
| 3
| 3
| 3
|
E03.Q04.A06
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Don't have to make copies of stuff.
| 5
| 4
| 4.5
|
E03.Q04.A07
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
you do not use unessesary memory space to copy variables between functions
| 5
| 5
| 5
|
E03.Q04.A08
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
It elimitates the need to copy large amonts of data
| 5
| 5
| 5
|
E03.Q04.A09
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
The function can change the data stored in a variable passed by reference directly.
| 4
| 3
| 3.5
|
E03.Q04.A10
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Gives called function the ability to access and modify the caller’s argument data.
| 4
| 3
| 3.5
|
E03.Q04.A11
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Gives called function the ability to access and modify the caller’s argument data directly.
| 4
| 3
| 3.5
|
E03.Q04.A12
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
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.
| 3
| 3
| 3
|
E03.Q04.A13
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
you don't make another copy and waste memory
| 5
| 5
| 5
|
E03.Q04.A14
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Passing by reference eliminates the copying of large amounts of data, typical with pass by value.
| 5
| 5
| 5
|
E03.Q04.A15
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
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.
| 5
| 5
| 5
|
E03.Q04.A16
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Gives access to the caller data directly, also it allows for modifying the data.
| 4
| 3
| 3.5
|
E03.Q04.A17
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
less overhead overall, and you modify the variable directly.
| 3
| 4
| 3.5
|
E03.Q04.A18
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
The original variable being referenced can be modified directly by the called function.
| 3
| 3
| 3
|
E03.Q04.A19
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
gives function ability to access and modify the caller's argument data directly
| 4
| 3
| 3.5
|
E03.Q04.A20
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Gives the called function the ability to access and modify the caller's argument data directly.
| 3
| 3
| 3
|
E03.Q04.A21
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Less overhead than passed by value, especially when using large numbers.
| 3
| 4
| 3.5
|
E03.Q04.A22
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
large data items can be passed without copying the entire data point, reducing execution time and the amout of memory space needed<br>
| 5
| 5
| 5
|
E03.Q04.A23
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
The data can be modified directly instead of making a copy of the data. Improves execution time with large amounts of data.
| 4
| 4
| 4
|
E03.Q04.A24
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
Functions can directly modify arguments that are passed by reference.
| 4
| 3
| 3.5
|
E03.Q04.A25
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
It gives access and modify the caller's argument data directly. It eliminate the pass by value overhead of copying large amounts ofdata
| 5
| 5
| 5
|
E03.Q04.A26
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
it takes less memory, thus it would make the program faster
| 4
| 4
| 4
|
E03.Q04.A27
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
You are able to modify the variable that is referenced directly.
| 4
| 3
| 3.5
|
E03.Q04.A28
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
if you pass by reference, you can modify the value as opposed to passing by value where you cannot change the value
| 4
| 3
| 3.5
|
E03.Q04.A29
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
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.
| 5
| 5
| 5
|
E03.Q04.A30
|
What is the main advantage associated with function arguments that are passed by reference?
|
It avoids making copies of large data structures when calling functions.
|
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
| 3
| 3
| 3
|
E03.Q05.A00
|
How are overloaded functions differentiated by the compiler?
|
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.
|
The compiler selects the proper functions to execute based on number, types and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A01
|
How are overloaded functions differentiated by the compiler?
|
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.
|
They differentiated by the compiler by the conditions/inputs used for one of the overloaded functions.
| 2
| 4
| 3
|
E03.Q05.A02
|
How are overloaded functions differentiated by the compiler?
|
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.
|
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.
| 5
| 5
| 5
|
E03.Q05.A03
|
How are overloaded functions differentiated by the compiler?
|
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.
|
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.
| 5
| 5
| 5
|
E03.Q05.A04
|
How are overloaded functions differentiated by the compiler?
|
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.
|
The compiler selects proper function to execute based on number, types and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A05
|
How are overloaded functions differentiated by the compiler?
|
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.
|
By the type they are initilized with (int, char, etc.)
| 4
| 2
| 3
|
E03.Q05.A06
|
How are overloaded functions differentiated by the compiler?
|
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.
|
It selects the proper function to execute based on number, types and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A07
|
How are overloaded functions differentiated by the compiler?
|
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.
|
overloaded functions must have the same return type but different input parameters
| 5
| 1
| 3
|
E03.Q05.A08
|
How are overloaded functions differentiated by the compiler?
|
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.
|
It examines the names, types, and order of arguments on each function.
| 5
| 5
| 5
|
E03.Q05.A09
|
How are overloaded functions differentiated by the compiler?
|
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.
|
unique function signatures
| 5
| 5
| 5
|
E03.Q05.A10
|
How are overloaded functions differentiated by the compiler?
|
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.
|
Is based on number, types, and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A11
|
How are overloaded functions differentiated by the compiler?
|
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.
|
Compiler selects proper function to execute based on number, types and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A12
|
How are overloaded functions differentiated by the compiler?
|
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.
|
not answered
| 0
| 0
| 0
|
E03.Q05.A13
|
How are overloaded functions differentiated by the compiler?
|
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.
|
they have to have same return type, but different input parameters
| 5
| 1
| 3
|
E03.Q05.A14
|
How are overloaded functions differentiated by the compiler?
|
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.
|
Overloaded functions are differentiated by their parameters.
| 5
| 4
| 4.5
|
E03.Q05.A15
|
How are overloaded functions differentiated by the compiler?
|
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.
|
The compiler selects the right function to execute from the number, types and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A16
|
How are overloaded functions differentiated by the compiler?
|
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.
|
it creates a set of candidate functions then a set of viable functions
| 3
| 3
| 3
|
E03.Q05.A17
|
How are overloaded functions differentiated by the compiler?
|
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.
|
their function signature.
| 5
| 5
| 5
|
E03.Q05.A18
|
How are overloaded functions differentiated by the compiler?
|
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.
|
The number and type of its parameters.
| 5
| 5
| 5
|
E03.Q05.A19
|
How are overloaded functions differentiated by the compiler?
|
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.
|
by their function signature
| 5
| 5
| 5
|
E03.Q05.A20
|
How are overloaded functions differentiated by the compiler?
|
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.
|
They have the same name, just different parameters.
| 4
| 3
| 3.5
|
E03.Q05.A21
|
How are overloaded functions differentiated by the compiler?
|
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.
|
They are differntiated by number, types and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A22
|
How are overloaded functions differentiated by the compiler?
|
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.
|
it looks at the number, types, and order of arguments in the function call<br>
| 5
| 5
| 5
|
E03.Q05.A23
|
How are overloaded functions differentiated by the compiler?
|
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.
|
The compiler differentiates overloaded functions by their signature.
| 5
| 5
| 5
|
E03.Q05.A24
|
How are overloaded functions differentiated by the compiler?
|
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.
|
By the number, types, and order of their arguments
| 5
| 5
| 5
|
E03.Q05.A25
|
How are overloaded functions differentiated by the compiler?
|
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.
|
Compiler selects proper function to execute based on number, types and order of arguments in the function call.
| 5
| 5
| 5
|
E03.Q05.A26
|
How are overloaded functions differentiated by the compiler?
|
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.
|
paremeters
| 5
| 4
| 4.5
|
E03.Q05.A27
|
How are overloaded functions differentiated by the compiler?
|
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.
|
By the number, and the types and order of the parameters.
| 5
| 5
| 5
|
E03.Q05.A28
|
How are overloaded functions differentiated by the compiler?
|
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.
|
by the number and type of arguments
| 5
| 5
| 5
|
E03.Q05.A29
|
How are overloaded functions differentiated by the compiler?
|
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.
|
by their signature (return type, argument list)
| 5
| 3
| 4
|
E03.Q05.A30
|
How are overloaded functions differentiated by the compiler?
|
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.
|
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.
| 5
| 1
| 3
|
E03.Q06.A00
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
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.
| 5
| 5
| 5
|
E03.Q06.A01
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
badly designed algorithyms. using recursion for a non recursive problem.
| 3
| 2
| 2.5
|
E03.Q06.A02
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
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.
| 5
| 5
| 5
|
E03.Q06.A03
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
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.
| 5
| 5
| 5
|
E03.Q06.A04
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
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.
| 5
| 5
| 5
|
E03.Q06.A05
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Not having a base case that returns a base value.
| 5
| 3
| 4
|
E03.Q06.A06
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
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).
| 5
| 5
| 5
|
E03.Q06.A07
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
no base case<br>no change in values.
| 5
| 4
| 4.5
|
E03.Q06.A08
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
If at each recursive call the problem does not diminish or if it does not diminish to a base case, can cause infinite recursion.
| 5
| 5
| 5
|
E03.Q06.A09
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Omitting the base case or incorrectly calling the recursive step.
| 5
| 5
| 5
|
E03.Q06.A10
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
The recursive problem cannot be reduced to reach the base case.
| 5
| 4
| 4.5
|
E03.Q06.A11
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Lack of defining a base case, or writing the recursion step incorrectly so that it does not converge on the base case
| 5
| 5
| 5
|
E03.Q06.A12
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Not having the proper case to leave the recursion
| 5
| 3
| 4
|
E03.Q06.A13
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
no base case, or the recursive calls do not converge to the base case
| 5
| 5
| 5
|
E03.Q06.A14
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
No base case, or an incorrectly written recursion step that does not converge on the base case will lead to infinite recursion.
| 5
| 5
| 5
|
E03.Q06.A15
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
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.
| 5
| 5
| 5
|
E03.Q06.A16
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
<br>not creating a base case, or in the case where the base case will never be met.
| 5
| 5
| 5
|
E03.Q06.A17
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
improper handling of cases such that not all possible values are able to be handled.
| 5
| 2
| 3.5
|
E03.Q06.A18
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
There is no base case.<br>The recursion step doesn't reduce the problem during each recursive call.
| 5
| 4
| 4.5
|
E03.Q06.A19
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
no base case, as in a single return that does not include calling the function again. a static value to end at.
| 5
| 2
| 3.5
|
E03.Q06.A20
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Either omitting the base case, or writing the recursion step incorrectly so the it does not reach the base case can cause infinite recursion.
| 5
| 5
| 5
|
E03.Q06.A21
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
omitting the base case or writing the recursive call so that it does not converge upon the base case.
| 5
| 5
| 5
|
E03.Q06.A22
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Either omitting the base case, or writing the recursion step incorrectly so that it does not converge on the base case
| 5
| 5
| 5
|
E03.Q06.A23
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Infinite recursion may occur if no base case is defined or if the call is not varied.
| 5
| 4
| 4.5
|
E03.Q06.A24
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Not having a base case, or building a recursion process that doesn't converge on the base case.
| 5
| 5
| 5
|
E03.Q06.A25
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
Either omitting the base case, or writing the recursion step incorerectly
| 5
| 5
| 5
|
E03.Q06.A26
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
no base case<br>or if the programmar does not define the base case as the simplest case and it never gets reached
| 5
| 5
| 5
|
E03.Q06.A27
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
No easily reached base case and no base case at all
| 5
| 5
| 5
|
E03.Q06.A28
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
function is never allowed to reach the 'base case'
| 5
| 5
| 5
|
E03.Q06.A29
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
it has no base case, or the base case is never met
| 5
| 5
| 5
|
E03.Q06.A30
|
When defining a recursive function, what are possible causes for infinite recursion?
|
If the recursion step is defined incorrectly, or if the base case is not included.
|
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
| 5
| 1
| 3
|
E03.Q07.A00
|
What are the similarities between iteration and recursion?
|
They both involve repetition; they both have termination tests; they can both occur infinitely.
|
Both involve a controlled repetition structures, and they both have a termination test. Also both of them can loop forever.
| 5
| 5
| 5
|
Subsets and Splits
Score summary per assignment-question pair
Provides a comprehensive summary of scoring metrics for different question IDs across both open-ended and close-ended responses, highlighting variations and averages.
Number of student answers per assignment-question pair
Counts the number of student answers for each question ID across both open-ended and close-ended datasets, providing insight into question popularity.