What is the name for a greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight?
Difficulty: Hard
About this MCQ
This Hard Algorithms question asks: What is the name for a greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight? The correct choice is A. Kruskal's 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. Kruskal's algorithm ✓
- B. Randomized algorithm
Why not B: “Randomized algorithm” does not fit this question. The answer is Kruskal's algorithm.
- C. Sorting stability
Why not C: “Sorting stability” does not fit this question. The answer is Kruskal's algorithm.
- D. Selection sort
Why not D: “Selection sort” does not fit this question. The answer is Kruskal's algorithm.
Correct answer
A. Kruskal's algorithm
Explanation
Kruskal's algorithm is the value that answers “What is the name for a greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight” (option A). Option B (Randomized algorithm) does not fit this question. Option C (Sorting stability) does not fit this question. Option D (Selection sort) does not fit this question. For this Algorithms question, the accepted answer is Kruskal's algorithm.
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 that computes shortest paths from a single source vertex in a graph, even wi...
- Identify the correct concept described as: an ordering of vertices in a directed acyclic graph such that for e...
- Select the accurate description of Space complexity.
- Topological sort is best defined as which of the following?
- The following statement describes a specific concept. What is it called? a measure of the amount of memory an...
- A method of analyzing algorithms that determines the average time or space cost over a sequence of operations....