Match the following:
|
1. Dijkstra’s shortest path algorithm |
a. Greedy Algorithm |
|
2. Traveling Salesman Problem |
b. Dynamic Programming |
|
3. N Queen Problem |
c. Backtracking Algorithm |
1
1-a, 2-b, 3-c
2
1-b, 2-c, 3-c
3
1-a, 2-c, 3-b
4
1-b, 2-b, 3-b
5
1-b, 2-a, 3-c