Data Structures Quiz

Question 1

__________ is the process of arranging a list of items into a defined order based on some criteria.

Answer 1

Sorting

Question 2

What type does “compareTo” return?

Answer 2

Int

Question 3

Which of these have the smallest time complexity?

Answer 3

Quick Sort

Question 4

_______ orders a list of values by repetitively comparing neighboring elements and swapping their positions if necessary.

Answer 4

Bubble Sort

Question 5

The _____ sort algorithm sorts a list by recursively dividing the list in half until each sub-list has one element and then merging these sub-lists into the sorted order.

Answer 5

Merge Sort

Question 6

This type of sequential sort algorithm sorts a list by repeatedly placing the next smallest element into its final sorted position.

Answer 6

Selection Sort

Question 7

The best comparison sort in terms of order is:

Answer 7

O(nlog(n))

Question 8

the _____ method starts by repeatedly splitting the list in half?

Answer 8

Merge Sort

Question 9

What is the time complexity of a Quick sort?

Answer 9

nlogn

Question 10

Merge Sort has time complexity O(___).

Answer 10

nlogn

Question 11

After one pass on the numbers ( 5 3 9 5 ), what would be the result if you were to use
Bubble Sort?

Answer 11

3 5 5 9

Question 12

What sorting algorithm has the largest worst-case time complexity?

Answer 12

Quick Sort

Question 13

the _______ sort divides the array into a sorted and an unsorted region, and iteratively shrinks the unsorted region by picking its first element and inserting it into the correct position in the sorted region

Answer 13

Insertion Sort