1. : What is the primary goal of searching algorithms?
(A) To organize data
(B) To find a specific element within a dataset
(C) To sort data
(D) To compress data
2. : Which searching algorithm is used on sorted arrays?
(A) Linear Search
(B) Binary Search
(C) Jump Search
(D) Interpolation Search
3. : What is the time complexity of Linear Search in the worst case?
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) O(1)
4. : Which searching algorithm has a time complexity of O(log n)?
(A) Linear Search
(B) Jump Search
(C) Binary Search
(D) Exponential Search
5. : In which scenario is Binary Search the most efficient?
(A) Unsorted data
(B) Large datasets with a sorted array
(C) Small datasets
(D) Data with many duplicates
6. : What is the best-case time complexity of Binary Search?
(A) O(n)
(B) O(log n)
(C) O(1)
(D) O(n log n)
7. : Which searching algorithm is more efficient than Linear Search but requires sorted data?
(A) Linear Search
(B) Binary Search
(C) Interpolation Search
(D) All of the above
8. : What is the primary advantage of Jump Search over Linear Search?
(A) It requires less memory
(B) It is faster for large sorted arrays
(C) It is simpler to implement
(D) It works on unsorted data
9. : What is the time complexity of Interpolation Search in the average case?
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) O(1)
10. : Which searching algorithm works on both sorted and unsorted arrays?
(A) Linear Search
(B) Binary Search
(C) Jump Search
(D) Interpolation Search
11. : In what type of data is Exponential Search particularly useful?
(A) Random data
(B) Large sorted arrays
(C) Small datasets
(D) Unsorted data
12. : Which searching technique uses a midpoint to divide the dataset?
(A) Linear Search
(B) Binary Search
(C) Interpolation Search
(D) Jump Search
13. : What is the time complexity of Jump Search?
(A) O(n)
(B) O(log n)
(C) O(√n)
(D) O(n log n)
14. : Which searching algorithm is best suited for uniformly distributed data?
(A) Linear Search
(B) Jump Search
(C) Interpolation Search
(D) Binary Search
15. : In Binary Search, what is the process of narrowing down the search space called?
(A) Partitioning
(B) Traversing
(C) Splitting
(D) Halving
16. : Which searching algorithm does not require the data to be sorted?
(A) Binary Search
(B) Jump Search
(C) Linear Search
(D) Interpolation Search
17. : What is the worst-case time complexity of Interpolation Search?
(A) O(log n)
(B) O(n log n)
(C) O(n)
(D) O(1)
18. : Which searching algorithm is not effective for small datasets?
(A) Linear Search
(B) Binary Search
(C) Jump Search
(D) All are effective
19. : What type of search does a hash table use?
(A) Linear Search
(B) Binary Search
(C) Hashing Search
(D) Interpolation Search
20. : What is the main disadvantage of Binary Search?
(A) It requires sorted data
(B) It is slower than Linear Search
(C) It is complex to implement
(D) It requires extra memory
21. : In Linear Search, how many comparisons are needed in the worst case?
(A) n/2
(B) n
(C) log n
(D) 1
22. : What is the average case time complexity of Linear Search?
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)
23. : Which of the following searching methods is adaptive?
(A) Binary Search
(B) Jump Search
(C) Interpolation Search
(D) All of the above
24. : In Exponential Search, what does the algorithm first find?
(A) The target element
(B) The range where the target element may exist
(C) The maximum element
(D) The minimum element
25. : Which searching algorithm can be applied to linked lists?
(A) Linear Search
(B) Binary Search
(C) Jump Search
(D) All of the above
26. : What is the process of finding an element’s position in a sorted array called?
(A) Searching
(B) Sorting
(C) Indexing
(D) Partitioning
27. : What is the best scenario for using Jump Search?
(A) Large sorted arrays
(B) Small datasets
(C) Unsorted data
(D) Duplicate data
28. : Which of the following algorithms is best for real-time applications?
(A) Linear Search
(B) Binary Search
(C) Jump Search
(D) Hashing
29. : In which case does Interpolation Search outperform Binary Search?
(A) Small datasets
(B) Sorted and uniformly distributed datasets
(C) Large datasets
(D) Unsorted datasets
30. : What type of searching algorithm is Depth First Search (DFS)?
(A) Linear Search
(B) Tree/Graph Search
(C) Binary Search
(D) Hashing
31. : Which searching technique is the most efficient for finding an element in a large database?
(A) Linear Search
(B) Hashing
(C) Binary Search
(D) Jump Search
32. : Which of the following searches works by jumping ahead a fixed number of steps?
(A) Jump Search
(B) Linear Search
(C) Binary Search
(D) Interpolation Search
33. : What type of data structure is typically used in Binary Search?
(A) Array
(B) Linked List
(C) Tree
(D) Hash Table
34. : In which scenario is Binary Search not applicable?
(A) When data is sorted
(B) When data is unsorted
(C) For large datasets
(D) For small datasets
35. : What is the primary operation used in all searching algorithms?
(A) Comparing elements
(B) Sorting elements
(C) Dividing elements
(D) Merging elements
36. : What does a search algorithm return if the element is not found?
(A) The next element
(B) An error message
(C) A special value (like -1)
(D) Nothing