| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 1851 |
R22. Dynamic Programming: Dance Dance Revolution (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1852 |
4. Heaps and Heap Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1853 |
R23. Computational Complexity (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1854 |
5. Binary Search Trees, BST Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1855 |
R24. Final Exam Review (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1856 |
6. AVL Trees, AVL Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1857 |
R3. Document Distance, Insertion and Merge Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1858 |
7. Counting Sort, Radix Sort, Lower Bounds for Sorting (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1859 |
R5. Recursion Trees, Binary Search Trees (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1860 |
8. Hashing with Chaining (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1861 |
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1862 |
9. Table Doubling, Karp-Rabin (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1863 |
R7. Comparison Sort, Counting and Radix Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1864 |
R1. Asymptotic Complexity, Peak Finding (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1865 |
R8. Simulation Algorithms (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1866 |
R9. Rolling Hashes, Amortized Analysis (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1867 |
Recitation 9b: DNA Sequence Matching (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1868 |
1. Introduction, Optimization Problems (M-I-T)
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
| 1869 |
10. Understanding Experimental Data (cont.) (M-I-T)
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
| 1870 |
11. Introduction to Machine Learning (M-I-T)
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
| 1871 |
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
| 1872 |
13. Classification (M-I-T)
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
| 1873 |
14. Classification and Statistical Sins (M-I-T)
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
| 1874 |
15. Statistical Sins and Wrap Up (M-I-T)
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
| 1875 |
2. Optimization Problems (M-I-T)
|
Introduction to Computational Thinking and Data Science, Fall 2016 (M-I-T)
|
MIT
|
John Guttag
|
Applied Sciences
|
