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
121
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
948
views
ugcnetcse-sep2013-paper3
algorithms
dynamic-programming
matrix-chain-ordering
2
votes
2
answers
122
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
2.1k
views
algorithm-challenge
placement-questions
dynamic-programming
5
votes
1
answer
123
Optimal Substructure
geet.m
asked
in
Algorithms
Jun 29, 2016
by
geet.m
490
views
algorithms
dynamic-programming
algorithm-design-techniques
test-series
2
votes
3
answers
124
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
840
views
cmi2013
descriptive
algorithms
dynamic-programming
3
votes
1
answer
125
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
326
views
cmi2015
descriptive
algorithms
dynamic-programming
2
votes
1
answer
126
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
268
views
cmi2014
algorithms
dynamic-programming
1
vote
1
answer
127
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.2k
views
time-complexity
dynamic-programming
p-np-npc-nph
1
vote
0
answers
128
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.1k
views
cmi2012
descriptive
algorithms
dynamic-programming
29
votes
2
answers
129
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
8.2k
views
gatecse-2008
algorithms
normal
dynamic-programming
43
votes
3
answers
130
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
10.7k
views
gatecse-2009
normal
algorithms
dynamic-programming
recursion
2
votes
1
answer
131
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
1.6k
views
combinatory
recurrence-relation
dynamic-programming
placement-questions
39
votes
7
answers
132
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
16.9k
views
gatecse-2016-set2
dynamic-programming
algorithms
normal
numerical-answers
21
votes
4
answers
133
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
6.0k
views
gatecse-2016-set2
algorithms
dynamic-programming
easy
1
vote
1
answer
134
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
946
views
algorithms
dynamic-programming
made-easy-test-series
4
votes
1
answer
135
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.1k
views
algorithms
dynamic-programming
time-complexity
0
votes
2
answers
136
finding pair of an element in the array such that diff will be given no.
venky.victory35
asked
in
Algorithms
Dec 20, 2015
by
venky.victory35
271
views
algorithms
time-complexity
dynamic-programming
divide-and-conquer
test-series
1
vote
1
answer
137
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's ... n!) 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
700
views
dynamic-programming
2
votes
2
answers
138
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
6.2k
views
dynamic-programming
numerical-answers
longest-common-subsequence
0
votes
1
answer
139
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
355
views
dynamic-programming
sub-array-sum
1
vote
1
answer
140
common data Linked quetion :- 1) which of the following is correct recurrence formula of I(j) 2)how to evaluate this R.R
kalpish
asked
in
Algorithms
Apr 8, 2015
by
kalpish
692
views
algorithms
dynamic-programming
recurrence-relation
63
votes
2
answers
141
GATE CSE 2010 | Question: 34
The weight of a sequence $a_0,a_1, \dots, a_{n-1}$ of real numbers is defined as $a_0+a_1/2+ \dots + a_{n-1}/2^{n-1}$. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let $X$ denote the ... $X$ is equal to $max(Y, a_0+Y)$ $max(Y, a_0+Y/2)$ $max(Y, a_0 +2Y)$ $a_0+Y/2$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
14.3k
views
gatecse-2010
algorithms
dynamic-programming
normal
29
votes
4
answers
142
GATE CSE 2011 | Question: 38
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ... $t=80$, then the minimum number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
12.2k
views
gatecse-2011
algorithms
dynamic-programming
normal
39
votes
3
answers
143
GATE CSE 2011 | Question: 25
An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array $A[0:n-1]$ is given below. Let $L_i$ ... The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm The algorithm uses divide and conquer paradigm
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
12.2k
views
gatecse-2011
algorithms
easy
dynamic-programming
47
votes
4
answers
144
GATE CSE 2014 Set 3 | Question: 37
Suppose you want to move from $0$ to $100$ on the number line. In each step, you either move right by a unit distance or you take a shortcut. A shortcut is simply a pre-specified pair of integers $i,\:j \:\text{with}\: i <j$. Given a shortcut $(i,j)$, if you ... $y$ and $z$ be such that $T(9) = 1 + \min(T(y),T(z))$. Then the value of the product $yz$ is _____.
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
6.9k
views
gatecse-2014-set3
algorithms
normal
numerical-answers
dynamic-programming
39
votes
7
answers
145
GATE CSE 2014 Set 2 | Question: 37
Consider two strings $A$="qpqrr" and $B$="pqprqrp". Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ be the number of such longest common subsequences between $A$ and $B$. Then $x +10y=$ ___.
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
12.3k
views
gatecse-2014-set2
algorithms
normal
numerical-answers
dynamic-programming
32
votes
2
answers
146
GATE CSE 2009 | Question: 53
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 ... $\text{expr2} = \max\left(l\left(i-1, j-1\right), l\left(i,j\right)\right)$
Kathleen
asked
in
Algorithms
Sep 22, 2014
by
Kathleen
7.5k
views
gatecse-2009
algorithms
normal
dynamic-programming
recursion
39
votes
3
answers
147
GATE CSE 2008 | Question: 80
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}$ Boolean array, ... $X[i, j] = X[i-1, j] \wedge X[i-1, j-a_i]$
Kathleen
asked
in
Algorithms
Sep 12, 2014
by
Kathleen
8.7k
views
gatecse-2008
algorithms
normal
dynamic-programming
Page:
« prev
1
2
3
4
5
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...