searching quiz

Which of the following is a search algorithm?

• Sorting

• Merging

• Binary search

• Hashing

Which of the following is a disadvantage of sequential search?

• It is faster than binary search

• It requires the data to be sorted

• It is not suitable for large datasets

• It always finds the target element

Which of the following is a requirement for binary search?

• The data must be sorted

• The data must be unsorted

• The data must be in a linked list

• The data must be in a hash table

What is the time complexity of binary search?

• O(n)

• O(log n)

• O(n^2)

• O(1)

Which of the following is a disadvantage of interpolation search?

• It requires the data to be sorted

• It is not suitable for large datasets

• It always finds the target element

• It is slower than binary search

When should you use a binary search?

• When the data is sorted and in an array

• When the data is unsorted and in an array

• When the data is sorted and in a linked chain

• When the data is unsorted and in a linked chain

What method must objects have to be used in a binary search?

• equals

• compareTo

• contains

• sort

Which of the following is a disadvantage of interpolation search?

• It requires the data to be sorted

• It is not suitable for large datasets

• It always finds the target element

• It is slower than binary search

What is the time complexity of an iterative sequential search of an unsorted chain?

• O(1)

• O(n

• O(log n)

• O(n^2)

What is the purpose of an iterative sequential search of an unsorted chain?

• To sort the chain

• To search for a specific element in the chain

• To delete an element from the chain

• To insert an element into the chain