Multiple Choice Questions: Linear Search vs. Binary Search in Java

📚 Quick Study Guide

• 🔍 Linear Search: Checks each element of a list sequentially until the target element is found or the end of the list is reached.
• ⏱️ Linear Search Time Complexity: Worst-case and Average-case: O(n), Best-case: O(1).
• 🗂️ Binary Search: Requires the list to be sorted. It repeatedly divides the search interval in half.
• ➗ Binary Search Core Logic:
  1. Find the middle element of the sorted array.
  2. Compare the middle element with the target value.
  3. If the target value is less than the middle element, continue the search in the left half.
  4. If the target value is greater than the middle element, continue the search in the right half.
  5. Repeat until the target value is found or the search space is empty.
• ⏱️ Binary Search Time Complexity: Worst-case and Average-case: O(log n), Best-case: O(1).
• 💡 Pre-requisite for Binary Search: Sorted array.

🧪 Practice Quiz

1. Question 1: What is the primary requirement for using Binary Search?
   1. A) The data must be stored in a linked list.
   2. B) The data must be sorted.
   3. C) The data must be integers.
   4. D) The data must be unique.
2. Question 2: What is the worst-case time complexity of Linear Search?
   1. A) O(1)
   2. B) O(log n)
   3. C) O(n)
   4. D) O(n^2)
3. Question 3: What is the worst-case time complexity of Binary Search?
   1. A) O(1)
   2. B) O(log n)
   3. C) O(n)
   4. D) O(n^2)
4. Question 4: In what scenario is Linear Search more efficient than Binary Search?
   1. A) When the data is sorted.
   2. B) When the data is unsorted and the target element is the first element.
   3. C) When the data is a large dataset.
   4. D) Linear Search is never more efficient.
5. Question 5: Which search algorithm divides the search interval in half with each step?
   1. A) Linear Search
   2. B) Binary Search
   3. C) Both Linear Search and Binary Search
   4. D) Neither Linear Search nor Binary Search
6. Question 6: If you have a sorted array of 1024 elements, what is the maximum number of comparisons Binary Search would make in the worst case?
   1. A) 10
   2. B) 11
   3. C) 1024
   4. D) 512
7. Question 7: Which of the following is NOT an advantage of Binary Search over Linear Search?
   1. A) Faster search time for large datasets
   2. B) Simpler implementation
   3. C) More efficient use of comparisons
   4. D) Ability to handle sorted data more efficiently