M

Mr. Dubey • 52.30K 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
Correct : Option (B)

Explanation: 
 refer the tsp problem.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?

Q. In the layer hierarchy as the data packet moves from the upper to the lower layers, headers are

Q. IKE uses _______

Q. Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not transitive.

Q. The simplification of the Boolean expression (A'BC')'+ (AB'C)' is

Q. In FSA ,the notation for M being in state S0, reading the input symbol a, moving one cell right and reaching the state S1 is given by ________.

Q. For each _______ the Kerberos Key Distribution Center (KDC) maintains a database of the realm’s principal and the principal’s associated &

Q. A command that lets you cange one or more fields in a record is

Q. To concatenate two strings to a third what statements are applicable?

Q. Which application feature is a world of warcraft gadget?