Linear Search Quiz

What is Linear Search?

• A method to find the minimum element in an array

• A method to find the maximum element in an array

• A method to sort elements in ascending order

• A method to find an element by checking each element one by one

In Linear Search, what happens if the element is not found?

• The search continues indefinitely

• The search stops and returns empty-handed

• The search returns the first element

• The search restarts from the beginning

Can Linear Search be used on ordered lists?

• Yes, it can be used on both ordered and unordered lists

• Yes, but only if the list is sorted in descending order

• No, it can only be used on unordered lists

• No, it can only be used on lists with unique elements

What is the worst-case scenario for Linear Search?

• Finding the element in the middle of the list

• Finding the element in the first position

• Not finding the element after checking all elements

• Finding the element in the last position

What is the best-case scenario for Linear Search?

• Finding the element in the middle of the list

• Finding the element in the last position

• Not finding the element after checking all elements

• Finding the element in the first position

How does Linear Search perform on an unordered list?

• It performs slower than on an ordered list

• It cannot be performed on an unordered list

• It performs the same as on an ordered list

• It performs faster than on an ordered list

What is the time complexity of Linear Search in the worst case?

• O(n)

• O(n^2)

• O(log n)

• O(1)

What is the time complexity of Linear Search in the best case?

• O(n^2)

• O(n)

• O(log n)

• O(1)

What is the main disadvantage of Linear Search?

• It is slow for large lists

• It requires the list to be sorted

• It is very complex to implement

• It can only be used on lists with unique elements

What is the main advantage of Linear Search?

• It is simple and easy to implement

• It can only be used on ordered lists

• It is very fast for large lists

• It requires the list to be sorted