Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged dynamic-programming
0
votes
0
answers
1
TestBook testSeries dynamic programming and np problem question
Consider the following statements, which of the statement(s) is/are FALSE? The running time of dynamic programming algorithm is always θ (p) where p is number of subproblems When a recurrence relation has cyclic dependency, it is ... memorization If a problem X can be reduced to a known NP hard problem, then X must be NP-hard
Consider the following statements, which of the statement(s) is/are FALSE?The running time of dynamic programming algorithm is always θ (p) where p is number of subprobl...
Sahil_Lather
349
views
Sahil_Lather
asked
Jan 28, 2023
Algorithms
algorithms
dynamic-programming
testbook-test-series
+
–
1
votes
1
answer
2
TestBook testSeries board game question
Consider a board game in consist of m n grid. A coin is located at the top-left corner of an m n grid. The coin can only move either down or right at any point in time. The ultimate goal of the game places the coin at the bottom-right corner of the grid. ... path(m-1, n) + path(m, n-1); } Find the number of unique paths if grid order is 5 4. 38 25 35 28
Consider a board game in consist of m × n grid. A coin is located at the top-left corner of an m × n grid. The coin can only move either down or right at any point in t...
Sahil_Lather
365
views
Sahil_Lather
asked
Jan 28, 2023
Programming in C
data-structures
programming-in-c
dynamic-programming
+
–
0
votes
0
answers
3
ACE Academy Test Series q #11 || Travelling Salesman
Souvik33
474
views
Souvik33
asked
Oct 30, 2022
Algorithms
dynamic-programming
graph-algorithm
ace-test-series
+
–
1
votes
2
answers
4
made easy test series
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will store f(11) in stack. But if we call f(12) we wont be able to store it as overflow will occur.
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will...
Neelu Lalchandani
569
views
Neelu Lalchandani
asked
Sep 30, 2022
Algorithms
made-easy-test-series
stack
algorithms
dynamic-programming
+
–
0
votes
1
answer
5
Dynamic Programming
int max(int a, int b) { return (a > b) ? a : b; } // Returns the maximum value that can be // put in a knapsack of capacity W int knapSack(int W, int wt[], int val[], int n) { // Base Case if (n == 0 || W == 0) return 0; // If ... , wt, val, n - 1), knapSack(W, wt, val, n - 1)); } This statement implies that the max value return by the two different recursive problems right?
int max(int a, int b) { return (a b) ? a : b; }// Returns the maximum value that can be// put in a knapsack of capacity Wint knapSack(int W, int wt[], int val[], int n){...
ryandany07
800
views
ryandany07
asked
Aug 18, 2022
Algorithms
algorithms
dynamic-programming
knapsack-problem
+
–
0
votes
0
answers
6
Best Open Video Playlist for Algorithm design techniques: Dynamic programming Topic | Algorithm
Please list out the best free available video playlist for Algorithm design techniques: Dynamic programming from Algorithm as an answer here (only one playlist per answer). We'll then select the best ... more likely to be selected as best. For the full list of selected videos please see here
Please list out the best free available video playlist for Algorithm design techniques: Dynamic programming from Algorithm as an answer here (only one playlist per answer...
makhdoom ghaya
298
views
makhdoom ghaya
asked
Aug 17, 2022
Study Resources
go-classroom
video-links
missing-videos
free-videos
dynamic-programming
+
–
Page:
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register