Register

MadeEasy Test Series : Algorithms - Dynamic Programming

• edited by
658 views
0 0 votes
Which of the following procedure is suitable to find longest path from given vertex to any other vertex in Directed Acyclic Graph?

Answer: Dynamic Programming.

Why Greedy Algorithm cant be applied here?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · #Self doubt RosenNext → · Language DCFL?
← Previous in category · Merge SortNext in category → · Algorithm Back Edges
Position:
Show:

Related questions

0 0 votes
0 0 answers
995
995 views
adityaaswal asked Nov 30, 2018
995 views
MadeEasy Subject Test 2019: Algorithms - Dynamic Programming
Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)
3 3 votes
2 answers 2 answers
3.2k
3.2k views
talha hashim asked Aug 1, 2018
3,248 views
MadeEasy Test Series: Algorithms - Dynamic Programming
Consider two strings A = “abbaccda” and B = “abcaa” consider "x"be length of the longest common subsequence between A and B and “y” be the number of distinct such longest...
1 1 vote
1 answers 1 answer
1.8k
1.8k views
Ayesha_S asked Jun 2, 2018
1,844 views
MadeEasy Test Series: Algorithms - Dynamic Programming
Consider two Person (Person X, Person Y). Person X who was given a problem to calculate A1 × A2 × A3 with dimension 3 × 100, 100 × 2 and 2 × 2 in minimum multiplication. ...
2 2 votes
1 1 answer
2.9k
2.9k views
Sumaiya23 asked Jan 29, 2018
2,885 views
MadeEasy Test Series 2018: Algorithms - Dynamic Programming
The number of balance parenthesis possible with 5-pairs of parenthesis _________. [ Assume ( ) and (( )) is balance parenthesis but not ) ( ]