M

Mr. Dubey • 100.69K Points
Coach

Q. The is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.

  • (A) finding shortest path between a source and a destination
  • (B) travelling salesman problem
  • (C) map coloring problem
  • (D) depth first search traversal on a given map represented as a graph
Share
Explanation by: Mr. Dubey
refer the tsp problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The PROM starts out with

Q. A product detector in AM systems is also called

Q. Mutual exclusion implies that

Q. Which of the following is the fastest logic

Q. Min-terms of two statements are formed by introducing the connective _________.

Q. The RISC processor has a more complicated design than CISC.

Q. Describes the discovery of useful information from the web contents.

Q. Instructions which can handle any type of addressing mode are said to be

Q. Which command is used to move all files to the bin sub-directory of the parent directory?

Q. Which of the following strategies does the following diagram depict?

Question analytics