Deck 8: Recursion

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

Answer 1

sorting

Question 2

What type does "compareTo" return?

A) int
B) String
C) boolean
D) char

Answer 2

int

Question 3

Which of these have the smallest time complexity?

A) Insertion sort
B) Quick Sort
C) Bubble Sort
D) Selection Sort

Answer 3

Quick Sort

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

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

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

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))

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

Question 9

What is the time complexity of a Quick sort?

A) 2logn
B) logn
C) nlogn
D) 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)

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

Question 12

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

Question 13

An efficient search ______ the number of comparisons made.

Question 14

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

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

Question 22

The ______ sort algorithm sorts a list of values by repetitively putting a particular value into its final, sorted, position.

Question 23

The ______ sort algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted.

Question 24

The ______ sort algorithm sorts a list by repeatedly comparing neighboring elements and swapping them if necessary.

Question 25

The ______ sort algorithm sorts a list by partitioning the list and then recursively sorting the two partitions.

Question 26

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

Question 27

A ______ sort is inherently based on queue processing.

Question 28

Bubble, Selection and Insertion sort all have time complexity of O(____).^.

Question 29

When would a linear search be preferable over a binary search?

Question 30

Show the steps of an Insertion Sort for the numbers ( 5 3 9 5 ).

Question 31

Show the steps of a Selection Sort for the numbers ( 5 3 9 5 ).

Question 32

An efficient search maximizes the number of comparisons made.

Question 33

A binary search capitalizes on the fact that the list is not sorted.

Question 34

A binary search can only be performed if the search pool is sorted

Question 35

Linear search has logarithmic complexity, making it very efficient for a large search pool.

Question 36

Bubble, Selection and Insertion sort all have time complexity of O(n).^.

Question 37

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

Question 38

An efficient search minimizes the number of comparisons made.

Question 39

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

Question 40

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

Question 41

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

Question 42

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

Question 43

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

Question 44

The insertion sort algorithm sorts a list by repeatedly comparing neighboring elements and swapping them if necessary.

Question 45

The bubble sort algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted.

Question 46

The quick sort algorithm sorts a list by partitioning the list and then recursively sorting the two partitions.

Question 47

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

Question 48

A radix sort is Order(n²).

Question 49

When would a linear search be preferable to a logarithmic search?

Question 50

Which searching method requires that the list be sorted?

Question 51

When would a sequential sort be preferable to a recursive sort?

Question 52

The insertion sort algorithm sorts using what technique?

Question 53

The bubble sort algorithm sorts using what technique?

Question 54

The selection sort algorithm sorts using what technique?

Question 55

The quick sort algorithm sorts using what technique?

Question 56

The merge sort algorithm sorts using what technique?

Question 57

How many queues would it take to use a radix sort to sort names stored as all lowercase?