The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged dynamicprogramming
+1
vote
0
answers
1
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(nk1), according to my understanding it should not be there ... ) is the count of right subtrees, so there are only T(k)*T(nk1) possibilities for each k, sum over the limits
asked
Mar 25
in
Algorithms
by
Yash Khanna
(
235
points)

38
views
binarytree
algorithms
dynamicprogramming
permutationsandcombinations
0
votes
0
answers
2
Dynamic programmingtabulation method bottom up
asked
Feb 22
in
Algorithms
by
Surajit
Active
(
3k
points)

63
views
dynamicprogramming
+3
votes
5
answers
3
GATE201831
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 ... scalar multiplications, the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_2F_2$ and $F_4F_5$ only
asked
Feb 14
in
Algorithms
by
gatecse
Boss
(
17.8k
points)

1.5k
views
gate2018
algorithms
dynamicprogramming
+1
vote
0
answers
4
ace test
I got 206???
asked
Jan 21
in
Algorithms
by
Deepak Mokili
(
307
points)

81
views
acetestseries
algorithms
dynamicprogramming
merging
graphtheory
optimalmergepattern
+1
vote
0
answers
5
Dynamic programming
Consider the following recursive function which is used by dynamic programming: T(n)= 0 ;if n<1 = 1;if n=1 =T(n1)+T(n2)+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.)
asked
Jan 20
in
Algorithms
by
VS
Loyal
(
7.5k
points)

94
views
algorithms
dynamicprogramming
+3
votes
0
answers
6
gatebook test  Algorithm design paradigms
asked
Jan 10
in
Algorithms
by
junk_mayavi
Active
(
3.8k
points)

69
views
algorithms
testseries
dynamicprogramming
0
votes
1
answer
7
Dynamic programming
Which of the following statement(s) is/are correct? P: For a dynamic programming algorithm, computing all values in a bottomup 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 subproblems.( Marks: 0.66 ) I mark only P is true. Answer neither P and Q
asked
Dec 26, 2017
in
Algorithms
by
sunil sarode
Active
(
1.1k
points)

161
views
dynamicprogramming
algorithms
+1
vote
0
answers
8
Greedy vs Dynamic
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution. Is the above statement correct?
asked
Dec 13, 2017
in
Algorithms
by
Tuhin Dutta
Loyal
(
7.5k
points)

190
views
algorithms
greedyalgorithm
dynamicprogramming
–1
vote
1
answer
9
Matrix multiplications
Let A1, A2, A3, A4, A5 be five matrices of dimensions 2×3, 3×5, 5×2, 2×4, 4×3 respectively. The minimum number of scalar multiplications required to find the product A1 A2 A3 A4 A5 using the basic matrix multiplication method is_____
asked
Dec 10, 2017
in
Algorithms
by
Parshu gate
Active
(
4.8k
points)

274
views
matrixchainordering
dynamicprogramming
algorithms
0
votes
1
answer
10
Dynamic programming
asked
Dec 5, 2017
in
Algorithms
by
Parshu gate
Active
(
4.8k
points)

74
views
algorithms
dynamicprogramming
+1
vote
1
answer
11
Matrix chain multiplication
Which of the following is the recurrence relation for the matrix chain multiplication problem where p[i1]*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[i1]*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[i1]*p[k]*p[j]
asked
Nov 27, 2017
in
Algorithms
by
Parshu gate
Active
(
4.8k
points)

198
views
dynamicprogramming
algorithms
matrixchainordering
+2
votes
1
answer
12
CLRS DivideandConquer Strassens's algorithm
asked
Oct 9, 2017
in
Algorithms
by
Manasi Srivastava
(
73
points)

149
views
algorithms
divideandconquer
dynamicprogramming
+1
vote
3
answers
13
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.
asked
Oct 1, 2017
in
Algorithms
by
ashwina
Active
(
1.9k
points)

644
views
algorithms
dynamicprogramming
0
votes
0
answers
14
DYNAMIC PROGRAMMING
asked
Sep 17, 2017
in
Algorithms
by
Parshu gate
Active
(
4.8k
points)

125
views
algorithms
dynamicprogramming
graphtheory
0
votes
0
answers
15
dynamic programming
asked
Sep 17, 2017
in
Algorithms
by
Parshu gate
Active
(
4.8k
points)

67
views
dynamicprogramming
algorithms
0
votes
0
answers
16
Floydwarshall for longest path problem
I have few doubts related to Longest distance problem. From Wikipedia > The NPhardness 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/floydwarshallforlongestdistanceforundirectedgraph)
asked
Sep 8, 2017
in
Algorithms
by
Chhotu
Boss
(
10.3k
points)

269
views
graphalgorithms
dynamicprogramming
0
votes
1
answer
17
dynamic programming
asked
Aug 26, 2017
in
Algorithms
by
set2018
Loyal
(
7.5k
points)

