Big Idea Part 3

What is a binary search algorithm primarily used for?

• To add elements to a list

• To halve the number of elements that need to be searched after every comparison

• To sort a list

• To double the number of elements in a search

What is a necessary condition for a list to be searched using a binary search?

• The list must contain only positive numbers

• The list must be in random order

• The list must be sorted

• The list must have an even number of elements

What happens to the part of the list where the target value cannot lie in a binary search?

• It is sorted again

• It is doubled in size

• It is eliminated

• It is searched again

What is the first step in a binary search to find the number 300?

• Compare the first element of the list.

• Compare the last element of the list.

• Compare the middle element of the list.

• Remove the right side of the list.

What do you do if the middle element is not equal to the target and the target cannot be on the left side of the list?

• Remove the right side of the list.

• Remove the left side of the list.

• Compare the first element of the list.

• End the search as the target is not present.

What should you do if the middle element is not equal to the target during a binary search?

• Throw out the left side of the list.

• Throw out the right side of the list.

• Add more elements to the list.

• Repeat the comparison with the same middle element.

What is step 3 in the process?

• Option A

• Option B

• Option C

• Option D

What is the first step in the Program Design process according to the diagram?

• Maintaining

• Implementing

• Designing

• Testing

Which step in the Program Design process directly follows Implementing?

• Designing

• Testing

• Debugging

• Maintaining

What is the final step in the Program Design process as shown in the diagram?

• Implementing

• Designing

• Debugging

• Maintaining