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
1
vote
0
answers
121
MadeEasy Subject Test: Algorithms - Dynamic Programming
debanjan sarkar
asked
in
Algorithms
Dec 20, 2016
by
debanjan sarkar
261
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
2
answers
122
travelling salesman problem
Question - 14 question is what is the approch to solve it by dynamic programming ?
priyanka gautam-piya
asked
in
Algorithms
Dec 15, 2016
by
priyanka gautam-piya
2.7k
views
dynamic-programming
0
votes
1
answer
123
Ace Test Series: Algorithms - Dynamic Programming
the given answer is 10200 but i am getting 20100
tejas dadhe
asked
in
Algorithms
Dec 13, 2016
by
tejas dadhe
449
views
ace-test-series
algorithms
dynamic-programming
matrix-chain-ordering
0
votes
0
answers
124
MadeEasy Test Series: Algorithms - Dynamic Programming
#plz check??
Hradesh patel
asked
in
Algorithms
Dec 12, 2016
by
Hradesh patel
247
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
1
answer
125
Matrix Multiplication
Matrix multiplication is associative and matrix chain multiplication uses following matrices A1 is 30×35 A2 is 35×15 A3 is 15×5 A4 is 5×10 A5 is 10×20 A6 is 20×25 Find the minimum number of multiplications required to compute A1 A2 A3 A4A5A6
Rohan Mundhey
asked
in
Algorithms
Nov 11, 2016
by
Rohan Mundhey
1.5k
views
algorithms
matrix-chain-ordering
dynamic-programming
2
votes
0
answers
126
Virtual Gate Test Series: Algorithms - Directed Graph
Hradesh patel
asked
in
Algorithms
Oct 6, 2016
by
Hradesh patel
630
views
algorithms
directed-graph
dynamic-programming
virtual-gate-test-series
2
votes
1
answer
127
GATE Overflow | Algorithms | Test 1 | Question: 16
The Matrix Chain-Product dynamic programming Algorithm runs in _______ linear time exponential time quadratic time cubic time
Bikram
asked
in
Algorithms
Oct 4, 2016
by
Bikram
338
views
go-alogrithms-1
algorithms
dynamic-programming
time-complexity
3
votes
2
answers
128
UGC NET CSE | August 2016 | Part 3 | Question: 31
Consider the problem of a chain <$A_{1} , A_{2} , A_{3},A_{4}$> of four matrices. Suppose that the dimensions of the matrices $A_{1} , A_{2} , A_{3}$ and $A_{4}$ are $30 \times 35, 35 \times 15, 15 \times 5$ ... minimum number of scalar multiplications needed to compute the product $A_{1}A_{2}A_{3}A_{4}$ is ____. $14875$ $21000$ $9375$ $11875$
makhdoom ghaya
asked
in
Algorithms
Oct 1, 2016
by
makhdoom ghaya
2.4k
views
ugcnetcse-aug2016-paper3
algorithms
dynamic-programming
numerical-answers
matrix
1
vote
0
answers
129
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.
dd
asked
in
Unknown Category
Aug 22, 2016
by
dd
520
views
non-gate
algorithms
dynamic-programming
recurrence-relation
1
vote
2
answers
130
UGC NET CSE | June 2016 | Part 3 | Question: 36
A triangulation of a polygon is a set of $T$ chords that divide the polygon into disjoint triangles. Every triangulation of $n$ vertex convex polygon has ____ chords and divides the polygon into ____ triangles $n-2, n-1$ $n-3, n-2$ $n-1, n$ $n-2, n-2$
go_editor
asked
in
Algorithms
Aug 20, 2016
by
go_editor
2.3k
views
ugcnetcse-june2016-paper3
algorithms
dynamic-programming
3
votes
2
answers
131
UGC NET CSE | December 2013 | Part 3 | Question: 37
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$
go_editor
asked
in
Algorithms
Jul 28, 2016
by
go_editor
5.6k
views
ugcnetcse-dec2013-paper3
algorithms
dynamic-programming
0
votes
1
answer
132
UGC NET CSE | September 2013 | Part 3 | Question: 39
The number of possible paranthesizations of a sequence of n matrices is O(n) $\theta$(n Ig n) $\Omega(2^n)$ None of the above
go_editor
asked
in
Algorithms
Jul 24, 2016
by
go_editor
1.3k
views
ugcnetcse-sep2013-paper3
algorithms
dynamic-programming
matrix-chain-ordering
2
votes
2
answers
133
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.
Arjun
asked
in
Algorithm Challenges
Jul 3, 2016
by
Arjun
3.1k
views
algorithm-challenge
placement-questions
dynamic-programming
5
votes
1
answer
134
Optimal Substructure
geet.m
asked
in
Algorithms
Jun 29, 2016
by
geet.m
670
views
algorithms
dynamic-programming
algorithm-design-technique
test-series
2
votes
3
answers
135
CMI2013-B-06b
Your final exams are over and you are catching up on watching sports on TV. You have a schedule of interesting matches coming up all over the world during the next week. You hate to start or stop watching a match midway, so your aim is ... dynamic programming to compute the maximum number of complete matches you can watch next week. Analyze the worse-case complexity of your algorithm.
Arjun
asked
in
Algorithms
Jun 8, 2016
by
Arjun
1.7k
views
cmi2013
descriptive
algorithms
dynamic-programming
3
votes
1
answer
136
CMI2015-B-07
There is a thin, long and hollow fibre with a virus in the centre. The virus occasionally becomes active and secretes some side products. The fibre is so thin that new side products secreted by the virus push the old products ... a single virus could possibly have produced the given sequence. Use dynamic programming, checking smaller subsequences before checking bigger subsequences.
go_editor
asked
in
Algorithms
May 27, 2016
by
go_editor
491
views
cmi2015
descriptive
algorithms
dynamic-programming
2
votes
1
answer
137
CMI2014-B-05
At the end of its fifth successful season, the Siruseri Premier League is planning to give an award to the Most Improved Batsman over the five years. For this, an Improvement Index will be computed for each batsman. This is defined as the longest ... to compute the Improvement Index for a batsman with an overall sequence of $n$ scores. Analyze the complexity of your algorithm.
go_editor
asked
in
Algorithms
May 27, 2016
by
go_editor
523
views
cmi2014
algorithms
dynamic-programming
1
vote
1
answer
138
What is the time complexity of Binary Knapsack?
I was reading some of the notes (made easy and ACE) and noticed that some teacher have taught that time complexity for Binary Knapsack O(2^(n/2)). which can not be reduced further. but What I have seen here that in ... techniques? Put some light, Am I missing something. Should I stop seeing those notes which people have posted over the internet.
rude
asked
in
Algorithms
May 23, 2016
by
rude
2.6k
views
time-complexity
dynamic-programming
p-np-npc-nph
1
vote
0
answers
139
CMI2012-B-06
A certain string-processing language offers a primitive operation which splits a string into two pieces. Since this operation involves copying the original string, it takes $n$ units of time for a string of length $n$, regardless of the location of the cut. Suppose, now ... pieces. You may assume that all m locations are in the interior of the string so each split is non-trivial.
go_editor
asked
in
Algorithms
May 23, 2016
by
go_editor
1.4k
views
cmi2012
descriptive
algorithms
dynamic-programming
32
votes
2
answers
140
GATE CSE 2008 | Question: 81
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of $S$ whose elements sum to $W$? A dynamic program for solving this problem uses a $\text{2-dimensional}$ ... that there is a subset whose elements sum to $W$? $X[1, W]$ $X[n, 0]$ $X[n, W]$ $X[n-1, n]$
go_editor
asked
in
Algorithms
Apr 23, 2016
by
go_editor
10.1k
views
gatecse-2008
algorithms
normal
dynamic-programming
46
votes
3
answers
141
GATE CSE 2009 | Question: 54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
go_editor
asked
in
Algorithms
Apr 23, 2016
by
go_editor
14.3k
views
gatecse-2009
normal
algorithms
dynamic-programming
recursion
2
votes
1
answer
142
In how many ways a rook can go from SouthEast to northwest corner of 8×8 chess board if travels only upwards or left?
Chetana Tailor
asked
in
Combinatory
Apr 10, 2016
by
Chetana Tailor
2.3k
views
combinatory
recurrence-relation
dynamic-programming
placement-questions
41
votes
7
answers
143
GATE CSE 2016 Set 2 | Question: 38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
Akash Kanase
asked
in
Algorithms
Feb 12, 2016
by
Akash Kanase
22.5k
views
gatecse-2016-set2
dynamic-programming
algorithms
matrix-chain-ordering
normal
numerical-answers
21
votes
4
answers
144
GATE CSE 2016 Set 2 | Question: 14
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on Greedy paradigm. Divide-and-conquer paradigm. Dynamic Programming paradigm. Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.
Akash Kanase
asked
in
Algorithms
Feb 12, 2016
by
Akash Kanase
7.2k
views
gatecse-2016-set2
algorithms
dynamic-programming
easy
1
vote
1
answer
145
MadeEasy Test Series: Algorithms - Dynamic Programming
Given an array of n numbers, give an algorithm for finding a contiguous subsequence A(i) ...A(j) for which the sum of elements is maximum. Eg. [-2, 11, -4, 13, -5, 2] → 20 If dynamic programming approach is used then what is time complexity and space complexity? (a ... b.) O(n), O(n) (c.) O(n3), O(n) (d.) O(n2), O(1) Given answer is option (b.)
Utk
asked
in
Algorithms
Jan 11, 2016
by
Utk
1.2k
views
algorithms
dynamic-programming
made-easy-test-series
4
votes
1
answer
146
Dynamic programming
Given an array which contains both positive and negative integers in it and asked to design an algorithm to find the maximum sum which does not contain two consecutive numbers.What is the time comlexity of efficient algorithm A) Θ(nlogn) B) Θ(n) C) Θ(n2) D) Θ(n2logn)
Aditi Tiwari
asked
in
Algorithms
Dec 22, 2015
by
Aditi Tiwari
1.2k
views
algorithms
dynamic-programming
time-complexity
0
votes
2
answers
147
finding pair of an element in the array such that diff will be given no.
venky.victory35
asked
in
Algorithms
Dec 19, 2015
by
venky.victory35
737
views
algorithms
time-complexity
dynamic-programming
divide-and-conquer
test-series
1
vote
1
answer
148
Travelling salesman problem vs. Minimum cost spanning tree vs. Shortest path
i want to understand these better.... please explain someone. Travelling salesman problem vs. Minimum cost spanning tree vs. Shortest path Also I was just wondering if there was any relation of TSP to GOOGLE' ... ) and there is no better solution other than dynamic programming. So do they use dynamic programming only?
Aspi R Osa
asked
in
Algorithms
Dec 15, 2015
by
Aspi R Osa
918
views
dynamic-programming
2
votes
2
answers
149
longest common subsequence
For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)
Pooja Palod
asked
in
Algorithms
Dec 1, 2015
by
Pooja Palod
9.2k
views
dynamic-programming
numerical-answers
longest-common-subsequence
0
votes
1
answer
150
max subarray problem
What does find max subarray return when all elements of array are negative?
Pooja Palod
asked
in
Algorithms
Oct 9, 2015
by
Pooja Palod
495
views
dynamic-programming
sub-array-sum
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:...