118
views
algorithms
dynamicprogramming
+2
votes
1
answer
18
Longest Common Subsequence
For finding longest common subsequence(LCS), standard sources mention that the recursive procedure consisting of the recursive tree occupies O(m+n) space( WITHOUT applying Dynamic Programming). I am unable to understand why is space occupied O(m+n)? Consider the tree of LCS(3,3). ... value of2^ k = O(m+n) and hence, space should be k=log(m+n). What's wrong with my logic?
asked
May 17, 2017
in
Algorithms
by
Bongbirdie
Junior
(
667
points)

339
views
algorithms
longestcommonsubsequence
dynamicprogramming
+1
vote
4
answers
19
difference between dynamic programming and divide and conquer technique is
asked
Apr 17, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
5k
points)

3.2k
views
divideandconquer
algorithms
dynamicprogramming
programming
+1
vote
2
answers
20
Dynamic Programming
Find an optimal parenthesization of a matrixchain product whose sequence of dimensions <5,10,3,12,5,50,6>.
asked
Mar 21, 2017
in
Algorithms
by
saurabh rai
Boss
(
12.2k
points)

205
views
algorithms
dynamicprogramming
+3
votes
2
answers
21
What is the general idea to approach to problems in Dynamic Programming ?
asked
Jan 6, 2017
in
Algorithms
by
Dulqar
Active
(
2.8k
points)

260
views
algorithms
dynamicprogramming
+2
votes
1
answer
22
Made Easy Test Series
asked
Jan 3, 2017
in
Algorithms
by
Lucky sunda
Active
(
4.5k
points)

236
views
madeeasytestseries
algorithms
dynamicprogramming
+1
vote
2
answers
23
virtual gate
asked
Dec 30, 2016
in
Algorithms
by
firki lama
Junior
(
873
points)

232
views
virtualgate
testseries
dynamicprogramming
matrixchainordering
+3
votes
1
answer
24
TIFR2016A7
Let $S$ be the $4 \times 4$ square grid $\{(x, y): x, y \in \{0, 1, 2, 3\} \}$. A $monotone \: \: path$ in this grid starts at $(0, 0)$ and at each step either moves one unit up or one unit right. For example, fromthe point $(x, y)$ one can in one ... )$ bt $z$. How many distinct monotone paths are there to reach point $(3, 3)$ starting from $(0, 0)$? $2z+6$ $3z+6$ $2z+8$ $3z+8$ $3z+4$
asked
Dec 27, 2016
in
Others
by
jothee
Veteran
(
98.8k
points)

71
views
tifr2016
permutationsandcombinations
dynamicprogramming
+1
vote
3
answers
25
Find shortest path
asked
Nov 27, 2016
in
Algorithms
by
Rakesh K
Active
(
1.8k
points)

497
views
graphalgorithms
shortestpath
algorithms
graphtheory
dynamicprogramming
multistagegraph
+3
votes
1
answer
26
Divide and conquer+Dynamic
asked
Oct 8, 2016
in
Algorithms
by
Rahul Jain25
Boss
(
11.5k
points)

406
views
divideandconquer
dynamicprogramming
algorithms
+1
vote
0
answers
27
Recurrence relation and probability
N rooms are there and they are numbered from 1 to N. A person P is in charge of room allocation and allocates these rooms inthe following way: Each query ask for two consecutive rooms. P selects two consecutive rooms out of the vacant ... selects (2,3) Seconds query onwards can not be processed. because although 1,4 are vacant, these rooms are not consecutive.
asked
Aug 23, 2016
by
Debashish Deka
Veteran
(
56.2k
points)

157
views
nongate
algorithms
dynamicprogramming
recurrenceeqation
recurrence
+2
votes
2
answers
28
UGCNETDec2013III37
The longest common subsequence of the sequences X=<A, B, C, B, D, A, B> and Y=<B, D, C, A, B, A> has length 2 3 4 5
asked
Jul 28, 2016
in
Algorithms
by
jothee
Veteran
(
98.8k
points)

706
views
ugcnetdec2013iii
algorithms
dynamicprogramming
+2
votes
2
answers
29
Maximum Continuous Sum in an Array
Given an array of $n$ elements find the maximum continuous sum in it. For example consider the below array of $n=6$. 23 4 10 2 15 1 Answer is 35.
asked
Jul 3, 2016
in
Algorithm Challenges
by
Arjun
Veteran
(
339k
points)

540
views
placementquestions
dynamicprogramming
Page:
1
2
next »
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
Suggestion for IIITH exam
Placement Statistics for Computer Science
IIT Bombay Admission
ISRO 2018
NTRO Final year Eligibility
Follow @csegate
Gatecse
Recent questions tagged dynamicprogramming
Recent Blog Comments
Yes. I cleared the test and got selected.
Did you clear the test? Were you selected?
No. There was no penalty. We were allowed to ...
You have to write the entire code. I attempted 5 ...
Let's say c = 5 and p = ...
34,773
questions
41,737
answers
118,895
comments
41,384
users