Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged dynamic-programming
0
votes
0
answers
31
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????
karan25gupta
asked
in
Algorithms
Apr 17, 2019
by
karan25gupta
537
views
algorithms
dynamic-programming
knapsack-problem
0
votes
2
answers
32
self doubt
What advantage does top down approch have over bottom up approach in case of dynamic programming??
Doraemon
asked
in
Algorithms
Mar 26, 2019
by
Doraemon
681
views
dynamic-programming
0
votes
1
answer
33
self doubt
Can we solve fractional knapsack using dynamic programming?
DIYA BASU
asked
in
Algorithms
Feb 14, 2019
by
DIYA BASU
301
views
knapsack-problem
dynamic-programming
0
votes
1
answer
34
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.
DIYA BASU
asked
in
Algorithms
Feb 6, 2019
by
DIYA BASU
271
views
dynamic-programming
0
votes
1
answer
35
A Different Kind of Question on Longest Common Subsequence
Consider two strings A = "anandarmy" and B = "algorithms". Let ‘y’ be the length of the longest common subsequence (not necessarily contiguous) between A and B and let ‘x’ be the number of such longest common subsequences between A and B. Then 2x+3y = _________.
gmrishikumar
asked
in
Algorithms
Jan 22, 2019
by
gmrishikumar
1.7k
views
algorithms
longest-common-subsequence
dynamic-programming
numerical-answers
0
votes
1
answer
36
Dynamic programming
My answer came out to be 13: because when we will compute T(13) { as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as it will store it and reuse it) so the stack size will be 1 (for T(13))+11 (for T(12),T(11),…...T(2)) = 12…...(48/4) } will any one help me out
Nandkishor3939
asked
in
Algorithms
Jan 22, 2019
by
Nandkishor3939
397
views
algorithms
dynamic-programming
programming
test-series
1
vote
1
answer
37
Applied Course | Mock GATE | Test 1 | Question: 58
Consider the Knapsack Problem: Given a set of n items, each with a weight $w_i$ and the value $v_i$ determine a subset of items to include in a collection so that the total weight is $\leq W$ which is a given limit and the total ... subproblems is $O(nW)$. Which of the above statements is/are correct? I only II only Both I and II None of these
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
345
views
applied-course-2019-mock1
algorithms
dynamic-programming
0
votes
2
answers
38
Gateforum Test Series: Algorithms - Dynamic Programming
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$, $\sum={a,b,c,…..z}$. String matching problem is to find all the occurence of P in T. A pattern occur with shift s in T if $P[1…..m]=T[s+1,…...s+m]$. Consider $T=bacacbaacacac$ $P=cac$ The sum of the value of all s is ________
Gupta731
asked
in
Algorithms
Jan 14, 2019
by
Gupta731
511
views
gateforum-test-series
algorithms
dynamic-programming
2
votes
0
answers
39
Dynamic Programming basics
Can any one explain whats happening in side the green area due to dynamic programming ?
Nandkishor3939
asked
in
Programming
Jan 13, 2019
by
Nandkishor3939
392
views
dynamic-programming
algorithms
programming
0
votes
0
answers
40
UPPCL AE 2018:12
Given below are some famous algorithms and some algorithm design paradigms ... $\text{1-(c), 2-(b), 3-(a), 4-(b)}$
Lakshman Patel RJIT
asked
in
Algorithms
Jan 5, 2019
by
Lakshman Patel RJIT
144
views
uppcl2018
algorithms
greedy-algorithm
dynamic-programming
divide-and-conquer
1
vote
1
answer
41
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$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
3.0k
views
ugcnetcse-dec2018-paper2
algorithms
dynamic-programming
0
votes
1
answer
42
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.
Abhisek Tiwari 4
asked
in
Algorithms
Dec 24, 2018
by
Abhisek Tiwari 4
270
views
algorithms
dynamic-programming
knapsack-problem
numerical-answers
made-easy-booklet
2
votes
2
answers
43
self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
Nivedita Singh
asked
in
Algorithms
Dec 8, 2018
by
Nivedita Singh
1.1k
views
algorithms
dynamic-programming
matrix-chain-ordering
0
votes
1
answer
44
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
CJ147
asked
in
Algorithms
Dec 3, 2018
by
CJ147
252
views
dynamic-programming
knapsack-problem
0
votes
0
answers
45
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)
adityaaswal
asked
in
Algorithms
Dec 1, 2018
by
adityaaswal
375
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
0
answers
46
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?
Shamim Ahmed
asked
in
Algorithms
Nov 26, 2018
by
Shamim Ahmed
284
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
0
answers
47
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
Amit puri
asked
in
Algorithms
Nov 22, 2018
by
Amit puri
188
views
dynamic-programming
divide-and-conquer
0
votes
2
answers
48
Fibonacci number time complexity
Consider the following code segment to find the $n^{th}$ Fibonacci number: Fib(n) { if(n==0) {return 0;} if(n==1) {return 1;} else { return(Fib(n-1) + Fib(n-2)); } } The time complexity of the above code and time complexity of the same problem solved using dynamic programming is______ $A)O(n^{2}),O(n)$ $B)O(2^{n}),O(n)$ $C)O(2^{n}),O(n^{2})$ $D)$None of the above
Lakshman Patel RJIT
asked
in
Algorithms
Nov 13, 2018
by
Lakshman Patel RJIT
1.9k
views
algorithms
greedy-algorithm
dynamic-programming
0
votes
1
answer
49
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
altamash
asked
in
Algorithms
Nov 11, 2018
by
altamash
124
views
dynamic-programming
matrix-chain-ordering
0
votes
1
answer
50
made easy test series
Chetan28kumar
asked
in
Algorithms
Nov 4, 2018
by
Chetan28kumar
342
views
made-easy-test-series
matrix-chain-ordering
dynamic-programming
numerical-answers
0
votes
0
answers
51
Backtracking part of Algo
Is Backtracking Branch and Bound part of Gate syllabus?
sripo
asked
in
Algorithms
Oct 22, 2018
by
sripo
670
views
algorithms
dynamic-programming
syllabus
usergate2019
0
votes
0
answers
52
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?
Mariela Prasetyo
asked
in
Algorithms
Oct 10, 2018
by
Mariela Prasetyo
168
views
dynamic-programming
time-complexity
0
votes
2
answers
53
dynamic prgramming
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)? int f(int **a,int n,int k) { if ((n<=k)||(k<=1)) return 1; if(a[n][k]==-1) a[n][k]=f(a,n-1,k)+f(a,n-1,k-1); return a[n][k]; } a)theta(m) b)theta(m^2) c)theta(2^m) d)O(1) }
balaganesh
asked
in
Algorithms
Sep 16, 2018
by
balaganesh
260
views
dynamic-programming
algorithms
0
votes
1
answer
54
#self doubt #Lcs
How many distinct function calls are there in LCS(m,n)=. How to calculate it?
Rustam Ali
asked
in
Algorithms
Sep 11, 2018
by
Rustam Ali
147
views
algorithms
dynamic-programming
longest-common-subsequence
descriptive
1
vote
0
answers
55
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.
Nidhi Budhraja
asked
in
Algorithms
Sep 10, 2018
by
Nidhi Budhraja
262
views
ace-test-series
algorithms
dynamic-programming
1
vote
0
answers
56
Dynamic Programming Preparation for Gate
How to prepare for Dynamic Programming topic in DAA for GATE exam?
dan31
asked
in
Algorithms
Sep 9, 2018
by
dan31
836
views
algorithms
dynamic-programming
gate-preparation
0
votes
1
answer
57
Test series
Let B1, B2, B3, B4, B5 be five matrices of dimensions 15 x 20, 20 x 17, 17 x 22, 22 x 16, 16 x 23 respectively. The minimum number of scalar multiplications required to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method _____
mitesh kumar
asked
in
Algorithms
Aug 30, 2018
by
mitesh kumar
282
views
dynamic-programming
test-series
matrix-chain-ordering
numerical-answers
0
votes
1
answer
58
#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
amitqy
asked
in
Algorithms
Aug 20, 2018
by
amitqy
124
views
algorithms
dynamic-programming
1
vote
1
answer
59
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
srestha
asked
in
Algorithms
Aug 17, 2018
by
srestha
381
views
algorithms
dynamic-programming
0
votes
0
answers
60
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?
AIkiran01
asked
in
Algorithms
Aug 10, 2018
by
AIkiran01
167
views
algorithms
dynamic-programming
Page:
« prev
1
2
3
4
5
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged dynamic-programming
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....