Recitation 21: Dynamic Programming: Knapsack Problem

Video quality	The size	Download

Информация о Recitation 21: Dynamic Programming: Knapsack Problem

Название	:	Recitation 21: Dynamic Programming: Knapsack Problem
Продолжительность	:	1.09.12
Дата публикации	:
Просмотров	:	194 rb

item 1: does it fit? great! what's its value? noteditem 2: does it fit? great! what's its value? noted is there any more space? yes! how much space? noted so and so on just store data in memory and do that over and over memory and resources are your constraints
Comment from : HigherLow1000

This guy is so handsome I wonder how he looks like now 🤔
Comment from : Shan

Can we take multiple of the same item?
Comment from : Ben Suen

why are you solving traveling salesman
Comment from : Jkauppa

Every professors famous words "I promise to answer any emails over weekend" Responds to none
Comment from : Adrian

Btw I forgett to enwrite for the exam so I have to re-do another semester due to me missing formal paper stuff I hate me
Comment from : H

anyone keep a counter on the number of times Victor has broken chalk? LOL
Comment from : Jan Michael Austria

I still don't get the reoccurrence relation It seems like it should be i-1
Comment from : abacusyou

@14:13 I'm confused by how the edge weights are calculated Perhaps I'm missing some prerequisite knowledge
Comment from : ChessFlix

Why are the students constantly laughing ? I feel like it's kinda of rude they are talking without raising their hands and giggling a lot
Comment from : Oliver Beck

A good video, it helped me a lot to understand the reading, thanks!!
Comment from : Banach Space

This cameraman and his zooming in ruins everything! Very good explanation though Thanks!
Comment from : Study

how the run time became in order of n times 2 power b in pseudo-polynomial runtime??
Comment from : Shradhye Shrestha

At 26:50 waiting for answers, he had his finger crossed :)
Comment from : Rishav Thakur

Sorry for the ignorance, but is the code/implementation of the knapsack problem absent, because it is obvious after lecturer's theoretical explanation?
Comment from : David Burdjanadze

58:19br"Once you said it it's a constant" he made my day lamo
Comment from : Mohamed Nofal

I don't get why the edges need to be negative I get what he's doing, of transforming it into a shortest path problem, but with a DAG, you can do longest path in the same time:brbr wwwgeeksforgeeksorg/find-longest-path-directed-acyclic-graph/
Comment from : kevin ryzack

Awesome 😍
Comment from : Saumya

0:20 - 26:30 Knapsack solved using graphs br26:30 - 48:25 Knapsack solved using DPbr48:25 - 1:00:00 pseudo-polynomial runtimebr1:00:00 - 1:09:11 shows why is Dijkstra not pseudo-polynomial but polynomial (also counting sort is pseudo-polynomial)
Comment from : Aleksa Gordić

nice shirt it's both a graphic Chinese version dragon and Chinese calligraphy dragon 龍。
Comment from : Yang Zhang

Worst lecture on the knapsacks problem There are many other smaller videos that do a better job He got 1 hour on this problem and this is the output Pretty bad
Comment from : vermoid vermoid

he is so cute and lecture was also good😍
Comment from : soni jha

my confusion is the decision of the nodes in the graph was it by trial and error? Once you know the nodes, the sp graph problem and dp is trivial Decision for graph nodes and dp sub problems is crucial
Comment from : The 90s kid remembers

"constant factors don't matter"brヽ(ಠ_ಠ)ノ
Comment from : fyras1

What series is this? What's the difference between this one and the one Erik did?
Comment from : Leo Chen

@48:40 which problems is he referring to? Problem set 7? There seem to be only two problems in that set
Comment from : Alex Merritt

Thanks, this helped me a lot
Comment from : Jyo Pari

Ugh , he has really terrible writing Hard to follow
Comment from : lkz 2

your students need to pay attention! theyre asking useless questions!
Comment from : Drikvy Cappenberg

super dude
Comment from : Aravind Thangavel

bad teaching, bad English Very bad instructorhe has no ability to teach better
Comment from : shahariar limon

he is a weasly
Comment from : dafemart dafemart

cool
Comment from : Mark Ganus

dude is a genius but his hand writing sucks
Comment from : SteveRunciman

To be honest, sloppy handwriting, heavy accent, all these do not make the lecture effective to the students I find Erik's sessions are more easy to follow
Comment from : KingsEagle

DP was not completely obvious after some workout I could understand how it worksbrthanks for the post
Comment from : Arun prasath

What an awesome lectureWay to go Professor
Comment from : Gerard Deepak

I pretty much got lost after he wrote the recursion of the DPI have no idea how they filled that table in
Comment from : Knot2goodAtIt

Nice stuffbrbra little problem with the subtitle/CC though on 1:07:56 (and some points later on as well) the sub-title guy wrote 'Rating sort' when it's supposed to be 'Radix sort'
Comment from : Ahmad Nasikun