Question 1

A linear search

Accepted Answer

checks each element of the list for the target value, one at a time, from the beginning of the list.

Answer

checks each element of the list for the target value, one at a time,  from the end of the list.

Answer

checks each element of the list for the target value, one at a time, from the middle of the list.

Answer

checks each element of the list for the target value, two at a time, from the beginning of the list.

Question 2

A linear search only works on an ordered list.

Accepted Answer

False

Answer

True

Question 3

A binary search works on an ordered list.

Accepted Answer

True

Answer

False

Question 4

How many checks does it take to find 65 in the following list using a linear search?
2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101

Accepted Answer

9

Answer

3

Answer

11

Answer

10

Question 5

How many checks would it take to find 
65 in the following list using a 
binary search?
2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101

Accepted Answer

3

Answer

2

Answer

5

Answer

4

Question 6

How many checks would it take to find 
99 in the following list using a 
binary search?
2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101

Accepted Answer

7

Answer

8

Answer

6

Answer

5

Question 7

How many checks would it take to find 
24 in the following list using a
binary search?
2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101

Accepted Answer

5

Answer

3

Answer

2

Answer

4

Question 8

How many checks would it take to find 
101 in the following list using a 
linear search?
2, 24, 26, 30, 31, 35, 37, 40, 65, 99, 101

Accepted Answer

11

Answer

5

Answer

10

Answer

9

Question 9

A binary search

Accepted Answer

checks the midpoint element in an ordered list to see if it is equal to or higher than the search item.  If the search item is not equal to the midpoint element but is higher that the midpoint element then the midpoint element and all those lower are discarded  and the check is repeated on the remaining items until the item is found.

Answer

checks each element of the list for the target value one at a time from the middle of the list.

Answer

checks the midpoint element in an unordered list to see if it is equal to or higher than the search item.  If the search item is not equal to the midpoint element but is higher that the midpoint element then the midpoint element and all those lower are discarded  and the check is repeated on the remaining items until the item is found.

Answer

checks each element of the list for the target value one at a time from the beginning of the list.

Question 10

A binary search will work on any list.

Accepted Answer

False

Answer

True

Related quizzes

Related quizzes