@

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

DYNAMIC PROGRAMMING

Parshu gate asked in Algorithms Sep 17, 2017 recategorized Jul 6, 2022 by Lakshman Bhaiya

438 views

0 votes

0 votes

algorithms
dynamic-programming
graph-theory

Parshu gate asked in Algorithms Sep 17, 2017 recategorized Jul 6, 2022 by Lakshman Bhaiya

438 views

2 Comments

commented Nov 26, 2018

can anyone confirm this question i am getting 33

0

0

commented Jan 24, 2020

https://www.geeksforgeeks.org/number-of-paths-from-source-to-destination-in-a-directed-acyclic-graph/

0

0

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

← Previous Next →

← Previous in category Next in category →

Related questions

1 vote

1 vote

0 answers

1

rasto mapp asked in Algorithms Jan 21, 2018

850 views

Ace Test Series: Algorithms - Dynamic Programming Optimal Merging Of Files
I got 206???

rasto mapp asked in Algorithms Jan 21, 2018

850 views

ace-test-series
algorithms
dynamic-programming
merging
graph-theory
optimal-merge-pattern

0 votes

0 votes

0 answers

2

Sahil_Lather asked in Algorithms Jan 28, 2023

357 views

TestBook testSeries dynamic programming and np problem question
Consider the following statements, which of the statement(s) is/are FALSE? The running time of dynamic programming algorithm is always θ (p) where p is number of subproblems When a recurrence relation has cyclic dependency, it is ... memorization If a problem X can be reduced to a known NP hard problem, then X must be NP-hard

Sahil_Lather asked in Algorithms Jan 28, 2023

by Sahil_Lather

357 views

algorithms
dynamic-programming
testbook-test-series

0 votes

0 votes

1 answer

3

ryandany07 asked in Algorithms Aug 18, 2022

803 views

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, 2022

803 views

algorithms
dynamic-programming
knapsack-problem

0 votes

0 votes

1 answer

4

Nandkishor3939 asked in Algorithms Jan 22, 2019

719 views

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

719 views

algorithms
dynamic-programming
programming
test-series

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 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:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!