retagged by
3,156 views
1 votes
1 votes

Find the odd one out

  1. Merge Sort
  2. TVSP Problem
  3. Knapsack Problem
  4. OBST Problem
retagged by

4 Answers

2 votes
2 votes
Option A

Merge Sort – Divide and Conquer
Travelling Salesman Problem – Dynamic Programming
Knapsack Problem – Dynamic Programming
Optimal Binary Search Tree Problem – Dynamic Programming
1 votes
1 votes
option A )Merge Sort – Divide and Conquer approach , and all the rest are based on DP.
Answer:

Related questions

0 votes
0 votes
1 answer
1
admin asked Mar 31, 2020
1,833 views
What is the type of the algorithm used in solving the $4$ Queens problem?GreedyBranch and BoundDynamicBacktracking
1 votes
1 votes
4 answers
2
admin asked Mar 31, 2020
4,353 views
Selection sort, quick sort is a stable sorting methodTrue,TrueFalse,FalseTrue,FalseFalse,True
3 votes
3 votes
2 answers
3
admin asked Mar 31, 2020
3,877 views
Which of the following sorting procedures is the slowest?Quick SortMerge SortShell SortBubble Sort
5 votes
5 votes
2 answers
4
admin asked Mar 31, 2020
1,796 views
Complexity of Kruskal's algorithm for finding minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is:$O(mn)$$O(m)$$...