1. Tail recursion _______ . A) always takes more time than regular recursion B)

ID: 3714607 • Letter: 1

Question

1. Tail recursion _______ .

A) always takes more time than regular recursion

B) can be transformed into an iterative algorithm — algorithmically

C) is just as problematic as redundant recursion

D) is rarely worth the extra effort to develop

E) requires the single recursive invocation to be at the last line of the algorithm

2. When applying a Master Theorem, ____.

A) allow plenty of time to progress from apprentice through journeyman to become a master

B) be careful deciding which answer bracket you fall into

C) carefully verify the conditions on the pattern’s parameters

D) make sure the recurrence has as many prior terms as possible

E) match the pattern carefully — especially the non-homogeneous part

3. A recurrence relation ___.

A) calculates an

B) can be used to describe the behavior of a recursive function

C) is homogeneous if it involves no more than prior terms of the sequence

D) is linear if the prior terms of the sequence are all to the first power

E) uses some subset of {a0, a1, . . . an-1}

4. When solving a recurrence relation via the characteristic equation method, ____ .

A) get its insurance information up front so you are sure to get paid

B) make sure to keep fractions and radicals exact

C) make sure you find all the numbers in the sequence

D) you’ll need an initial condition for each prior term used

E) you’ll need an initial condition for each prior term used or skipped

Hi Dear,

1)
E) requires the single recursive invocation to be at the last line of the algorithm
2)
B) be careful deciding which answer bracket you fall into

3)
B) can be used to describe the behavior of a recursive function
4)
D) you’ll need an initial condition for each prior term used

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.