Which term refers to an algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights?
Difficulty: Hard
About this MCQ
This Hard Algorithms question asks: Which term refers to an algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights? The correct choice is A. Bellman-Ford 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. Bellman-Ford algorithm ✓
- B. Space complexity
Why not B: “Space complexity” does not fit this question. The answer is Bellman-Ford algorithm.
- C. Amortized analysis
Why not C: “Amortized analysis” does not fit this question. The answer is Bellman-Ford algorithm.
- D. Selection sort
Why not D: “Selection sort” does not fit this question. The answer is Bellman-Ford algorithm.
Correct answer
A. Bellman-Ford algorithm
Explanation
Bellman-Ford algorithm is the term that matches “Which term refers to an algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights” (option A). Option B (Space complexity) does not fit this question. Option C (Amortized analysis) does not fit this question. Option D (Selection sort) does not fit this question. For this Algorithms question, the accepted answer is Bellman-Ford algorithm.
Source: Algorithms Official Reference Guide
Tags: computer science, algorithms, problem solving, complexity analysis
Submitted by: MCQsHub Editorial
Related MCQs
- The following statement describes a specific concept. What is it called? a measure of the amount of memory an...
- What is the name for a greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by...
- What is Linear search primarily used for?
- Which of the following best describes Kruskal's algorithm?
- Which concept is defined as follows: a search algorithm that checks each element in a list sequentially until...
- Identify the correct concept described as: an ordering of vertices in a directed acyclic graph such that for e...