Quiz on Searching and Sorting Algorithms

Which of the following is the time complexity of Linear Search?

• O(1)

• O(log n)

• O(n)

• O(n²)

Which of the following is the best-case time complexity of Binary Search?

• O(1)

• O(n)

• O(log n)

• O(n²)

What is the requirement for performing Binary Search on a list?

• The list must be sorted

• The list must be unsorted

• The list should be a linked list

• None of the above

Which of the following is the primary disadvantage of Linear Search?

• It works on sorted data

• It has a worst-case time complexity of O(n)

• It requires additional space

• It is not efficient for small lists

What is the time complexity of Bubble Sort in the worst case?

• O(n)

• O(n log n)

• O(n²)

• O(1)

Which of the following best describes the operation of the Insertion Sort algorithm?

• It divides the array into two halves and recursively sorts each half

• It repeatedly selects the smallest element and places it at the end of the sorted part

• It repeatedly moves the unsorted element to its correct position in the sorted part

• It uses a divide-and-conquer strategy to sort the elements

Which sorting algorithm has the best average-case time complexity?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Quick Sort

In which scenario would Insertion Sort perform better than Merge Sort?

• When the array is already sorted or nearly sorted

• When the array contains very large numbers

• When the array contains few elements

• In both worst-case and best-case scenarios

Which of the following is a primary use of hashing?

• To search for an element in a sorted array

• To store key-value pairs in an efficient manner

• To sort a large dataset

• To find the maximum element in a collection

What happens when two keys in a hash table produce the same hash value?

• It is called a collision, and a technique like chaining or open addressing is used to resolve it

• The hash table automatically resizes

• The second key overwrites the first one

• The keys are sorted by their hash values