Menu

Question Discussion & Solution

MCQ
Q.
A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
What can be the applications of Depth First Search?
forum Discussion
MCQ
2.
Which of the following algorithms solves the all-pair shortest path problem?
forum Discussion
MCQ
3.
How many edges are there in a Hamiltonian cycle if the edge cost is
forum Discussion
MCQ
4.
Which of the following ways can be used to represent a graph?
forum Discussion
MCQ
5.
The number of edges in a regular graph of degree d and n vertices is
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
Practice arrow_forward
article

Abstract data types

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Arrays

format_list_bulleted 134 MCQs
Practice arrow_forward
article

Lists

format_list_bulleted 166 MCQs
Practice arrow_forward
article

Stacks

format_list_bulleted 165 MCQs
Practice arrow_forward
article

Queues

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Trees

format_list_bulleted 133 MCQs
Practice arrow_forward
article

Binary Trees

format_list_bulleted 120 MCQs
Practice arrow_forward
article

B Trees

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Heaps

format_list_bulleted 36 MCQs
Practice arrow_forward
article

Hash based structures

format_list_bulleted 7 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 157 MCQs
Practice arrow_forward
article

Mixed

format_list_bulleted 10 MCQs
Practice arrow_forward