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?

Mr. Dubey • 52.30K Points
Coach

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?

(A) bfs

(B) dfs

(D) kruskal\s

Correct : Option (B)

Discusssion

Be the first to start discuss.

Q. Cloud ________ are standardized in order to appeal to the majority of its audience.

Q. Which of the following is/are White box technique?

Q. ………………… is a full form of SQL.

Q. Which layer is responsible for process-to-process delivery?

Q. Which of the following has the capability to store the information permanently?

Q. A digital system consists of types of circuits.

Q. Which of the following is not a procedural language

Q. What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?

Q. Tower of hanoi problem can be solved iteratively.

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?

Discusssion

Related MCQs