edited by
1,233 views

2 Answers

2 votes
2 votes
Ans C)Backtracking
0 votes
0 votes

greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage[1] with the hope of finding a global optimum.  reference -https://en.wikipedia.org/wiki/Greedy_algorithm

dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions

Backtracking Algorithm
Create an empty path array and add vertex 0 to it. Add other vertices, starting from the vertex 1. Before adding a vertex, check for whether it is adjacent to the previously added vertex and not already added. If we find such a vertex, we add the vertex as part of the solution. If we do not find a vertex then we return false

Branch and bound is an algorithm design paradigm which is generally used for solving combinatorial optimization problems

So Hamiltonian related with Backtracking

Answer:

Related questions

26 votes
26 votes
4 answers
1
makhdoom ghaya asked Feb 12, 2015
5,507 views
Match the following:$$\begin{array}{|ll|ll|}\hline \text{P.} & \text{Prim's algorithm for minimum spanning tree} & \text{i.} & \text{Backtracking} \\\hline \text{Q.}...
21 votes
21 votes
3 answers
2
Kathleen asked Sep 29, 2014
4,970 views
The correct matching for the following pairs is$$\begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \...
2 votes
2 votes
2 answers
3
admin asked Mar 31, 2020
8,491 views
The Knapsack problem belongs to which domain of problems?OptimizationNP completeLinear SolutionSorting
0 votes
0 votes
1 answer
4
go_editor asked Mar 27, 2020
2,318 views
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming