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
31
Recursive function
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 it's value is ... of 'n' so that overflow cannot occur . ( Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
Manisha Jaishwal
asked
in
Programming in C
Aug 6, 2022
by
Manisha Jaishwal
649
views
recursion
dynamic-programming
0
votes
1
answer
32
NIELIT 2021 Dec Scientist B - Section B: 71
The number of operations in matrix multiplication $\text{M1, M2, M3, M4}$ and $\text{M5}$ of sizes $5\times 10, 10\times 100, 100\times 2, 2\times 20$ and $20\times 50$ respectively will be: $5830$ $4600$ $6900$ $12890$
admin
asked
in
Algorithms
Jul 21, 2022
by
admin
394
views
nielit-2021-it-dec-scientistb
algorithms
dynamic-programming
matrix-chain-ordering
1
vote
3
answers
33
NIELIT Scientific Assistant A 2020 November: 52
In case of the dynamic programming approach the value of an optimal solution is computed in : Top down fashion Bottom up fashion Left to Right fashion Right to Left fashion
gatecse
asked
in
Compiler Design
Dec 9, 2020
by
gatecse
661
views
nielit-sta-2020
compiler-design
dynamic-programming
1
vote
1
answer
34
NIELIT Scientific Assistant A 2020 November: 64
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respectively? $O(n)$ $O(w)$ $O(nw)$ $O(n+w)$
gatecse
asked
in
Algorithms
Dec 9, 2020
by
gatecse
664
views
nielit-sta-2020
algorithms
dynamic-programming
easy
knapsack-problem
time-complexity
1
vote
1
answer
35
NIELIT Scientific Assistant A 2020 November: 105
Assembly line scheduling and Longest Common Subsequence problems are an example of _______. Dynamic Programming Greedy Algorithms Greedy Algorithms and Dynamic Programming respectively Dynamic Programming and Branch and Bound respectively
gatecse
asked
in
Algorithms
Dec 9, 2020
by
gatecse
728
views
nielit-sta-2020
algorithms
dynamic-programming
1
vote
4
answers
36
NIELIT 2016 DEC Scientist B (IT) - Section B: 52
Find the odd one out Merge Sort TVSP Problem Knapsack Problem OBST Problem
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
3.2k
views
nielit2016dec-scientistb-it
algorithms
easy
dynamic-programming
divide-and-conquer
0
votes
3
answers
37
NIELIT 2017 July Scientist B (CS) - Section B: 39
Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree
admin
asked
in
Algorithms
Mar 30, 2020
by
admin
6.2k
views
nielit2017july-scientistb-cs
algorithms
easy
dynamic-programming
0
votes
0
answers
38
NIELIT 2017 July Scientist B (CS) - Section B: 41
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 ... $t=80$, then the number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
admin
asked
in
Algorithms
Mar 30, 2020
by
admin
962
views
nielit2017july-scientistb-cs
algorithms
dynamic-programming
matrix-chain-ordering
1
vote
1
answer
39
CMI2019-B-7
A college professor gives several quizzes during the semester, with negative marking. He has become bored of the usual "Best $M$ out of $N$ quizzes" formula to award marks for internal assessment. Instead, each student will be evaluated ... , the score the professor needs to award each student. Describe the space and time complexity of your dynamic programming algorithm.
gatecse
asked
in
Algorithms
Sep 13, 2019
by
gatecse
738
views
cmi2019
algorithms
dynamic-programming
descriptive
non-gate
3
votes
3
answers
40
UGC NET CSE | June 2019 | Part 2 | Question: 68
Consider the following steps: $S_1$: Characterize the structure of an optimal solution $S_2$: Compute the value of an optimal solution in bottom-up fashion Which of the following step(s) is/are common to both dynamic programming and greedy algorithms? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
Arjun
asked
in
Algorithms
Jul 2, 2019
by
Arjun
5.5k
views
ugcnetcse-june2019-paper2
optimal-solution
dynamic-programming
greedy-algorithm
0
votes
0
answers
41
self doubt *0/1 knapsack problem*
In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQUAL TO W OR IT CAN BE LESS THAN W AS WELL????
karan25gupta
asked
in
Algorithms
Apr 17, 2019
by
karan25gupta
691
views
algorithms
dynamic-programming
knapsack-problem
0
votes
2
answers
42
self doubt
What advantage does top down approch have over bottom up approach in case of dynamic programming??
Doraemon
asked
in
Algorithms
Mar 26, 2019
by
Doraemon
1.0k
views
dynamic-programming
0
votes
1
answer
43
self doubt
Can we solve fractional knapsack using dynamic programming?
DIYA BASU
asked
in
Algorithms
Feb 14, 2019
by
DIYA BASU
498
views
knapsack-problem
dynamic-programming
0
votes
1
answer
44
self doubt
For longest common subsequence the total number of subsequence possible for the word DIYA should be 2^4 or (2^4)-1??Please explain.
DIYA BASU
asked
in
Algorithms
Feb 6, 2019
by
DIYA BASU
461
views
dynamic-programming
0
votes
2
answers
45
A Different Kind of Question on Longest Common Subsequence
Consider two strings A = "anandarmy" and B = "algorithms". Let ‘y’ be the length of the longest common subsequence (not necessarily contiguous) between A and B and let ‘x’ be the number of such longest common subsequences between A and B. Then 2x+3y = _________.
gmrishikumar
asked
in
Algorithms
Jan 22, 2019
by
gmrishikumar
2.3k
views
algorithms
longest-common-subsequence
dynamic-programming
numerical-answers
0
votes
1
answer
46
Dynamic programming
My answer came out to be 13: because when we will compute T(13) { as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as it will store it and reuse it) so the stack size will be 1 (for T(13))+11 (for T(12),T(11),…...T(2)) = 12…...(48/4) } will any one help me out
Nandkishor3939
asked
in
Algorithms
Jan 22, 2019
by
Nandkishor3939
726
views
algorithms
dynamic-programming
programming
test-series
1
vote
1
answer
47
Applied Course | Mock GATE | Test 1 | Question: 58
Consider the Knapsack Problem: Given a set of n items, each with a weight $w_i$ and the value $v_i$ determine a subset of items to include in a collection so that the total weight is $\leq W$ which is a given limit and the total ... subproblems is $O(nW)$. Which of the above statements is/are correct? I only II only Both I and II None of these
Applied Course
asked
in
Algorithms
Jan 16, 2019
by
Applied Course
579
views
applied-course-2019-mock1
algorithms
dynamic-programming
0
votes
2
answers
48
Gateforum Test Series: Algorithms - Dynamic Programming
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$, $\sum={a,b,c,…..z}$. String matching problem is to find all the occurence of P in T. A pattern occur with shift s in T if $P[1…..m]=T[s+1,…...s+m]$. Consider $T=bacacbaacacac$ $P=cac$ The sum of the value of all s is ________
Gupta731
asked
in
Algorithms
Jan 14, 2019
by
Gupta731
756
views
gateforum-test-series
algorithms
dynamic-programming
2
votes
0
answers
49
Dynamic Programming basics
Can any one explain whats happening in side the green area due to dynamic programming ?
Nandkishor3939
asked
in
Programming in C
Jan 13, 2019
by
Nandkishor3939
636
views
dynamic-programming
algorithms
programming
1
vote
1
answer
50
UGC NET CSE | December 2018 | Part 2 | Question: 23
Consider two sequences $X$ and $Y$ : $X=<0, 1, 2, 1, 3, 0, 1>$ $Y=<1, 3, 2, 0, 1, 0>$ The length of longest common subsequence between $X$ and $Y$ is $2$ $3$ $4$ $5$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
3.7k
views
ugcnetcse-dec2018-paper2
algorithms
dynamic-programming
0
votes
1
answer
51
MadeEasyAlgo
Maximum profit using 0/1 Knapsack with W=200 is there any other than brute force method to solve this??? or we have to do only with tabular method?please solve and mention the way that is efficient w.r.t time if any.
Abhisek Tiwari 4
asked
in
Algorithms
Dec 24, 2018
by
Abhisek Tiwari 4
622
views
algorithms
dynamic-programming
knapsack-problem
numerical-answers
made-easy-booklet
2
votes
2
answers
52
self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
Nivedita Singh
asked
in
Algorithms
Dec 8, 2018
by
Nivedita Singh
1.5k
views
algorithms
dynamic-programming
matrix-chain-ordering
0
votes
1
answer
53
Dynamic Programming
What is the best way to solve a 0/1 knapsack problem? Any trick to solve it without wasting much time? Not How to
CJ147
asked
in
Algorithms
Dec 3, 2018
by
CJ147
441
views
dynamic-programming
knapsack-problem
0
votes
0
answers
54
MadeEasy Subject Test 2019: Algorithms - Dynamic Programming
Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)
adityaaswal
asked
in
Algorithms
Nov 30, 2018
by
adityaaswal
535
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
0
answers
55
MadeEasy Test Series : Algorithms - Dynamic Programming
Which of the following procedure is suitable to find longest path from given vertex to any other vertex in Directed Acyclic Graph? Answer: Dynamic Programming. Why Greedy Algorithm cant be applied here?
Shamim Ahmed
asked
in
Algorithms
Nov 26, 2018
by
Shamim Ahmed
387
views
made-easy-test-series
algorithms
dynamic-programming
0
votes
0
answers
56
general
how many terms will be computed to determine the value of 10C8 using divide and conquer strategy and dynamic programming? for divide and conquer ans is 89 how to compute please explain
Amit puri
asked
in
Algorithms
Nov 22, 2018
by
Amit puri
269
views
dynamic-programming
divide-and-conquer
0
votes
2
answers
57
Fibonacci number time complexity
Consider the following code segment to find the $n^{th}$ Fibonacci number: Fib(n) { if(n==0) {return 0;} if(n==1) {return 1;} else { return(Fib(n-1) + Fib(n-2)); } } The time complexity of the above code and time complexity of the same problem solved using dynamic programming is______ $A)O(n^{2}),O(n)$ $B)O(2^{n}),O(n)$ $C)O(2^{n}),O(n^{2})$ $D)$None of the above
Lakshman Bhaiya
asked
in
Algorithms
Nov 13, 2018
by
Lakshman Bhaiya
2.8k
views
algorithms
greedy-algorithm
dynamic-programming
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:...