What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints?
Difficulty: Hard
About this MCQ
This Hard Algorithms MCQ checks one syllabus fact.
The question is: “What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints?”
The accepted answer is D. Backtracking. Backtracking is the fact required by “What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints” (option D). Option A (“Dijkstra's algorithm”) does not match the stem; it is a near-miss used to catch incomplete recall of Backtracking. Option B (“Bubble sort”) does not match the stem; it is a near-miss used to catch incomplete recall of Backtracking. Remaining alternatives (Depth-first search (DFS)) fall outside the same rule and should be eliminated once Backtracking 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. Dijkstra's algorithm
Why not A: “Dijkstra's algorithm” is not correct. The accepted answer is D. Backtracking. Backtracking is the fact required by “What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints” (option
- B. Bubble sort
Why not B: “Bubble sort” is not correct. The accepted answer is D. Backtracking. Backtracking is the fact required by “What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints” (option
- C. Depth-first search (DFS)
Why not C: “Depth-first search (DFS)” is not correct. The accepted answer is D. Backtracking. Backtracking is the fact required by “What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints” (option
- D. Backtracking ✓
Correct answer
D. Backtracking
Explanation
Backtracking is the fact required by “What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints” (option D). Option A (“Dijkstra's algorithm”) does not match the stem; it is a near-miss used to catch incomplete recall of Backtracking. Option B (“Bubble sort”) does not match the stem; it is a near-miss used to catch incomplete recall of Backtracking. Remaining alternatives (Depth-first search (DFS)) fall outside the same rule and should be eliminated once Backtracking 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
- Which term refers to an algorithm design paradigm that breaks a problem into smaller subproblems, solves them,...
- Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a func...
- Select the accurate description of Dijkstra's algorithm.
- The following statement describes a specific concept. What is it called? an algorithm that finds the shortest...
- What is Breadth-first search (BFS) primarily used for?
- Which concept is defined as follows: a graph traversal algorithm that explores all neighbors at the current de...