The traveling salesman problem involves n cities with paths connecting – McqOptions

MCQOPTIONS

1.	The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is
A.	O(n)
B.	O(n2)
C.	O(n!)
D.	O(n/2)
Answer» D. O(n/2)

Discussion

No Comment Found

Related MCQs

Given below are two statements:Statement I: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained.Statement II: In nondeterministic environments, agents can apply AND-OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution.In the light of the above statements, choose the Correct answer from the options given below
Idempotency law isI. P Ú P = P.II. P Ù P = P.III. P + P = P.
Knowledge may beI. Declarative.II. Procedural.III. Non-procedural.
An algorithm A is admissible if
The Newell and Simon program that proved theorems of Principal Mathematical was:
ANOTHER_NAME_FOR_1-D_ARRAYS.?$
THE_OPERATION_OF_PROCESSING_EACH_ELEMENT_IN_THE_LIST_IS_KNOWN_AS?$
A_data_structure_that_follows_the_FIFO_principle.$
A system wherein items are added from one and removed from the other end?
List obtained in third pass of selection sort for list 3, 5, 4, 1, 2 is __________?