Introduction to Algorithms (MIT 6.006) - Video lectures 2020
Erik Demaine and Jason Ku and Justin Solomon

folder MIT6.006S20 (198 files)
file__ia_thumb.jpg 6.67kB
fileMIT6_006S20_05_12_Lecture_21_300k_uk.srt 145.52kB
fileMIT6_006S20_05_12_Lecture_21_300k.srt 103.24kB
fileMIT6_006S20_05_12_Lecture_21_300k.mp4 138.43MB
fileMIT6_006S20_05_05_Lecture_20_300k_uk.srt 100.47kB
fileMIT6_006S20_05_05_Lecture_20_300k.srt 72.55kB
fileMIT6_006S20_05_05_Lecture_20_300k.mp4 130.45MB
fileMIT6_006S20_05_02_Quiz_3_Review_300k_uk.srt 147.31kB
fileMIT6_006S20_05_02_Quiz_3_Review_300k.srt 108.75kB
fileMIT6_006S20_05_02_Quiz_3_Review_300k.mp4 193.16MB
fileMIT6_006S20_05_01_Problem_Session_9_300k_uk.srt 181.69kB
fileMIT6_006S20_05_01_Problem_Session_9_300k.srt 133.18kB
fileMIT6_006S20_05_01_Problem_Session_9_300k.mp4 197.22MB
fileMIT6_006S20_04_30_Lecture_19_300k_uk.srt 123.66kB
fileMIT6_006S20_04_30_Lecture_19_300k.srt 89.11kB
fileMIT6_006S20_04_30_Lecture_19_300k.mp4 138.27MB
fileMIT6_006S20_04_28_Lecture_18_300k_uk.srt 146.49kB
fileMIT6_006S20_04_28_Lecture_18_300k.srt 95.38kB
fileMIT6_006S20_04_28_Lecture_18_300k.mp4 148.72MB
fileMIT6_006S20_04_23_Lecture_17_300k_uk.srt 135.02kB
fileMIT6_006S20_04_23_Lecture_17_300k.srt 97.57kB
fileMIT6_006S20_04_23_Lecture_17_300k.mp4 148.02MB
fileMIT6_006S20_04_17_Problem_Session_8_300k_uk.srt 212.55kB
fileMIT6_006S20_04_17_Problem_Session_8_300k.srt 155.65kB
fileMIT6_006S20_04_17_Problem_Session_8_300k.mp4 216.41MB
fileMIT6_006S20_04_16_Lecture_16_300k_uk.srt 119.67kB
fileMIT6_006S20_04_16_Lecture_16_300k.srt 87.38kB
fileMIT6_006S20_04_16_Lecture_16_300k.mp4 138.25MB
fileMIT6_006S20_04_14_Lecture_15_300k_uk.srt 119.55kB
fileMIT6_006S20_04_14_Lecture_15_300k.srt 85.75kB
fileMIT6_006S20_04_14_Lecture_15_300k.mp4 134.55MB
fileMIT6_006S20_04_13_Quiz_2_Review_300k_uk.srt 183.06kB
fileMIT6_006S20_04_13_Quiz_2_Review_300k.srt 115.03kB
fileMIT6_006S20_04_13_Quiz_2_Review_300k.mp4 190.40MB
fileMIT6_006S20_04_09_Lecture_14_300k_uk.srt 81.94kB
fileMIT6_006S20_04_09_Lecture_14_300k.srt 59.90kB
fileMIT6_006S20_04_09_Lecture_14_300k.mp4 132.20MB
fileMIT6_006S20_04_07_Problem_Session_7_300k_uk.srt 184.77kB
fileMIT6_006S20_04_07_Problem_Session_7_300k.srt 137.48kB
fileMIT6_006S20_04_07_Problem_Session_7_300k.mp4 200.90MB
fileMIT6_006S20_04_07_Lecture_13_300k_uk.srt 89.18kB
fileMIT6_006S20_04_07_Lecture_13_300k.srt 66.46kB
fileMIT6_006S20_04_07_Lecture_13_300k.mp4 134.40MB
fileMIT6_006S20_03_19_Lecture_12_300k_uk.srt 87.05kB
fileMIT6_006S20_03_19_Lecture_12_300k.srt 64.62kB
fileMIT6_006S20_03_19_Lecture_12_300k.mp4 134.38MB
fileMIT6_006S20_03_13_Problem_Session_5_300k_uk.srt 192.38kB
fileMIT6_006S20_03_13_Problem_Session_5_300k.srt 141.62kB
fileMIT6_006S20_03_13_Problem_Session_5_300k.mp4 206.29MB
Too many files! Click here to view them all.
Type: Course

Metadata:
@article{,
title= {Introduction to Algorithms (MIT 6.006) - Video lectures 2020},
journal= {},
author= {Erik Demaine and Jason Ku and Justin Solomon},
year= {2020},
url= {https://ocw.mit.edu/6-006S20},
abstract= {This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems.

**Main course URL:** https://ocw.mit.edu/6-006S20

**Table of contents:**

* Lecture 1: Algorithms and Computation
* Lecture 2: Data Structures and Dynamic Arrays
* Lecture 3: Sets and Sorting
* Lecture 4: Hashing
* Lecture 5: Linear Sorting
* Lecture 6: Binary Trees, Part 1
* Lecture 7: Binary Trees, Part 2: AVL
* Lecture 8: Binary Heaps
* Lecture 9: Breadth-First Search
* Lecture 10: Depth-First Search
* Lecture 11: Weighted Shortest Paths
* Lecture 12: Bellman-Ford
* Lecture 13: Dijkstra
* Lecture 14: APSP and Johnson
* Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
* Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins
* Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano
* Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial
* Lecture 19: Complexity
* Lecture 20: Course Review
* Lecture 21: Algorithms—Next Steps

This content hosted at the Internet Archive at https://archive.org/details/MIT6.006S20
Files may have changed, which prevents torrents from downloading correctly or completely; please check for an updated torrent at https://archive.org/download/MIT6.006S20/MIT6.006S20_archive.torrent
Note: retrieval usually requires a client that supports webseeding (GetRight style).
Note: many Internet Archive torrents contain a 'pad file' directory. This directory and the files within it may be erased once retrieval completes.
Note: the file MIT6.006S20_meta.xml contains metadata about this torrent's contents.},
keywords= {Computer Science, Programming, algorithms, computer engineering},
terms= {https://ocw.mit.edu/terms},
license= {https://creativecommons.org/licenses/by-nc-sa/4.0/},
superseded= {}
}

Citation:
Demaine, E., Ku, J., & Solomon, J.. (2020). Introduction to Algorithms (MIT 6.006) - Video lectures 2020 [Data set]. Academic Torrents. https://academictorrents.com/details/1e6d57c0d31127fe9b97f5aac62c43c4fd9ffa65
10 day statistics (8 downloads)
Average Time 1 hrs, 25 mins, 40 secs
Average Speed 995.44kB/s
Best Time 12 mins, 24 secs
Best Speed 6.88MB/s
Worst Time 4 hrs, 38 mins, 57 secs
Worst Speed 305.73kB/s

Send Feedback Start
   0.000006
DB Connect
   0.000451
Lookup hash in DB
   0.000400
Get torrent details
   0.000137
Get torrent details, finished
   0.000213
Get authors
   0.000030
Parse bibtex
   0.000170
Write header
   0.000223
get stars
   0.000112
home tab
   0.000472
render right panel
   0.000006
render ads
   0.000355
fetch current hosters
   0.000225
Start get stats
   0.000629
End get stats
   0.000002
related datasets
   0.004271
Done