this Question Question 2 2 pts Edit this Question Delete this Question 0 multipl

Question

this Question

Question 2 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988976

When a vector needs to increase its size ---

When a vector needs to increase its size ---

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

Edit this Question Delete this Question

0 multiple_choice_question 35988945

The pop and peek methods throw a(n) ________ exception when the stack is empty. --

The pop and peek methods throw a(n) ________ exception when the stack is empty. --

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

Edit this Question Delete this Question

0 multiple_choice_question 35988926

Which statement is true about the VectorStack class methods? ---

Which statement is true about the VectorStack class 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 5 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35989000

The best-case scenario for an selection sort is: --

The best-case scenario for an selection 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 6 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35989024

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

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

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

Edit this Question Delete this Question

0 multiple_choice_question 35988935

The operation to add an entry to a stack is called a(n) --

The operation to add an entry to a stack is called 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 8 2 pts

Edit this Question Delete this Question

0 multiple_choice_question 35988980

The condition when a recursive method does not satisfy a base case it is called ---

The condition when a recursive method does not satisfy a base case it is called ---

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

Edit this Question Delete this Question

0 multiple_choice_question 35988928

When you add an item to a stack, you place it --

When you add an item to a stack, you place it --

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

Edit this Question Delete this Question

0 multiple_choice_question 35988992

A recursive method that processes a chain of linked nodes ---

A recursive method that processes a chain of linked nodes ---

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

Edit this Question Delete this Question

0 multiple_choice_question 35988994

Traversing a chain of linked nodes ---

Traversing a chain of linked nodes ---

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

Edit this Question Delete this Question

0 multiple_choice_question 35988990

Recursive methods need a(n) ---

Recursive methods need a(n) ---

Explanation / Answer

* The pop and peek methods throw a(n) ________ exception when the stack is empty.
It throws stackEmpty Exception.
* Which statement is true about the VectorStack class methods?
both a & b, they can invoke the methods of the Vector class and as well they require slightly more execution time than the ArrayStack methods.
* The best-case scenario for an selection sort is: --   
the elements are in reverse sorted order.
*What is the efficiency of the iterative selection sort method for a chain of n linked nodes?
O(n2)
*The operation to add an entry to a stack is called a(n)
Push
*The condition when a recursive method does not satisfy a base case it is called -

*When you add an item to a stack, you place it -
on the top
*A recursive method that processes a chain of linked node

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

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