Recursive Algorithms
Authored by R Woodruff
Computers
12th Grade
Used 72+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is not essential in a recursive algorithm?
Base Case
Recursive Case
Contains a stack
Stop after a finite number of calls
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The sub routine calls itself within the algorithm
Base Case
Recursive Case
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The sub routine has a stopping condition that causes it to unwind
Base Case
Recursive Case
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A recursive algorithm must always contain a base case
True
False
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
RuntimeError: maximum recursion depth exceeded
: what does this mean
The program has crashed because it is taking too long
The program has crashed because it has run out of memory
The program has crashed because the user entered the wrong value
The program has crashed because a variable had the wrong variable name
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the base case?
n
n - 1
n = n + calcSum (n-1)
if n > 0
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is the best definition of a recursive method?
A method that iterates itself exactly 5 times.
A method that calls itself by name within the method.
A method that will never iterate infinitely.
A method that cannot be called more than once.
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
