Question 1

__________ is the process of arranging a list of items into a defined order based on some criteria.
A) searching
B) categorizing
C) classifying
D) sorting

Accepted Answer

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

Question 2

What type does "compareTo" return?
A) int
B) String
C) boolean
D) char

Accepted Answer

The "compareTo" method returns an int value. It is used in Java for comparing two strings lexicographically. The result is a positive number if the first string is lexicographically greater than the second string, a negative number if it is less, and zero if the strings are equal.

Question 3

Which of these have the smallest time complexity?
A) Insertion sort
B) Quick Sort
C) Bubble Sort
D) Selection Sort

Accepted Answer

Quick Sort, on average, has a time complexity of O(n log n), which is generally better than the O(n^2) time complexity of Insertion Sort, Bubble Sort, and Selection Sort for large datasets.

Question 4

_______ orders a list of values by repetitively comparing neighboring elements and swapping their positions if necessary.
A) Insertion sort
B) Quick Sort
C) Bubble Sort
D) Selection Sort

Accepted Answer

Bubble Sort is the algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which means the list is sorted.

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.
A) Merge
B) Quick
C) Linear
D) Lazy

Accepted Answer

Merge sort algorithm is known for its divide and conquer approach where it recursively divides the list into halves until each sub-list has one element and then merges these sub-lists in sorted order.

Question 6

This type of sequential sort algorithm sorts a list by repeatedly placing the next smallest element into its final sorted position.
A) insertion sort
B) bubble sort
C) selection sort
D) merge sort

Accepted Answer

Selection sort works by repeatedly finding the minimum element from the unsorted part and putting it at the beginning, effectively placing each element in its final sorted position one at a time.

Question 7

The best comparison sort in terms of order is:
A) O(1)
B) O(n)
C) O(log(n))
D) O(nlog(n))

Accepted Answer

The best comparison-based sorting algorithms, such as mergesort and heapsort, have a time complexity of O(nlog(n)). This is the best possible time complexity for a comparison sort as proven by the comparison sort lower bound theorem.

Question 8

Which sort method starts by repeatedly splitting the list in half?
A) Bubble sort
B) Insertion sort
C) Merge sort
D) selection sort

Accepted Answer

Merge sort is the sorting algorithm that starts by repeatedly splitting the list in half until it cannot be further divided, then merges the smaller lists into larger ones in a sorted manner.

Question 9

What is the time complexity of a Quick sort?
A) 2logn
B) logn
C) nlogn
D) n^2

Accepted Answer

Quick sort has an average time complexity of O(n log n) due to its divide-and-conquer approach, but in the worst case, it can degrade to O(n^2).

Question 10

Merge Sort has time complexity O(___).
A) O(n^2)
B) b)O(n)
C) c)O(nlog(n))
D) d)O(n^2)

Accepted Answer

Merge Sort has a time complexity of O(nlog(n)) in all cases (worst, average, and best scenarios) because it divides the list into two halves, recursively sorts them, and then merges the sorted halves.

Question 11

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

Accepted Answer

Bubble Sort works by repeatedly swapping adjacent elements if they are in the wrong order. After one pass, the largest element (9) would have bubbled up to the end, resulting in the sequence 3 5 5 9.

Question 12

______ is the process of finding a designated target within a group of items or determining that it doesn't exist.

Accepted Answer

The answer of ______ is the process of finding a...

Question 13

An efficient search ______ the number of comparisons made.

Accepted Answer

The answer of An efficient search ______ the number of...

Question 14

If a class implements Comparable, it must have a ______ method.

Accepted Answer

The answer of If a class implements Comparable, it must...

Question 15

A ______ search eliminates half of the search pool with each step and thus is O(____) as long as the search pool is ____.

Accepted Answer

The answer of A ______ search eliminates half of the...

Question 16

Searching is the process of finding a designated target within a group of items or determining that it ______.

Accepted Answer

The answer of Searching is the process of finding a...

Question 17

A method is made static by using the ______ modifier in the method declaration.

Accepted Answer

The answer of A method is made static by using...

Question 18

A ______ search capitalizes on the fact that the search pool is sorted.

Accepted Answer

The answer of A ______ search capitalizes on the fact...

Question 19

A binary search eliminates ______ of the viable candidates with each comparison.

Accepted Answer

The answer of A binary search eliminates ______ of the...

Question 20

A binary search has ______ complexity, making it very efficient for a large search pool.

Accepted Answer

The answer of A binary search has ______ complexity, making...

Quiz 8: Recursion

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

What type does "compareTo" return?

Which of these have the smallest time complexity?

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

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.

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

The best comparison sort in terms of order is:

Which sort method starts by repeatedly splitting the list in half?

What is the time complexity of a Quick sort?

Merge Sort has time complexity O(___) .

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