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

Edit this Question Delete this Question

0 multiple_choice_question 35989029

The best-case scenario for an insertion sort is --

The best-case scenario for an insertion sort is --

the elements are in reverse sorted order

the elements are already in sorted order

the elements are in random order

there is no best-case scenario

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

Edit this Question Delete this Question

0 multiple_choice_question 35988973

In the Java Class Library, the default constructor Vector creates an empty vector with an initial capacity of ---

In the Java Class Library, the default constructor Vector creates an empty vector with an initial capacity of ---

0

100

10

user-defined

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

Edit this Question Delete this Question

0 multiple_choice_question 35988969

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

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

O(n)

O(1)

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

Edit this Question Delete this Question

0 multiple_choice_question 35988933

Stacks exhibit which type of behavior? --

Stacks exhibit which type of behavior? --

first in, last out

first in, first out

last in, first out

last in, first out

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

Edit this Question Delete this Question

0 multiple_choice_question 35989004

What is the efficiency of the insertion sort method for a chain of n linked nodes? ---

What is the efficiency of the insertion sort method for a chain of n linked nodes? ---

O(2n)

O(n)

O(n2)

O(n log 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 29 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988937

The operation to retrieve the top entry of a stack without removing it is called --

The operation to retrieve the top entry of a stack without removing it is called --

pop

look

peek

top

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

Edit this Question Delete this Question

0 multiple_choice_question 35989026

The O(n²) analysis of insertion sort is a(n) _______ analysis. --

The O(n²) analysis of insertion sort is a(n) _______ analysis. --

worst case

best case

average case

unknown

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

Edit this Question Delete this Question

0 multiple_choice_question 35988996

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

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

Does each base case produce a result that is correct for that case?

are there enough base cases?

is at least one of the cases a base case that has no recursive call?

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

Edit this Question Delete this Question

0 multiple_choice_question 35988947

The precedence of an operator in a postfix expression --

The precedence of an operator in a postfix expression --

is always left-to-right

is always right-to-left

is implied by the order in which the operators and operands occur

depends on the compiler implementation