• edited by
31 views
0 0 votes

Which of the following is the every-case time complexity of dynamic programming algorithm for "traversing salesperson" problem to traverse ' $n$ ' cities?

  1. $\Theta\left(\log n 2^{n}\right)$
  2. $\Theta\left(n 2^{n}\right)$
  3. $\Theta\left(2^{n}\right)$
  4. $\Theta\left(n^{2} 2^{n}\right)$

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
52
52 views
Shubham Sharma 2 asked Jun 28
52 views
Which of the following statements is TRUE?The cardinality ratio for a binary relationship specifies the maximum number of relationship instances that an entity can partic...
0 0 votes
0 0 answers
43
43 views
Shubham Sharma 2 asked Jun 28
43 views
Which of the following represents the function of a Multiplexer?$\mathrm{Y}=\mathrm{A}+\mathrm{B}$$\mathrm{Y}=\mathrm{A} \mid \mathrm{B}$$\mathrm{Y}=\mathrm{A} ~\& ~\text...
0 0 votes
0 0 answers
36
36 views
Shubham Sharma 2 asked Jun 28
36 views
The prefix equivalent of the following infix expression is:$a / b-c+d^{*} e-a ^{*}c$$-+-/ a b a^{*} d e^{*} a c$$+ / a b c^{*} d e^{*} a c$$-+/ a b c-^{*} d e^{*} a c$$ +...
0 0 votes
0 0 answers
39
39 views
Shubham Sharma 2 asked Jun 28
39 views
Which of the following file-type arguments is used in fopen $()$ library function to open a new file for both reading and writing, and destroys the file if a file with th...