Question 13 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988978

A method that calls itself is called a ---

A method that calls itself is called a ---

base method

iterative method

recursive method

dynamic 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 14 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988943

A reasonable action when attempting to remove an item from an empty stack is --

A reasonable action when attempting to remove an item from an empty stack is --

assume a precondition that the stack is not empty has been met

throw an exception

return null

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 15 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988963

In a vector implementation of a Stack ADT, you clear all of the contents of a stack using which vector method? ---

In a vector implementation of a Stack ADT, you clear all of the contents of a stack using which vector method? ---

delete

clear

deleteAll

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 16 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988961

In a vector implementation of a Stack ADT, you check for an empty stack using which vector method? ---

In a vector implementation of a Stack ADT, you check for an empty stack using which vector method? ---

empty

stackEmpty

isEmpty

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 17 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988951

Reverse polish notation is another term for a(n) --

Reverse polish notation is another term for a(n) --

postfix expression

prefix expresson

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 18 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988955

In a vector implementation of a Stack ADT, you add an entry to the top of a stack using which vector method? ---

In a vector implementation of a Stack ADT, you add an entry to the top of a stack using which vector method? ---

add

push

put

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 19 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35989017

Shell sort can be improved by: ---

Shell sort can be improved by: ---

using selection sort instead of insertion sort as the final step.

alternating insertion sort and selection sort each iteration.

you cannot improve the algorithm's time efficiency.

adding 1 to the space when it is even.

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 20 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35989011

The average-case performance for shell sort is: ---

The average-case performance for shell sort is: ---

O(n2)

O(n2.5)

O(n1.5)

O(n3)

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 21 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988958

In a vector implementation of a Stack ADT, you remove an entry from the top of a stack using which vector method? ---

In a vector implementation of a Stack ADT, you remove an entry from the top of a stack using which vector method? ---

remove

pop

retrieve

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 22 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988982

When too many recursive calls are made creating more activation records than the allocated program memory can handle, what kind of error occurs? ---

When too many recursive calls are made creating more activation records than the allocated program memory can handle, what kind of error occurs? ---

recursive overflow

infinite recursion

activation record overflow

stack overflow

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 23 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988957

In a vector implementation of a Stack ADT, you retrieve the top entry without removing it using which vector method? ---

In a vector implementation of a Stack ADT, you retrieve the top entry without removing it using which vector method? ---

peek

look

lastElement

none of the above