Fractional Knapsack | Dynamic Programming and Greedy | In English | Java | Video_12
6.8 هزار بار بازدید -
3 سال پیش
-
Please consume this content on
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. Description:
In this video, we cover the third of the Knapsack Problems i.e. the Fractional Knapsack problem where we are required to fill a knapsack such that the maximum value is obtained from the weights put into the sack without exceeding its capacity.
Question Name:
Fractional Knapsack
Question Link:
Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
Question Statement:
1. You are given a number n, representing the count of items.
2. You are given n numbers, representing the values of n items.
3. You are given n numbers, representing the weights of n items.
3. You are given a number "cap", which is the capacity of a bag you've.
4. You are required to calculate and print the maximum value that can be created in the bag without overflowing it's capacity.
Note1 -- Items can be added to the bag even partially. But you are not allowed to put same items again and again to the bag.
Topic: #DynamicProgramming #DP #fractionalknapsack #KnapsackProblems
Used #DataStructure: #2DArrays #Recursion #Memoization #Tabulation
--------------------------------------------------------------
Smimilar Questions:
1. Zero One Knapsack:
a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
2. Unbounded Knapsack:
a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
--------------------------------------------------------------
More Youtube PlayList:
Level 1 In Java English : Java Level 1 In English
Level 1 In Java Hindi : DSA - Level 1
Level 2 In Java Hindi : DSA - Level 2
Constructive Algorithm - Level 3 : Constructive Algorithm - Level 3
Geometry - Level 3 : Geometry Level 3
Maths for CP - Level 3 : Maths For CP - Level 3
DP - Level 3 : DP - Level 3
Euler Tour - Level 3 : Euler Tour - Level 3
Ternary Search : Ternary Search
Recursion & Backtracking - Level 1 : Recursion & Backtracking - Level 1
Recursion & Backtracking - Level 2 : Backtracking - Level 2
Graphs - Level 1 : Graphs - Level 1
Dyanmic Programming - Level 1 : Dynamic Programming - Level 1
Generic Trees - Level 1 : Generic Trees - Level 1
Time and Space - Level 1 : Time and Space - Level 1
---------------------------------------------------------------
Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.
We also provide professional courses with live classes and placement opportunities.
For more visit our website: https://bit.ly/2ZCS68a
For more free study resources, visit: https://bit.ly/3liICaJ
Have a look at our result: https://bit.ly/2YcmDZR
Follow us on our Youtube page: pepcoding
Follow us on our FB page: Facebook: pepcoding
Follow us on Instagram: Instagram: pepcoding
Follow us on LinkedIn: LinkedIn: pepcoding-education
Follow us on Pinterest: Pinterest: _created
Follow us on Twitter: Twitter: pepcoding
.
.
.
Happy Programming !!! Pep it up
----------------------------------------------------------------
#DP #DynamicProgramming #FractionalKnapsack
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. Description:
In this video, we cover the third of the Knapsack Problems i.e. the Fractional Knapsack problem where we are required to fill a knapsack such that the maximum value is obtained from the weights put into the sack without exceeding its capacity.
Question Name:
Fractional Knapsack
Question Link:
Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
Question Statement:
1. You are given a number n, representing the count of items.
2. You are given n numbers, representing the values of n items.
3. You are given n numbers, representing the weights of n items.
3. You are given a number "cap", which is the capacity of a bag you've.
4. You are required to calculate and print the maximum value that can be created in the bag without overflowing it's capacity.
Note1 -- Items can be added to the bag even partially. But you are not allowed to put same items again and again to the bag.
Topic: #DynamicProgramming #DP #fractionalknapsack #KnapsackProblems
Used #DataStructure: #2DArrays #Recursion #Memoization #Tabulation
--------------------------------------------------------------
Smimilar Questions:
1. Zero One Knapsack:
a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
2. Unbounded Knapsack:
a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
--------------------------------------------------------------
More Youtube PlayList:
Level 1 In Java English : Java Level 1 In English
Level 1 In Java Hindi : DSA - Level 1
Level 2 In Java Hindi : DSA - Level 2
Constructive Algorithm - Level 3 : Constructive Algorithm - Level 3
Geometry - Level 3 : Geometry Level 3
Maths for CP - Level 3 : Maths For CP - Level 3
DP - Level 3 : DP - Level 3
Euler Tour - Level 3 : Euler Tour - Level 3
Ternary Search : Ternary Search
Recursion & Backtracking - Level 1 : Recursion & Backtracking - Level 1
Recursion & Backtracking - Level 2 : Backtracking - Level 2
Graphs - Level 1 : Graphs - Level 1
Dyanmic Programming - Level 1 : Dynamic Programming - Level 1
Generic Trees - Level 1 : Generic Trees - Level 1
Time and Space - Level 1 : Time and Space - Level 1
---------------------------------------------------------------
Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.
We also provide professional courses with live classes and placement opportunities.
For more visit our website: https://bit.ly/2ZCS68a
For more free study resources, visit: https://bit.ly/3liICaJ
Have a look at our result: https://bit.ly/2YcmDZR
Follow us on our Youtube page: pepcoding
Follow us on our FB page: Facebook: pepcoding
Follow us on Instagram: Instagram: pepcoding
Follow us on LinkedIn: LinkedIn: pepcoding-education
Follow us on Pinterest: Pinterest: _created
Follow us on Twitter: Twitter: pepcoding
.
.
.
Happy Programming !!! Pep it up
----------------------------------------------------------------
#DP #DynamicProgramming #FractionalKnapsack
3 سال پیش
در تاریخ 1400/07/30 منتشر شده
است.
6,841
بـار بازدید شده