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
1
answer
151
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
1.1k
views
algorithms
dynamic-programming
recurrence-relation
67
votes
2
answers
152
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
17.8k
views
gatecse-2010
algorithms
dynamic-programming
normal
34
votes
4
answers
153
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
15.5k
views
gatecse-2011
algorithms
dynamic-programming
normal
43
votes
3
answers
154
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
15.2k
views
gatecse-2011
algorithms
easy
dynamic-programming
52
votes
4
answers
155
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
10.0k
views
gatecse-2014-set3
algorithms
normal
numerical-answers
dynamic-programming
44
votes
7
answers
156
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
16.8k
views
gatecse-2014-set2
algorithms
normal
numerical-answers
dynamic-programming
32
votes
2
answers
157
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
9.2k
views
gatecse-2009
algorithms
normal
dynamic-programming
recursion
44
votes
4
answers
158
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
11.7k
views
gatecse-2008
algorithms
normal
dynamic-programming
Page:
« prev
1
2
3
4
5
6
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:...