Dark Mode

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

Sahil_Lather asked in Algorithms Jan 28

by Sahil_Lather

68 views

0 votes

0 answers

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

Sahil_Lather asked in Programming Jan 28

by Sahil_Lather

92 views

0 votes

0 answers

3

ACE Academy Test Series q #11 || Travelling Salesman

Souvik33 asked in Algorithms Oct 31, 2022

149 views

1 vote

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.

Neelu Lalchandani asked in Algorithms Sep 30, 2022

by Neelu Lalchandani

255 views

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?

ryandany07 asked in Algorithms Aug 18, 2022

265 views

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 playlist ... more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 18, 2022

by makhdoom ghaya

83 views

0 votes

1 answer

7

Recursive function
Consider the following recursive function which is used by dynamic programming. T(n) = { 0; if n<1 1; if n=1 T(n-1)+T(n-2)+1; if n>1} Assume for every function call T(i) it checks the table first , if it's value is already ... value of 'n' so that overflow cannot occur . ( Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)

Manisha Jaishwal asked in Programming Aug 6, 2022

by Manisha Jaishwal

269 views

1 vote

2 answers

8

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

gatecse asked in Compiler Design Dec 9, 2020

203 views

1 vote

1 answer

9

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)$

gatecse asked in Algorithms Dec 9, 2020

324 views

1 vote

1 answer

10

NIELIT Scientific Assistant A 2020 November: 105
Assembly line scheduling and Longest Common Subsequence problems are an example of _______. Dynamic Programming Greedy Algorithms Greedy Algorithms and Dynamic Programming respectively Dynamic Programming and Branch and Bound respectively

gatecse asked in Algorithms Dec 9, 2020

282 views

1 vote

4 answers

11

NIELIT 2016 DEC Scientist B (IT) - Section B: 52
Find the odd one out Merge Sort TVSP Problem Knapsack Problem OBST Problem

Lakshman Patel RJIT asked in Algorithms Mar 31, 2020

by Lakshman Patel RJIT

2.5k views

0 votes

3 answers

12

NIELIT 2017 July Scientist B (CS) - Section B: 39
Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree

Lakshman Patel RJIT asked in Algorithms Mar 30, 2020

by Lakshman Patel RJIT

4.6k views

Page:

1
2
3
4
5
next »

Recent questions tagged dynamic-programming