Select the correct name for: a graph traversal algorithm that explores as far as possible along each branch before backtracking.

Difficulty: Medium

About this MCQ

This Medium Algorithms MCQ checks one syllabus fact.

The question is: “Select the correct name for: a graph traversal algorithm that explores as far as possible along each branch before backtracking.”

The accepted answer is B. Depth-first search (DFS). Depth-first search (DFS) refers to a graph traversal algorithm that explores as far as possible along each branch before backtracking.

A. Bubble sort
Why not A: “Bubble sort” is not correct. The accepted answer is B. Depth-first search (DFS). Depth-first search (DFS) refers to a graph traversal algorithm that explores as far as possible along each branch before backtracking.
B. Depth-first search (DFS) ✓
C. Quick sort
Why not C: “Quick sort” is not correct. The accepted answer is B. Depth-first search (DFS). Depth-first search (DFS) refers to a graph traversal algorithm that explores as far as possible along each branch before backtracking.
D. Divide and conquer
Why not D: “Divide and conquer” is not correct. The accepted answer is B. Depth-first search (DFS). Depth-first search (DFS) refers to a graph traversal algorithm that explores as far as possible along each branch before backtracking.

Correct answer

B. Depth-first search (DFS)

Explanation

Depth-first search (DFS) refers to a graph traversal algorithm that explores as far as possible along each branch before backtracking.

Source: Algorithms Official Reference Guide

Tags: computer science, algorithms, problem solving, complexity analysis

Submitted by: MCQsHub Editorial

Related MCQs

More Algorithms MCQs