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
1
made easy test series
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will store f(11) in stack. But if we call f(12) we wont be able to store it as overflow will occur.
Neelu Lalchandani
asked
in
Algorithms
Sep 30
by
Neelu Lalchandani
98
views
made-easy-test-series
stack
algorithms
dynamic-programming
0
votes
1
answer
2
Dynamic Programming
int max(int a, int b) { return (a > b) ? a : b; } // Returns the maximum value that can be // put in a knapsack of capacity W int knapSack(int W, int wt[], int val[], int n) { // Base Case if (n == 0 || W == 0) return 0; // If ... , wt, val, n - 1), knapSack(W, wt, val, n - 1)); } This statement implies that the max value return by the two different recursive problems right?
ryandany07
asked
in
Algorithms
Aug 18
by
ryandany07
104
views
algorithms
dynamic-programming
knapsack-problem
0
votes
0
answers
3
Best Open Video Playlist for Algorithm design techniques: Dynamic programming Topic | Algorithm
Please list out the best free available video playlist for Algorithm design techniques: Dynamic programming from Algorithm as an answer here (only one playlist per answer). We'll then select the best playlist ... more likely to be selected as best. For the full list of selected videos please see here
makhdoom ghaya
asked
in
Study Resources
Aug 18
by
makhdoom ghaya
29
views
go-classroom
video-links
missing-videos
free-videos
dynamic-programming
0
votes
1
answer
4
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 already ... value 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
Aug 6
by
Manisha Jaishwal
121
views
recursion
dynamic-programming
1
vote
1
answer
5
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
124
views
nielit-sta-2020
compiler-design
dynamic-programming
1
vote
1
answer
6
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
266
views
nielit-sta-2020
algorithms
dynamic-programming
knapsack-problem
time-complexity
1
vote
1
answer
7
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
166
views
nielit-sta-2020
algorithms
dynamic-programming
1
vote
4
answers
8
NIELIT 2016 DEC Scientist B (IT) - Section B: 52
Find the odd one out Merge Sort TVSP Problem Knapsack Problem OBST Problem
Lakshman Patel RJIT
asked
in
Algorithms
Mar 31, 2020
by
Lakshman Patel RJIT
2.4k
views
nielit2016dec-scientistb-it
algorithms
dynamic-programming
divide-and-conquer
0
votes
3
answers
9
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
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
by
Lakshman Patel RJIT
3.2k
views
nielit2017july-scientistb-cs
algorithms
dynamic-programming
0
votes
0
answers
10
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$
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
by
Lakshman Patel RJIT
478
views
nielit2017july-scientistb-cs
algorithms
dynamic-programming
1
vote
1
answer
11
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
477
views
cmi2019
algorithms
dynamic-programming
descriptive
non-gate
3
votes
3
answers
12
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
3.0k
views
ugcnetcse-june2019-paper2
optimal-solution
dynamic-programming
greedy-algorithm
0
votes
0
answers
13
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
507
views
algorithms
dynamic-programming
knapsack-problem
0
votes
2
answers
14
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
613
views
dynamic-programming
Page:
1
2
3
4
5
next »
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
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(645)
Exam Queries
(839)
Tier 1 Placement Questions
(17)
Job Queries
(73)
Projects
(9)
Unknown Category
(851)
Recent questions tagged dynamic-programming
Recent Blog Comments
"If you are dead tomorrow your GATE rank is not...
@saheb sarkar1997 Please check the Test...
Sir some test due date passed 1-2 months ago pls...
@lalitver10 There is no restriction in doing...
@GateOverflow04 link fixed now.