adplus-dvertising
frame-decoration

Question

Travelling salesman problem is an example of

a.

Dynamic Algorithm

b.

Greedy Algorithm

c.

Recursive Approach

d.

Divide & Conquer

Answer: (b).Greedy Algorithm

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Travelling salesman problem is an example of

Similar Questions

Discover Related MCQs

Q. Project scheduling is an example of

Q. Which of the following is an example of dynamic programming approach?

Q. Which of the following uses memoization?

Q. Which of the following asymptotic notation is the worst among all?

Q. Minimum number of moves required to solve a Tower of Hanoi puzzle is

Q. Program with highest run-time complexity is

Q. The time complexity of quick sort is …………..

Q. Two main measures for the efficiency of an algorithm are

Q. The time factor when determining the efficiency of algorithm is measured by

Q. The space factor when determining the efficiency of algorithm is measured by

Q. Which of the following case does not exist in complexity theory

Q. The complexity of the average case of an algorithm is

Q. The complexity of linear search algorithm is

Q. The complexity of Binary search algorithm is

Q. The complexity of Bubble sort algorithm is

Q. The complexity of merge sort algorithm is

Q. Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.

Q. The complexity of multiplying two matrices of order m*n and n*p is

Q. Merging 4 sorted files containing 50, 10, 25 and 15 records will take____time.

Q. An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of