Register

Recent questions tagged dynamic-programming

0 votes
1 answer
61
DYNAMIC PROGRAMMING [self doubts]
how to form The minimum number of scalar multiplications to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method
how to form The minimum number of scalar multiplications to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method
User Avatar
0 votes
0 answers
63
Backtracking part of Algo
Is Backtracking Branch and Bound part of Gate syllabus?
Is Backtracking Branch and Bound part of Gate syllabus?
User Avatar
0 votes
0 answers
64
homework
I need to find the tight bound of the Fibonacci sequence in dynamic programming (using theta). I only know the bound using big O is O(n). Any idea how to do it?
I need to find the tight bound of the Fibonacci sequence in dynamic programming (using theta). I only know the bound using big O is O(n). Any idea how to do it?
User Avatar
0 votes
1 answer
66
#self doubt #Lcs
How many distinct function calls are there in LCS(m,n)=. How to calculate it?
How many distinct function calls are there in LCS(m,n)=. How to calculate it?
User Avatar
1 votes
0 answers
67
Ace Test Series: Algorithms - Dynamic Programming OBST
Consider an OBST with n=4, p[1..4]={3,3,1,1} q[0..4]={2,3,1,1,1} Cost of OBST=___? Pls give the solution for this question.
Consider an OBST with n=4,p[1..4]={3,3,1,1} q[0..4]={2,3,1,1,1}Cost of OBST=___?Pls give the solution for this question.
User Avatar
1 votes
0 answers
68
Dynamic Programming Preparation for Gate
How to prepare for Dynamic Programming topic in DAA for GATE exam?
How to prepare for Dynamic Programming topic in DAA for GATE exam?
User Avatar
0 votes
1 answer
70
#Matrix
What do you suggest to do about big matrix multiplications questions in dynamic programming,because they take long time to get solved.Should we solve those questions in gate or we should leave them?I need advice on this.Please help me ou
What do you suggest to do about big matrix multiplications questions in dynamic programming,because they take long time to get solved.Should we solve those questions in g...
User Avatar
1 votes
1 answer
71
Dynamic Programming(Cormen)
Why we need to do top-down and bottom-up these 2 approach in dynamic programming? I know bottom-up has better overhead. Then why not bottom up used everywhere? Both have time complexity $O(n^{2})$ right? Plz analysis these two algo for more clearity top-down bottom-up
Why we need to do top-down and bottom-up these 2 approach in dynamic programming? I know bottom-up has better overhead. Then why not bottom up used everywhere? Both have ...
User Avatar
0 votes
0 answers
72
self-doubt
While solving the problem of longest match subsequence we use the concept of dynamic programming which further uses tabulation. For given 2 strings we can create a table using 2D matrix but how we'll draw the same table for 3 or more number of strings?
While solving the problem of longest match subsequence we use the concept of dynamic programming which further uses tabulation. For given 2 strings we can create a table ...
User Avatar
0 votes
1 answer
74
Dynamic programming
Given a sequence of n real numbers a1,a2,a3...an then to find contiguous subsequence ai,ai+1,ai+2....aj. Such that it's sum is maximum. How much time the above problem will take if you use dynamic programming?
Given a sequence of n real numbers a1,a2,a3...an then to find contiguous subsequence ai,ai+1,ai+2....aj. Such that it's sum is maximum. How much time the above problem wi...
User Avatar
1 votes
1 answer
78
Gate 2018
This is another form of gate 2018 matrix-chain question
This is another form of gate 2018 matrix-chain question
User Avatar
3 votes
2 answers
79
#Algorithms Time Complexity Analysis of Multistage Graph using Bottom Up Dynamic Programming
Time complexity of Multistage Graph is O(n2) or O(V2) but then some people says it's O(E). So, from O(V2) to O(E) are they taking about dense/complete graphs in which number of edges |E| = |V2|? Kindly help!
Time complexity of Multistage Graph is O(n2) or O(V2) but then some people says it's O(E). So, from O(V2) to O(E) are they taking about dense/complete graphs in which num...
User Avatar
0 votes
0 answers
81
Recursion Tree
What is the max height of recursion tree of recurrence $c(100,50)$? here, the recursive function is defined as $c(n,k) = c(n-1,k-1) + c(n,k-1)$ terminating condition $c(n,n) = 1, c(n,0) = 1$.
What is the max height of recursion tree of recurrence $c(100,50)$?here, the recursive function is defined as$c(n,k) = c(n-1,k-1) + c(n,k-1)$terminating condition$c(n,n) ...
User Avatar
2 votes
1 answer
85
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 ) ( ]
The number of balance parenthesis possible with 5-pairs of parenthesis _________. [ Assume ( ) and (( )) is balance parenthesis but not ) ( ]
User Avatar
Page: