วีดีโอ

Very helpful in my simulation class. Thank you.

GD, great videos. WHat is the name of the software?

When it came time to analyse flow toward sink 2, wasn't the 800 edge limited to just 500 capacity? I.e. doesn’t a flow of 200 reduce the 500 capacity down to 300 (rather than decreasing the original 800 to 600)? Asking for broader applications.

Good video. The second last example was wrong, cut E equalled 38, not 33, making the multichoice answer C.

For the second example-should you just reduce A or F by 1 week (as it says maximum of 2 weeks can be applied-not that you have to reduce by 2 weeks)? If a 1 week reduction is applied, the critical path time will still be 14 weeks, with an overall reduction of 1 week. Would this be correct?

think it's 1week, not 1 minute saved on the second example. Thanks for the videos-very helpful.

thanks so much

Professor,have you teached diagonalization

legend

Thank you very much. I have been searching for a video that explains the backtracking, most channels just tell you the route without showing how to derive it from the table. I was solving the table and was using another method to find the route via the diagram as I didn't know how to backtrack. Also my exam is in 6 hours.

thank you so much!!

Thank you so much for breaking this down in simple terms. This was very helpful in preparing for my final exam!😊

Very helpful-can you add the other links to the other crashing of multiple vents? If possible could you add a video of the 2023 Exam 2 final question? Thanks

You don't know what a big favor you've done me.

Love your pronunciation

Beautiful explanation. Thank you.

These videos are awesome! This one helped me majorly for my data analysis sac! Thankss 👍

Lady you put the guy who invented it probably to shame, best explanation.

what the fuck

loved your way of working out minimum spanning tree. so much easier to understand.

Excellent videos.

I'm truly grateful to you. Thanks a lot mam.

You really grasp the essence. thanks a lot for this brilliant video♥♥

yo this vid is totes litness

Thank you so much.

how can I determine annual oscillation, Semiannual oscillation and triannual oscillation in a given temperature data

Pls ma what if we are asked to find the nth term, like the formula without formula, pls ma reply.

thank you!!!!!!!!!

best channel out wtf

We are building a loan management system and this is very informative. Thank you for your efforts, we greatly appreciate

Whoever made this, thankyou so much for making it publicly available. Incredibly helpful

the maximum flow by saturation is only guaranteed by drawing in the minimum cut from the "0" or saturated edges. Just by adding the path values does not guarantee the maximum flow

thank u for this mr siddiqui and mr chan approve :D plus the tutor

I know this was done during the pandemic but this is so useful to me this year, thank you

Hey, I'm not sure if you'll see this, but what do we do if the explanatory variable is numerical & the response is catagorical? Eg. Income per year and size of the house (small, medium, large)

Thanks

keep this up!

This is the best tutorial on this topic I’ve seen so far. Thank you!

thanks a lot

Hiiii what if the question is asking for an even number median smoothing with centring ? Eg. 4 median smoothing with centring (are we able to do it graphically or can we only do it numerically?)

Well explained

is the last option on the E row meant to be a total of 9, not 8 . I know it's 7 as shortest option, but the other option is 9 (3+1+5) isn't it?

Nice explanation mam thank you

A smart explanation of Dijkstra’s algorithm with table method!

A smart table explanation for Dijkstra’s algorithm!

Thank you so much for this wonderfull exaplanation! I was trying to follow along with the cambridge textbook example but there were just somethings that wernt explain very well such as putting in the already connect weight for a vertex when there is no direct connection from the row vertex. You did such a great job explain this method, I finally understand it now.

The best explanation of Dijkstra's algorithm, without using subscripts like other people's explanations, making the table look very clean👍🏻👍🏼👍🏽👍🏾👍🏿

I crearly understand. Great explaination. Thank you so much :)

In NSW syllabus I think this is called the "method of exhaustion", as you keep going until all possible flows are exhausted. It looks a bit hard to read if you get distracted part way through, with numbers crossed out and rewritten a few places. Perhaps an edge that has been exhausted could be highlighted so it stands out as exhausted.

Finally someone that explains this perfect… I’ve watched 5 indian people and they explain really really baaaaad.. Thank you!