1) Complete the code for the calcPower recursive function shown below, which is

Question

1) Complete the code for the calcPower recursive function shown below, which is intended to raise the base number passed into the function to the exponent power passed into the function:

2) Consider the following recursive code snippet:

What value is returned from a call to mystery(3,6)

3) Consider the following recursive code snippet:

Identify the terminating condition(s) of function mystery?

4) Consider the following code snippet for recursive addition:

Identify the terminating condition in this recursive function.

There is no terminating condition

5) What is required to make a recursive function successful?

I. One or more special cases that handle the simplest computations directly
II. A recursive call to a smaller or simpler version of the problem
III. Mutually recursive calls

  answer = base * calcPower(base - 1, exponent)  

Explanation / Answer

1.   C)   answer = base * calcPower(base, exponent - 1)
2.   c)   18
3.   c)   n <= 0 or n == 1
4.   a)   if i == 0 :
5.   c)_   I and II only

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

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