Register

Recent questions tagged dynamic-programming

1 votes
1 answer
92
Greedy vs Dynamic
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution. Is the above statement correct?
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution.Is the above statement correct?
User Avatar
0 votes
1 answer
96
Knapsack problem
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) and weight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) andweight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
User Avatar
2 votes
2 answers
97
CLRS Divide-and-Conquer Strassens's algorithm
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can't find it's explanation anywhere?
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can...
User Avatar
5 votes
5 answers
98
Matrix Chain
Total no. of ways to perform matrix multiplication having 7 matrices is ? Total no. of ways to by which we could parenthesize 7 matrices is ? Does the above two questions are different or same ? Plz explain the answer.
Total no. of ways to perform matrix multiplication having 7 matrices is ?Total no. of ways to by which we could parenthesize 7 matrices is ?Does the above two questions ...
User Avatar
0 votes
0 answers
99
DYNAMIC PROGRAMMING
User Avatar
0 votes
0 answers
100
dynamic programming
User Avatar
0 votes
1 answer
103
dynamic programming
User Avatar
1 votes
2 answers
104
algorithm
fib(n) { if(n==0) return 0; if(n==1) return 1; return(fib(n-1) + fib(n-2)); } for fib(4) the number of function calls by dynamic programmming is 7 and without dynamic programming is 9? am i wrong...if so correct me
fib(n){if(n==0)return 0;if(n==1)return 1;return(fib(n-1) + fib(n-2));}for fib(4) the number of function calls by dynamic programmming is 7and without dynamic programming ...
User Avatar
1 votes
1 answer
105
algorithm
Number of ways we can perform matrix multiplication and number of ways a matrix can be parenthesized means the same?
Number of ways we can perform matrix multiplicationandnumber of ways a matrix can be parenthesized means the same?
User Avatar
1 votes
1 answer
106
algorithm
travelling salesman problem is based on a) dynamic programming b)greedy method c)recursive approach d)divide and conquer
travelling salesman problem is based ona) dynamic programmingb)greedy methodc)recursive approachd)divide and conquer
User Avatar
0 votes
1 answer
107
Syllabus Related
Are 'Longest Common Palindromic Subsequence' and 'Longest monotonically Increasing Subsequence' in Gate syllabus??
Are 'Longest Common Palindromic Subsequence' and 'Longest monotonically Increasing Subsequence' in Gate syllabus??
User Avatar
1 votes
1 answer
108
algorithm
is sum of subset problem is there in the gate cse syllabus ?
is sum of subset problem is there in the gate cse syllabus ?
User Avatar
0 votes
1 answer
111
coremen
what is difference between divide and conquer and dynamic programming?
what is difference between divide and conquer and dynamic programming?
User Avatar
2 votes
2 answers
112
Dynamic Programming
Find an optimal parenthesization of a matrix-chain product whose sequence of di-mensions <5,10,3,12,5,50,6>.
Find an optimal parenthesization of a matrix-chain product whose sequence of di-mensions<5,10,3,12,5,50,6>.
User Avatar
2 votes
1 answer
114
Self Framed
Whats the minimum number of multiplications required to compute $x^{7}$ * $x^{17}$ for any given integer value of 'x' ? A) 4 B) 5 C) 6 D) 7
Whats the minimum number of multiplications required to compute$x^{7}$ * $x^{17}$ for any given integer value of 'x' ?A) 4B) 5C) 6D) 7
User Avatar
1 votes
1 answer
116
time complexity
given a N-bit string. what is the time complexity to find out all subsets of that string which is parlindrome?
given a N-bit string.what is the time complexity to find out all subsets of that string which is parlindrome?
User Avatar
Page: