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?

Related MCQs

• The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as                       .
• to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
• every node on the linear array has the data and broadcast on the columns with the linear array algorithm in _____
• In the scatter operation ____ node send message to every other node
• In which of the following operation, a single node sends a unique message of size m to every other node?
• Consider the example of a fire- hose. If the water comes out of the hose five seconds after the hydrant is turned on. Once the water starts flowing, if the hydrant delivers water at the rate of 15 gallons/second. Analyze the bandwidth and latency.
• In most of the cases, topological sort starts from a node which has __________
• All-to-All Broadcast and Reduction algorithm on a Ring terminates in                   steps.
• using different links every time and forwarding in parallel again is
• Multiprocessor is systems with multiple CPUs, which are capable of independently executing different tasks in parallel. In this category every processor and memory module has similar access time?