The concept in which an algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum is best known as which of these terms?
Difficulty: Medium
About this MCQ
This Medium Algorithms question asks: The concept in which an algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum is best known as which of these terms? The correct choice is D. Greedy algorithm. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Algorithms items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Algorithms so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Algorithms item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Depth-first search (DFS)
Why not A: “Depth-first search (DFS)” does not fit this question. The answer is Greedy algorithm.
- B. Breadth-first search (BFS)
Why not B: “Breadth-first search (BFS)” does not fit this question. The answer is Greedy algorithm.
- C. Bubble sort
Why not C: “Bubble sort” does not fit this question. The answer is Greedy algorithm.
- D. Greedy algorithm ✓
Correct answer
D. Greedy algorithm
Explanation
Greedy algorithm (option D) is the accepted answer to “The concept in which an algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum is best known as which of these terms”. Option A (Depth-first search (DFS)) does not fit this question. Option B (Breadth-first search (BFS)) does not fit this question. Option C (Bubble sort) does not fit this question. For this Algorithms question, the accepted answer is Greedy algorithm.
Source: Algorithms Official Reference Guide
Tags: computer science, algorithms, problem solving, complexity analysis
Submitted by: MCQsHub Editorial
Related MCQs
- Which of the following best names the concept in which an algorithmic technique that solves problems by breaki...
- What term describes the following? a mathematical notation used to describe the upper bound of an algorithm's...
- Choose the correct description of Quick sort.
- In computer science, Big O notation refers to which of the following?
- A divide-and-conquer sorting algorithm that partitions elements around a pivot value. What is this concept cal...
- Select the correct name for: a graph traversal algorithm that explores as far as possible along each branch be...