Register

Recent questions tagged dynamic-programming

1 votes
3 answers
33
NIELIT Scientific Assistant A 2020 November: 52
In case of the dynamic programming approach the value of an optimal solution is computed in : Top down fashion Bottom up fashion Left to Right fashion Right to Left fashion
In case of the dynamic programming approach the value of an optimal solution is computed in :Top down fashionBottom up fashionLeft to Right fashionRight to Left fashion
User Avatar
1 votes
1 answer
34
NIELIT Scientific Assistant A 2020 November: 64
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respectively? $O(n)$ $O(w)$ $O(nw)$ $O(n+w)$
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respecti...
User Avatar
0 votes
0 answers
41
self doubt *0/1 knapsack problem*
In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQUAL TO W OR IT CAN BE LESS THAN W AS WELL????
In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQ...
User Avatar
0 votes
2 answers
42
self doubt
What advantage does top down approch have over bottom up approach in case of dynamic programming??
What advantage does top down approch have over bottom up approach in case of dynamic programming??
User Avatar
0 votes
1 answer
43
self doubt
Can we solve fractional knapsack using dynamic programming?
Can we solve fractional knapsack using dynamic programming?
User Avatar
0 votes
1 answer
44
self doubt
For longest common subsequence the total number of subsequence possible for the word DIYA should be 2^4 or (2^4)-1??Please explain.
For longest common subsequence the total number of subsequence possible for the word DIYA should be 2^4 or (2^4)-1??Please explain.
User Avatar
2 votes
0 answers
49
Dynamic Programming basics
Can any one explain whats happening in side the green area due to dynamic programming ?
Can any one explain whats happening in side the green area due to dynamic programming ?
User Avatar
1 votes
1 answer
50
UGC NET CSE | December 2018 | Part 2 | Question: 23
Consider two sequences $X$ and $Y$ : $X=<0, 1, 2, 1, 3, 0, 1>$ $Y=<1, 3, 2, 0, 1, 0>$ The length of longest common subsequence between $X$ and $Y$ is $2$ $3$ $4$ $5$
Consider two sequences $X$ and $Y$ :$X=<0, 1, 2, 1, 3, 0, 1>$$Y=<1, 3, 2, 0, 1, 0>$The length of longest common subsequence between $X$ and $Y$ is$2$$3$$4$$5$
User Avatar
0 votes
1 answer
51
MadeEasyAlgo
Maximum profit using 0/1 Knapsack with W=200 is there any other than brute force method to solve this??? or we have to do only with tabular method?please solve and mention the way that is efficient w.r.t time if any.
Maximum profit using 0/1 Knapsack with W=200 is there any other than brute force method to solve this??? or we have to do only with tabular method?please solve and mentio...
User Avatar
2 votes
2 answers
52
self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
User Avatar
0 votes
1 answer
53
Dynamic Programming
What is the best way to solve a 0/1 knapsack problem? Any trick to solve it without wasting much time? Not How to
What is the best way to solve a 0/1 knapsack problem? Any trick to solve it without wasting much time?Not How to
User Avatar
0 votes
0 answers
54
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)
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)
User Avatar
0 votes
0 answers
55
MadeEasy Test Series : Algorithms - Dynamic Programming
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?
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 A...
User Avatar
0 votes
0 answers
56
general
how many terms will be computed to determine the value of 10C8 using divide and conquer strategy and dynamic programming? for divide and conquer ans is 89 how to compute please explain
how many terms will be computed to determine the value of 10C8 using divide and conquer strategy and dynamic programming?for divide and conquer ans is 89 how to compute p...
User Avatar
Page: