Searching Algorithms

Question 1

Which searching algorithm requires data to be sorted before starting?

Answer 1

Binary search

Question 2

Which example shows linear search?

Answer 2

C

Question 3

Perform a linear search for 9 on the values 1 3 6 7 9 12 15.

Answer 3

The linear search will find 9 at the 4th position in the array.

Question 4

What is the time complexity of binary search?

Answer 4

O(log n)

Question 5

Which example shows binary search?

Answer 5

B

Question 6

Perform a binary search for 6 on the values 1 3 6 7 9 12 15.

Answer 6

The binary search will find 6 at the 3rd position in the array.

Question 7

Which searching algorithm has a time complexity of O(n)?

Answer 7

Linear search.

Question 8

Front

Answer 8

Back

Question 9

Which searching algorithm requires data to be sorted before starting?

Answer 9

Binary search

Question 10

Which example shows linear search?

Answer 10

C

Question 11

Perform a linear search for 9 on the values 1 3 6 7 9 12 15.

Answer 11

The linear search will find 9 at the 4th position in the array.

Question 12

What is the time complexity of binary search?

Answer 12

O(log n)

Question 13

Which example shows binary search?

Answer 13

B

Question 14

Perform a binary search for 6 on the values 1 3 6 7 9 12 15.

Answer 14

The binary search will find 6 at the 3rd position in the array.

Question 15

Which searching algorithm has a time complexity of O(n)?

Answer 15

Linear search.