Recursive methods --- Move To... This element is a more accessible alternative t

Question

Recursive methods ---

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? ---

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: ---

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 ---

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? ---

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) --

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? ---

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) --

Explanation / Answer

1.Option B

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

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

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

Answer: Option C ( if the method returns a value, does each of the cases return a value)

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

Question 36:The best-case performance for an array of n items using insertion sort is: ---O(n) Option C

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

Question 37: Recursion can be used to solve problems like ---Option D ,(ALL the above)

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

Question 38 What happens when a recursive method does not reach the base case? --- Both a and b

(option C) Program crashes and stack overflow occurs

_____________________________

Question 39 Polish notation is another term for a(n) --Postfix expression(option A)

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

Question 40: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) option A

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

Question 41 The operation to return a stack's top entry is called a(n)---peek (option C)

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

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