Data Struct: Quiz 3

Choose a CORRECT statement about pivot in quick sort method.

• A pivot divides the list evenly.

• A pivot can be chosen randomly.

• A pivot can be chosen by using a formula

• A pivot makes the searching method becomes slow

Identify the INCORRECT statement about searching

i. Binary search starts by testing the largest data

ii. Linear search can be done for unsorted data only

iii. Linear search starts by testing data at the middle of list

iv. Binary search can be done for sorted homogeneous data

• i, ii and iii

• ii, iii and iv

• i, iii and iv

• i, ii, iii and iv

Identify the sorting algorithm that apply divide-and-conquer method.

• Binary sort

• Linear sort

• Merge sort

• Quick sort

Identify the sorting method based on the given description.

· compares adjacent pairs and swaps them if they are in the wrong order

· the method is repeated until the list is sorted

• Bubble sort

• Insertion sort

• Merge sort

• Quick sort

List the correct TWO (2) sorting method

• Insertion sort and binary sort

• Merge sort and selection sort

• Linear sort and bubble sort

• Quick sort and searching sort

select the correct differences between Linear search and Binary search.

• Linear: Data is searched in a linear order

  Binary: Data is search using a varieties formula

• Linear: Can be applied to sorted or unsorted data

  Binary: Can be applied to sorted data only

• Linear: It's also called half-interval search

  Binary: It's also called sequential search

Suppose a list is {2, 9, 5, 4, 8, 1}. After the first phase of bubble sort, the list becomes …

• 2, 9, 5, 4, 8, 1

• 2, 9, 5, 4, 1, 8

• 2, 5, 9, 4, 8, 1

• 2, 5, 4, 8, 1, 9

Given a list is {7, 4, 5, 9, 8, 2, 1}. After the first phase of selection sort, the list becomes …

• 1,2,4,9,8,5,7

• 1,2,5,9,8,4,7

• 1,4,5,9,8,2,7

• 7,4,5,9,8,2,1

Define which of the following is NOT a sorting method.

• Quick

• Linear

• Bubble

• Insertion

Define which of the following is NOT a searching method.

• Binary

• Selection

• Linear