Register

NIELIT 2017 July Scientist B (CS) - Section B: 39

• retagged by
6,243 views
0 votes
0 votes

Which of the following standard algorithms is not Dynamic Programming based?

  1. Bellman-Ford Algorithm for single source shortest path
  2. Floyd Warshall Algorithm for all pairs shortest paths
  3. $0-1$ Knapsack problem
  4. Prim’s Minimum Spanning Tree
• retagged by
User Avatar

3 Answers

0 votes
0 votes
Prim's MST is greedy algorithm. Rest are standard dynamic programming algorithm.

So D is correct.
User Avatar
0 votes
0 votes
Option D) Prims Algorithm , which is a greedy algorithm.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
2 answers
2
admin asked Mar 30, 2020
6,568 views
NIELIT 2017 July Scientist B (CS) - Section B: 7
A balance factor in AVL tree is used to check what rotation to make if all child nodes are at same level when the last rotation occurred if the tree is unbalanced
A balance factor in AVL tree is used to checkwhat rotation to makeif all child nodes are at same levelwhen the last rotation occurredif the tree is unbalanced
User Avatar
0 votes
0 votes
2 answers
4
admin asked Mar 30, 2020
1,520 views
NIELIT 2017 July Scientist B (CS) - Section B: 42
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjacency matrix? $O(n)$ $O(m+n)$ $O(n^2)$ $O(mn)$
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjace...
User Avatar
Link Copied!