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
1
answer
61
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
351
views
dynamic-programming
matrix-chain-ordering
0
votes
1
answer
62
made easy test series
Chetan28kumar
asked
in
Algorithms
Nov 4, 2018
by
Chetan28kumar
720
views
made-easy-test-series
matrix-chain-ordering
dynamic-programming
numerical-answers
0
votes
0
answers
63
Backtracking part of Algo
Is Backtracking Branch and Bound part of Gate syllabus?
sripo
asked
in
Algorithms
Oct 22, 2018
by
sripo
862
views
algorithms
dynamic-programming
syllabus
usergate2019
0
votes
0
answers
64
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
315
views
dynamic-programming
time-complexity
0
votes
2
answers
65
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
452
views
dynamic-programming
algorithms
0
votes
1
answer
66
#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
361
views
algorithms
dynamic-programming
longest-common-subsequence
descriptive
1
vote
0
answers
67
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
375
views
ace-test-series
algorithms
dynamic-programming
1
vote
0
answers
68
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
1.0k
views
algorithms
dynamic-programming
gate-preparation
0
votes
1
answer
69
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
462
views
dynamic-programming
test-series
matrix-chain-ordering
numerical-answers
0
votes
1
answer
70
#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
305
views
algorithms
dynamic-programming
1
vote
1
answer
71
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
567
views
algorithms
dynamic-programming
0
votes
0
answers
72
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
307
views
algorithms
dynamic-programming
2
votes
2
answers
73
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
2.0k
views
algorithms
dynamic-programming
made-easy-test-series
longest-common-subsequence
0
votes
1
answer
74
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.5k
views
dynamic-programming
time-complexity
0
votes
1
answer
75
matrics multiplication
shruti gupta1
asked
in
Algorithms
Jun 29, 2018
by
shruti gupta1
869
views
algorithms
matrix-chain-ordering
dynamic-programming
test-series
1
vote
1
answer
76
Ace Test Series: Algorithms - Dynamic Programming OBST
Na462
asked
in
Algorithms
Jun 29, 2018
by
Na462
1.4k
views
ace-test-series
algorithms
dynamic-programming
time-complexity
0
votes
1
answer
77
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 28, 2018
by
Rohit Pandey
351
views
algorithms
dynamic-programming
time-complexity
1
vote
1
answer
78
Gate 2018
This is another form of gate 2018 matrix-chain question
kunal goswami
asked
in
Algorithms
Jun 28, 2018
by
kunal goswami
472
views
algorithms
dynamic-programming
matrix-chain-ordering
3
votes
2
answers
79
#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
5.0k
views
algorithms
dynamic-programming
1
vote
1
answer
80
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
904
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
0
answers
81
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
472
views
algorithms
recursion
dynamic-programming
1
vote
1
answer
82
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
434
views
binary-tree
algorithms
dynamic-programming
combinatory
test-series
0
votes
0
answers
83
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
980
views
dynamic-programming
30
votes
6
answers
84
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
19.1k
views
gatecse-2018
algorithms
dynamic-programming
2-marks
2
votes
1
answer
85
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
2.1k
views
algorithms
dynamic-programming
counting
made-easy-test-series
1
vote
1
answer
86
MadeEasy Test Series 2018: Algorithms - Dynamic Programming
sumit chakraborty
asked
in
Programming in C
Jan 28, 2018
by
sumit chakraborty
852
views
algorithms
dynamic-programming
made-easy-test-series
1
vote
0
answers
87
Ace Test Series: Algorithms - Dynamic Programming Optimal Merging Of Files
I got 206???
rasto mapp
asked
in
Algorithms
Jan 21, 2018
by
rasto mapp
860
views
ace-test-series
algorithms
dynamic-programming
merging
graph-theory
optimal-merge-pattern
1
vote
0
answers
88
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 19, 2018
by
VS
1.1k
views
algorithms
dynamic-programming
3
votes
0
answers
89
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
603
views
algorithms
test-series
dynamic-programming
0
votes
2
answers
90
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
2.3k
views
dynamic-programming
algorithms
Page:
« prev
1
2
3
4
5
6
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged dynamic-programming
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...