Finally 1

A large number of genetic codes are stored as binary values in a list. Which one of the following conditions must be true in order for a researcher to obtain the correct result when using a binary search algorithm to determine if a given genetic code is in the list?

• The genetic codes must be converted from binary to decimal numbers.

• 
  The list must be sorted based on the genetic code values.

• The number of genetic code values in the list must be a power of 2.

• The number of genetic code values in the list must be even.

The procedure BinarySearch (numList, target) correctly implements a binary search algorithm on the list of numbers numList. The procedure returns an index where target occurs in numList, or -1 if target does not occur in numList. Which of the following conditions must be met in order for the procedure to work as intended?

Responses

• 
  The length of numList must be even.

• The list numList must not contain any duplicate values.

• 
  The values in numList must be in sorted order.

• The value of target must not be equal to -1.

A programmer is deciding between using a linear or binary search to find a target value in a sorted list. Which of the following is true?

Responses

• In all cases, a binary search of a sorted list requires fewer comparisons than a linear search.

• Generally, the advantage of using a binary search over a linear search increases as the size of the list increases.

• 
  A linear search will generally run faster than a binary search because a linear search requires fewer lines of code to implement.

• 
  Using a linear search is preferable to using a binary search if there is a chance that the target may not be found in the list.

The list listOne is a sorted list of numbers that contains 700 elements. The list listTwo is a sorted list of numbers that contains 900 elements. Let x represent the maximum number of list elements that will need to be examined when performing a binary search for a value in listOne, and let y represent the maximum number of list elements that will need to be examined when performing a binary search for a value in listTwo. Which of the following statements about x and y is true?

• The value of x is approximately equal to the value of y.

• 
  The value of x is approximately 10 less than the value of y.

• The value of x is approximately 13 less than the value of y.

• The value of x is approximately 200 less than the value of y.

A sorted list of numbers contains 500 elements. Which of the following is closest to the maximum number of list elements that will be examined when performing a binary search for a value in the list?

• 
  10

• 
  50

• 
  250

• 
  500

Consider the following program, which is intended to display the number of times a number target appears in a list.

Which of the following best describes the behavior of the program?

• The program correctly displays the number of times target appears in the list.

• The program does not work as intended when target does not appear in the list.

• The program does not work as intended when target appears in the list more than once.

• 
  The program does not work as intended when target appears as the last element of the list.

For which of the following lists can a binary search be used to search for an item in the list?

1. ["blue", "green", "jade", "mauve", "pink"]

2. [5, 5, 5, 5, 6, 7, 8, 8, 8]

3. [10, 5, 3, 2, -4, -8, -9, -12]

• 
  I only

• 
  III only

• I and III only

• 
  I, II, and III

A time stamp indicates the date and time that a measurement was taken. A data scientist has a list containing 10,000 time stamps, sorted in chronological order. Which of the following is closest to the maximum number of values that will need to be examined when performing a binary search for a value in the list?

• 
  10

• 
  15

• 5,000

• 10,000

A sorted list of numbers contains 128 elements. Which of the following is closest to the maximum number of list elements that can be examined when performing a binary search for a value in the list?

• 2

• 
  8

• 64

• 128

A sorted list of numbers contains 200 elements. Which of the following is closest to the maximum number of list elements that will need to be examined when performing a binary search for a particular value in the list?

Responses

• 5

• 
  8

• 100

• 200