Home Library Explore SAT

Home Library Explore SAT

Recursion Concepts Flashcards | StudBud

Explore/Recursion Concepts

The condition to terminate a recursion is known as...

________ could result when there is no defined base case.

Recursion Concepts

10 terms·StudBud Administration·36 plays

Questions to prepare for the quiz on recursion. Based on Java Concepts 4e by Cay Horstmann #computerscience #java #programming

Flashcards10 cardsFPractice quizPHost liveL

Questions 10

Answers

1
________ could result when there is no defined base case.
An infinite loop
A mutual recursion
An infinite recursion
An iterative solution
2
The condition to terminate a recursion is known as...
permutation
the recursion helper
the base case
the recursive case
3
A ____ computation solves a problem using the solution of the same problem with simpler values.
iterative
recursive
sentinel
method
4
What does mystery(6) return?
24
42
64
15
5
What does mystery(4) print?
7
64
42
24
6
What is the base case?
x>0
x=2
x=1
x=0
7
For recursion to terminate, there must be...
an if statement
special cases for the simplest values
an iterative solution
a stopping condition
8
The second step in programming a recursive solution should be...
creating a syntax diagram
thinking recursively
determining a way to get the problem closer to the base case
writing a iterative solution, because recursion is too hard
9
The final step in programming a recursive solution is...
writing another method for the simpler case
returning the base case
thinking recursively
passing the simpler problem to the method by calling itself
10
To program a recursive solution, one should start by...
defining the simple base case and its return value
thinking up an iterative solution
thinking recursively
using a syntax tree