Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value?
Difficulty: Easy
About this MCQ
This Easy Algorithms MCQ checks one syllabus fact.
The question is: “Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value?”
The accepted answer is A. Binary search. Binary search is the person, body, or term that satisfies “Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value” (option A). Option B (“Greedy algorithm”) does not match the stem; it is a near-miss used to catch incomplete recall of Binary search. Option C (“Time complexity”) does not match the stem; it is a near-miss used to catch incomplete recall of Binary search. Remaining alternatives (Dynamic programming) fall outside the same rule and should be eliminated once Binary search is identified. Algorithms questions of this type reward precise definitions rather than approximate associations. Algorithms recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
- A. Binary search ✓
- B. Greedy algorithm
Why not B: “Greedy algorithm” is not correct. The accepted answer is A. Binary search. Binary search is the person, body, or term that satisfies “Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value” (option
- C. Time complexity
Why not C: “Time complexity” is not correct. The accepted answer is A. Binary search. Binary search is the person, body, or term that satisfies “Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value” (option
- D. Dynamic programming
Why not D: “Dynamic programming” is not correct. The accepted answer is A. Binary search. Binary search is the person, body, or term that satisfies “Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value” (option
Correct answer
A. Binary search
Explanation
Binary search is the person, body, or term that satisfies “Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value” (option A). Option B (“Greedy algorithm”) does not match the stem; it is a near-miss used to catch incomplete recall of Binary search. Option C (“Time complexity”) does not match the stem; it is a near-miss used to catch incomplete recall of Binary search. Remaining alternatives (Dynamic programming) fall outside the same rule and should be eliminated once Binary search is identified. Algorithms questions of this type reward precise definitions rather than approximate associations. Algorithms recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
Source: Algorithms Official Reference Guide
Tags: computer science, algorithms, problem solving, complexity analysis
Submitted by: MCQsHub Editorial
Related MCQs
- What is the name for a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wro...
- Which of the following best describes Bubble sort?
- Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts...
- Merge sort is best defined as which of the following?
- A divide-and-conquer sorting algorithm that partitions elements around a pivot value. What is this concept cal...
- Choose the correct description of Quick sort.