Recursive methods ---

do not use an if-statement

are useful when each recursive call is a solution to a smaller, identical problem

are not useful in programming

all of the above

Move To... This element is a more accessible alternative to drag & drop reordering. Press Enter or Space to move this question.

Flag this Question

Question 35 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988998

What question should you keep in mind when debugging a recursive method? ---

What question should you keep in mind when debugging a recursive method? ---

Should a for-loop be included in the method?

Are the activation records correct?

if the method returns a value, does each of the cases return a value?

All of the above

Move To... This element is a more accessible alternative to drag & drop reordering. Press Enter or Space to move this question.

Flag this Question

Question 36 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35989002

The best-case performance for an array of n items using insertion sort is: ---

The best-case performance for an array of n items using insertion sort is: ---

O(n2)

O(n)

O(1)

there is no best-case

Move To... This element is a more accessible alternative to drag & drop reordering. Press Enter or Space to move this question.

Flag this Question

Question 37 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988986

Recursion can be used to solve problems like ---

Recursion can be used to solve problems like ---

processing linked chains

processing arrays

sorting

all of the above

Move To... This element is a more accessible alternative to drag & drop reordering. Press Enter or Space to move this question.

Flag this Question

Question 38 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988984

What happens when a recursive method does not reach the base case? ---

What happens when a recursive method does not reach the base case? ---

the program crashes

a stack overflow occurs

both a and b

none of the above

Move To... This element is a more accessible alternative to drag & drop reordering. Press Enter or Space to move this question.

Flag this Question

Question 39 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988948

Polish notation is another term for a(n) --

Polish notation is another term for a(n) --

postfix expression

prefix expression

infix expression

algebraic expression

Move To... This element is a more accessible alternative to drag & drop reordering. Press Enter or Space to move this question.

Flag this Question

Question 40 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988967

In an array-based chain implementation of a Stack ADT, what is the performance of the ensureCapacity method when the array is full? ---

In an array-based chain implementation of a Stack ADT, what is the performance of the ensureCapacity method when the array is full? ---

O(1

O(n)

O ( n log n )

O(n2)

Move To... This element is a more accessible alternative to drag & drop reordering. Press Enter or Space to move this question.

Flag this Question

Question 41 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988939

The operation to return a stack's top entry is called a(n) --

The operation to return a stack's top entry is called a(n) --

get

tp

peek

pop