2.1 Algorithms - Linear Search

Question 1

What is a searching algorithm?

Answer 1

A searching algorithm is an algorithm that is used to search data in a list.

Question 2

How does a linear search algorithm work?

Answer 2

The search begins with the first item and checks whether a match is found, then it moves to the second item, and so on. This search continues until a match is found or the end of the list is reached with no match found.

Question 3

What is the pseudocode for a while loop in linear search algorithms?

Answer 3

while (position<len and list[position]!= item)
position = position + 1
endwhile

Question 4

What is the pseudocode for if…else… statement in a linear search algorithm?

Answer 4

if position> len then
print (“item not found”)
else
print (“item found at position ” position)
endif

Question 5

Assume that there is a list of 7 elements. The search element is at position 4. How many times is the while loop executed?

Answer 5

5 times (value of position starts from 0)

Question 6

Assume that there is a list of 7 elements. The search element is at position 4. How many times is the if…else… statement executed?

Answer 6

Only once

Question 7

Assume that there is a list of 10 elements. The search element is not in list. How many times is the while loop executed?

Answer 7

10 times

Question 8

Assume that there is a list of 10 elements. The search element is not in list. How many times is the if…else… statement executed?

Answer 8

Only once