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
3
votes
2
answers
61
MadeEasy Test Series: Algorithms - Dynamic Programming
Consider two strings A = “abbaccda” and B = “abcaa” consider "x"be length of the longest common subsequence between A and B and “y” be the number of distinct such longest common subsequences between A and B. Then 10x+ 2y is ________.
talha hashim
asked
in
Algorithms
Aug 1, 2018
by
talha hashim
1.4k
views
algorithms
dynamic-programming
made-easy-test-series
0
votes
1
answer
62
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?
shipra tressa
asked
in
Algorithms
Jul 17, 2018
by
shipra tressa
1.1k
views
dynamic-programming
time-complexity
0
votes
1
answer
63
matrics multiplication
shruti gupta1
asked
in
Algorithms
Jun 29, 2018
by
shruti gupta1
556
views
algorithms
matrix-chain-ordering
dynamic-programming
test-series
1
vote
1
answer
64
Ace Test Series: Algorithms - Dynamic Programming OBST
Na462
asked
in
Algorithms
Jun 29, 2018
by
Na462
1.1k
views
ace-test-series
algorithms
dynamic-programming
time-complexity
0
votes
1
answer
65
Dynamic programming
Consider the following C functions: int fun ( int n) { if (n<6) return 1; else return( fun(n-1)+fun(n-3)+fun (n-5)); } Q) Suppose we modify the above function fun( ) and store the values of fun (i), 0<=i<n, as and when they are computed . With this ... ( ) is significantly reduced. What is the time complexity of modified fun( ) would be: a)O(1) b)O(n) c)O(n^2) d)O(n!)
Rohit Pandey
asked
in
Algorithms
Jun 29, 2018
by
Rohit Pandey
198
views
algorithms
dynamic-programming
time-complexity
1
vote
1
answer
66
Gate 2018
This is another form of gate 2018 matrix-chain question
kunal goswami
asked
in
Algorithms
Jun 28, 2018
by
kunal goswami
295
views
algorithms
dynamic-programming
matrix-chain-ordering
3
votes
2
answers
67
#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!
iarnav
asked
in
Algorithms
Jun 3, 2018
by
iarnav
3.6k
views
algorithms
dynamic-programming
1
vote
1
answer
68
MadeEasy Test Series: Algorithms - Dynamic Programming
Consider two Person (Person X, Person Y). Person X who was given a problem to calculate A1 A2 A3 with dimension 3 100, 100 2 and 2 2 in minimum multiplication. Person X is the knows only ... Y solved the same problem using Dynamic algorithm with M2multiplications. How many number of multiplications saved by Person Y than Person X?
Ayesha_S
asked
in
Algorithms
Jun 2, 2018
by
Ayesha_S
630
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
0
answers
69
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$.
hacker16
asked
in
Algorithms
Apr 28, 2018
by
hacker16
347
views
algorithms
recursion
dynamic-programming
1
vote
1
answer
70
Counting No of Trees - College Exam
Want help with part (a). Other parts can be done accordingly. According to the solution, I understand how to find the limits of the sum, but why is there a factor of 2 with T(k) * T(n-k-1), according to my understanding it should not be there ... ) is the count of right sub-trees, so there are only T(k)*T(n-k-1) possibilities for each k, sum over the limits
Yash Khanna
asked
in
Algorithms
Mar 25, 2018
by
Yash Khanna
323
views
binary-tree
algorithms
dynamic-programming
combinatory
test-series
0
votes
0
answers
71
Dynamic programming--tabulation method bottom up
Just practicing some general problems on dynamic programming.Problem is I am unable to think of tabulation or bottom up approach for most of the new type of problems other than common ones.I am trying to get the naive recursion first ... at this moment let me know how to get some idea of tabulating easily?..For example take coin exchange problem.
Surajit
asked
in
Algorithms
Feb 22, 2018
by
Surajit
706
views
dynamic-programming
26
votes
6
answers
72
GATE CSE 2018 | Question: 31
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing ... the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only
gatecse
asked
in
Algorithms
Feb 14, 2018
by
gatecse
13.6k
views
gatecse-2018
algorithms
dynamic-programming
2
votes
1
answer
73
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 ) ( ]
Sumaiya23
asked
in
Algorithms
Jan 29, 2018
by
Sumaiya23
1.6k
views
algorithms
dynamic-programming
counting
made-easy-test-series
1
vote
1
answer
74
MadeEasy Test Series 2018: Algorithms - Dynamic Programming
sumit chakraborty
asked
in
Programming
Jan 28, 2018
by
sumit chakraborty
509
views
algorithms
dynamic-programming
made-easy-test-series
1
vote
0
answers
75
Ace Test Series: Algorithms - Dynamic Programming Optimal Merging Of Files
I got 206???
rasto mapp
asked
in
Algorithms
Jan 21, 2018
by
rasto mapp
531
views
ace-test-series
algorithms
dynamic-programming
merging
graph-theory
optimal-merge-pattern
1
vote
0
answers
76
Dynamic programming
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 its value is already ... of n' so that overflow cannot occur ________. (Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
VS
asked
in
Algorithms
Jan 20, 2018
by
VS
705
views
algorithms
dynamic-programming
3
votes
0
answers
77
gatebook test - Algorithm design paradigms
Select the wrong statement from the following given options. a. Dynamic programming is applicable when subproblems are not independent. b. Divide and conquer algorithm does more work than necessary repeatedly solving the common subproblems c. ... exactly once and saves the result into a table. d. Longest path problem has optimal substructure property.
junk_mayavi
asked
in
Algorithms
Jan 10, 2018
by
junk_mayavi
367
views
algorithms
test-series
dynamic-programming
0
votes
2
answers
78
Dynamic programming
Which of the following statement(s) is/are correct? P: For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than using recursion Q: The running time of a dynamic programming algorithm is always Θ(P) where P is the number of sub-problems.( Marks: -0.66 ) I mark only P is true. Answer neither P and Q
sunil sarode
asked
in
Algorithms
Dec 26, 2017
by
sunil sarode
1.9k
views
dynamic-programming
algorithms
0
votes
0
answers
79
General Topic Doubt: Algorithms - Dynamic Programming
Read the following statements about 0/1 Knapsack problem. (i) Time complexity of Knapsack is O(n* W) where W is the weight of the Knapsack and there are n items. (ii) Time complexity of Knapsack is min( O(n*W) , O(2^n) ) where W is the weight of the ... ) and (iii) is true (ii) and (iii) is true (i) ( iii) (iv) is true (ii) (iii) (iv) is true.
VIKAS TIWARI
asked
in
Algorithms
Dec 13, 2017
by
VIKAS TIWARI
728
views
algorithms
dynamic-programming
knapsack-problem
general-topic-doubt
1
vote
1
answer
80
Greedy vs Dynamic
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution. Is the above statement correct?
Tuhin Dutta
asked
in
Algorithms
Dec 13, 2017
by
Tuhin Dutta
5.8k
views
algorithms
greedy-algorithm
dynamic-programming
2
votes
2
answers
81
Matrix Multiplications
Let $A1, A2, A3, A4, A5$ be five matrices of dimensions $2\times3, 3\times5, 5\times2, 2\times4, 4\times3$ respectively. The minimum number of scalar multiplications required to find the product $A1, A2 ,A3, A4, A5$ using the basic matrix multiplication method is_______
Parshu gate
asked
in
Algorithms
Dec 10, 2017
by
Parshu gate
2.5k
views
matrix-chain-ordering
dynamic-programming
algorithms
0
votes
1
answer
82
Dynamic programming
Parshu gate
asked
in
Algorithms
Dec 5, 2017
by
Parshu gate
413
views
algorithms
dynamic-programming
test-series
1
vote
3
answers
83
Matrix chain multiplication
Which of the following is the recurrence relation for the matrix chain multiplication problem where p[i-1]*p[i] gives the dimension of the i^th matrix? dp[i,j]=1 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=1 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j] dp[i,j]= ... dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=0 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j]
Parshu gate
asked
in
Algorithms
Nov 27, 2017
by
Parshu gate
3.1k
views
dynamic-programming
algorithms
matrix-chain-ordering
0
votes
1
answer
84
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.
Syedabbas110
asked
in
Algorithms
Oct 30, 2017
by
Syedabbas110
2.1k
views
algorithms
knapsack-problem
dynamic-programming
2
votes
2
answers
85
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?
Manasi Srivastava
asked
in
Algorithms
Oct 9, 2017
by
Manasi Srivastava
609
views
algorithms
divide-and-conquer
dynamic-programming
5
votes
5
answers
86
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.
dragonball
asked
in
Algorithms
Oct 1, 2017
by
dragonball
12.7k
views
algorithms
dynamic-programming
0
votes
0
answers
87
DYNAMIC PROGRAMMING
Parshu gate
asked
in
Algorithms
Sep 17, 2017
by
Parshu gate
253
views
algorithms
dynamic-programming
graph-theory
0
votes
0
answers
88
dynamic programming
Parshu gate
asked
in
Algorithms
Sep 17, 2017
by
Parshu gate
179
views
dynamic-programming
algorithms
0
votes
1
answer
89
Dynamic Programming: How to Approach these type of recurrence problems in DP?
gateoverflow_
asked
in
Algorithms
Sep 11, 2017
by
gateoverflow_
277
views
dynamic-programming
recurrence-relation
ace-test-series
0
votes
0
answers
90
Floyd-warshall for longest path problem
I have few doubts related to Longest distance problem. From Wikipedia --> The NP-hardness of the unweighted longest path problem can be shown using a reduction from the Hamiltonian path problem: a graph G has a ... normal algorithm as asked in (https://stackoverflow.com/questions/42500120/floyd-warshall-for-longest-distance-for-undirected-graph)
Chhotu
asked
in
Algorithms
Sep 8, 2017
by
Chhotu
1.7k
views
graph-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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
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
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged dynamic-programming
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...