quiz2

Question 1

Each class provides its own implementation of hashCode()

Answer 1

False

Question 2

Which of the following sorting algorithm is NOT stable?

Answer 2

b.
Selection sort

Question 3

Object class contains hashCode() method with its default implementation

Answer 3

True

Question 4

The given illustration is about __________.

Answer 4

a.
Merge sort

Question 5

A hash table uses a hash function (algorithm) to compute an index

Answer 5

True

Question 6

Which of the following sorting algorithms has the lowest worst-case complexity?

Answer 6

d.
merge sort

Question 7

The following code is an implementation of _________________.

Answer 7

c.
Top-down reheapify (sink) implementation

Question 8

The next statements are about _______ sort.

Select a pivot point which could be: First element, Last element, Middle element in the sequence

Partition the other elements into two sub-arrays, according to whether they are less or greater than the pivot point

Answer 8

a.
Quick

Question 9

What is represented in the Figure below:

Answer 9

c.
Hash Table

Question 10

Which of the following sorting algorithms not has a worst-case time complexity of O(n^2)?

Answer 10

c.
Merge Sort

Question 11

Which sorting algorithm works by repeatedly selecting the largest remaining element and placing it at the beginning of the sorted portion of the array?

Answer 11

d.
Selection Sort

Question 12

Which of the following sorting algorithms can be used for sorting linked lists?

Answer 12

c.
Merge Sort

Question 13

The following method is an implementation of ___________.

public static void XXX(int[] arr, int left, int right) {

if (left >= right) {

return;

}

int pivot = YYY(arr, left, right);

XXX(arr, left, pivot - 1);

XXX(arr, pivot + 1, right);

}

public static int YYY(int[] arr, int left, int right) {

int pivot = arr[right];

int i = left - 1;

for (int j = left; j < right; j++) {

if (arr[j] < pivot) {

  i++;

  int temp = arr[i];

  arr[i] = arr[j];

  arr[j] = temp;

}

}

int temp = arr[i + 1];

arr[i + 1] = arr[right];

arr[right] = temp;

return i + 1;

}

Answer 13

a.
Quick sort

Question 14

Which of the following sorting algorithm has best case time complexity of O(n^2)?

Answer 14

c.
insertion sort

Question 15

Which of the following sorting algorithms requires extra memory space to sort an array?

Answer 15

a.
Merge Sort

Question 16

The capacity and load factor are parameters that affect the Hash Table performance

Answer 16

True

Question 17

Choose worst case of quick sort when the selected pivot point is always the smallest or largest

Answer 17

b.
O(n^2)

Question 18

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

Answer 18

c.
Θ(n2), Θ(n log n) and Θ(n2)

Question 18

Insertion sort performs two operations: it scans through the list, comparing each pair of elements, and it swaps elements if they are out of order

Answer 18

False

Question 18

Quick sort running time depends on the selection of

Answer 18

b.
Pivot element