Coursera - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

[0dayddl]

​

Download Free Download : Coursera - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
mp4 | Video: h264,1280X720 | Audio: AAC, 44.1 KHz
Genre:eLearning | Language: English | Size:1.24 GB
​

Files Included :

Spoiler

04 application-internet-routing.mp4 (19.19 MB)
MP4
05 application-sequence-alignment.mp4 (14.86 MB)
MP4
01 introduction-to-greedy-algorithms.mp4 (26.67 MB)
MP4
02 application-optimal-caching.mp4 (21.3 MB)
MP4
01 problem-definition.mp4 (11.08 MB)
MP4
02 a-greedy-algorithm.mp4 (24.8 MB)
MP4
03 correctness-proof-part-i.mp4 (12.75 MB)
MP4
04 correctness-proof-part-ii.mp4 (8.87 MB)
MP4
05 handling-ties-advanced-optional.mp4 (13.65 MB)
MP4
01 mst-problem-definition.mp4 (20.07 MB)
MP4
02 prims-mst-algorithm.mp4 (13.71 MB)
MP4
03 correctness-proof-i.mp4 (23.52 MB)
MP4
04 correctness-proof-ii.mp4 (12.95 MB)
MP4
05 proof-of-cut-property-advanced-optional.mp4 (19.3 MB)
MP4
06 fast-implementation-i.mp4 (26.6 MB)
MP4
07 fast-implementation-ii.mp4 (18.11 MB)
MP4
02 kruskals-mst-algorithm.mp4 (17.03 MB)
MP4
03 correctness-of-kruskals-algorithm.mp4 (16.58 MB)
MP4
04 implementing-kruskals-algorithm-via-union-find-i.mp4 (18.25 MB)
MP4
05 implementing-kruskals-algorithm-via-union-find-ii.mp4 (27.16 MB)
MP4
06 msts-state-of-the-art-and-open-questions-advanced-optional.mp4 (21.71 MB)
MP4
01 application-to-clustering.mp4 (20.32 MB)
MP4
02 correctness-of-clustering-algorithm.mp4 (15.18 MB)
MP4
01 lazy-unions-advanced-optional.mp4 (27.82 MB)
MP4
02 union-by-rank-advanced-optional.mp4 (36.96 MB)
MP4
03 analysis-of-union-by-rank-advanced-optional.mp4 (44.01 MB)
MP4
04 path-compression-advanced-optional.mp4 (39.35 MB)
MP4
05 path-compression-the-hopcroft-ullman-analysis-i-advanced-optional.mp4 (25.72 MB)
MP4
06 path-compression-the-hopcroft-ullman-analysis-ii-advanced-optional.mp4 (32.24 MB)
MP4
07 the-ackermann-function-advanced-optional.mp4 (39.52 MB)
MP4
08 path-compression-tarjans-analysis-i-advanced-optional.mp4 (37.41 MB)
MP4
09 path-compression-tarjans-analysis-ii-advanced-optional.mp4 (33.97 MB)
MP4
02 introduction-and-motivation.mp4 (16.79 MB)
MP4
03 problem-definition.mp4 (23.42 MB)
MP4
04 a-greedy-algorithm.mp4 (38.78 MB)
MP4
05 a-more-complex-example.mp4 (8.98 MB)
MP4
06 correctness-proof-i.mp4 (18.14 MB)
MP4
07 correctness-proof-ii.mp4 (23.1 MB)
MP4
01 introduction-weighted-independent-sets-in-path-graphs.mp4 (17.23 MB)
MP4
02 wis-in-path-graphs-optimal-substructure.mp4 (25.38 MB)
MP4
03 wis-in-path-graphs-a-linear-time-algorithm.mp4 (28.36 MB)
MP4
04 wis-in-path-graphs-a-reconstruction-algorithm.mp4 (18.23 MB)
MP4
05 principles-of-dynamic-programming.mp4 (27.7 MB)
MP4
02 the-knapsack-problem.mp4 (27.8 MB)
MP4
03 a-dynamic-programming-algorithm.mp4 (25.5 MB)
MP4
04 example-review-optional.mp4 (46.85 MB)
MP4
01 optimal-substructure.mp4 (36.21 MB)
MP4
02 a-dynamic-programming-algorithm.mp4 (25.54 MB)
MP4
01 problem-definition.mp4 (30.07 MB)
MP4
02 optimal-substructure.mp4 (27.43 MB)
MP4
03 proof-of-optimal-substructure.mp4 (19.15 MB)
MP4
04 a-dynamic-programming-algorithm-i.mp4 (24.59 MB)
MP4
05 a-dynamic-programming-algorithm-ii.mp4 (19.65 MB)
MP4

Bitte Anmelden oder Registrieren um Code Inhalt zu sehen!

Bitte Anmelden oder Registrieren um Code Inhalt zu sehen!