5. When writing a recursive algorithm, what is the first step? a) determining th

Question

5. When writing a recursive algorithm, what is the first step?

a) determining the size

b) getting an exact problem definition

c) choosing the base case

d) choosing the recursive case

6. When you have an exact definition of a recursive problem, what is the next step?

a) determining the size

b) getting an exact problem definition

c) choosing the base case

d) choosing the recursive case

8. A ____________________ structure is the main control structure in a recursive routine, and a ____________________ structure is the main control structure in an iterative routine.

a) looping, branching

b) branching, looping

c) looping, looping

d) branching, branching

9. Which of the following statements could describe the base case of a recursive algorithm?

a) The function is equal to its parameter value times the function performed on one-half its parameter value.

b) If the parameter value is 100, the function is equal to zero.

c) The function operates on floating point numbers.

d) a and b above

10. Which of the following statements could describe the base case of a recursive algorithm?

a) F(x) = x - F(x - 1)

b) If the array length is 100, do nothing.

c) All parameters are integers.

d) F(0) = 27

e) b and d above

Explanation / Answer

Answer:-

---------------

5.b) getting an exact problem definition

6.a) determining the size

8.b) branching, looping

9.b) If the parameter value is 100, the function is equal to zero.

10.e) b and d above

Related Questions

Navigate

• Browse (All)
• Browse 5
• Subjects

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