Started 6.006 spring 2020

hrushikeshrv · Oct 15, 2024 · 4bb617f · 4bb617f
1 parent baa02eb
commit 4bb617f
Show file tree

Hide file tree

Showing 23 changed files with 63 additions and 26 deletions.
diff --git a/6.006/index.md → 6.006/fall-2011/index.md b/6.006/index.md → 6.006/fall-2011/index.md
@@ -21,17 +21,17 @@ problems.
 [Lecture Videos (YouTube)](https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
 
 ## Lectures
-1. [Algorithmic Thinking, Peak Finding]({% link 6.006/lec1.md %})
-2. [Models of Computation, Document Distance]({% link 6.006/lec2.md %})
-3. [Insertion Sort, Merge Sort]({% link 6.006/lec3.md %})
-4. [Heaps and Heap Sort]({% link 6.006/lec4.md %})
-5. [Binary Search Trees, BST Sort]({% link 6.006/lec5.md %})
-6. [AVL Trees, AVL Sort]({% link 6.006/lec6.md %})
-7. [Counting Sort, Radix Sort, Lower Bounds for Sorting]({% link 6.006/lec7.md %})
-8. [Hashing with Chaining]({% link 6.006/lec8.md %})
-9. [Table Doubling, Karp Rabin]({% link 6.006/lec9.md %})
-10. [Open Addressing, Cryptographic Hashing]({% link 6.006/lec10.md %})
-16. [Dijkstra]({% link 6.006/lec16.md %})
-17. [Bellman-Ford]({% link 6.006/lec17.md %})
-18. [Speeding up Dijkstra]({% link 6.006/lec18.md %})
-19. [Dynamic Programming 1: Fibonacci, Shortest Paths]({% link 6.006/lec19.md %})
+1. [Algorithmic Thinking, Peak Finding]({% link 6.006/fall-2011/lec1.md %})
+2. [Models of Computation, Document Distance]({% link 6.006/fall-2011/lec2.md %})
+3. [Insertion Sort, Merge Sort]({% link 6.006/fall-2011/lec3.md %})
+4. [Heaps and Heap Sort]({% link 6.006/fall-2011/lec4.md %})
+5. [Binary Search Trees, BST Sort]({% link 6.006/fall-2011/lec5.md %})
+6. [AVL Trees, AVL Sort]({% link 6.006/fall-2011/lec6.md %})
+7. [Counting Sort, Radix Sort, Lower Bounds for Sorting]({% link 6.006/fall-2011/lec7.md %})
+8. [Hashing with Chaining]({% link 6.006/fall-2011/lec8.md %})
+9. [Table Doubling, Karp Rabin]({% link 6.006/fall-2011/lec9.md %})
+10. [Open Addressing, Cryptographic Hashing]({% link 6.006/fall-2011/lec10.md %})
+16. [Dijkstra]({% link 6.006/fall-2011/lec16.md %})
+17. [Bellman-Ford]({% link 6.006/fall-2011/lec17.md %})
+18. [Speeding up Dijkstra]({% link 6.006/fall-2011/lec18.md %})
+19. [Dynamic Programming 1: Fibonacci, Shortest Paths]({% link 6.006/fall-2011/lec19.md %})
diff --git a/6.006/lec1.md → 6.006/fall-2011/lec1.md b/6.006/lec1.md → 6.006/fall-2011/lec1.md
diff --git a/6.006/lec10.md → 6.006/fall-2011/lec10.md b/6.006/lec10.md → 6.006/fall-2011/lec10.md
diff --git a/6.006/lec16.md → 6.006/fall-2011/lec16.md b/6.006/lec16.md → 6.006/fall-2011/lec16.md
diff --git a/6.006/lec17.md → 6.006/fall-2011/lec17.md b/6.006/lec17.md → 6.006/fall-2011/lec17.md
diff --git a/6.006/lec18.md → 6.006/fall-2011/lec18.md b/6.006/lec18.md → 6.006/fall-2011/lec18.md
diff --git a/6.006/lec19.md → 6.006/fall-2011/lec19.md b/6.006/lec19.md → 6.006/fall-2011/lec19.md
diff --git a/6.006/lec2.md → 6.006/fall-2011/lec2.md b/6.006/lec2.md → 6.006/fall-2011/lec2.md
diff --git a/6.006/lec20.md → 6.006/fall-2011/lec20.md b/6.006/lec20.md → 6.006/fall-2011/lec20.md
diff --git a/6.006/lec3.md → 6.006/fall-2011/lec3.md b/6.006/lec3.md → 6.006/fall-2011/lec3.md
diff --git a/6.006/lec4.md → 6.006/fall-2011/lec4.md b/6.006/lec4.md → 6.006/fall-2011/lec4.md
diff --git a/6.006/lec5.md → 6.006/fall-2011/lec5.md b/6.006/lec5.md → 6.006/fall-2011/lec5.md
diff --git a/6.006/lec6.md → 6.006/fall-2011/lec6.md b/6.006/lec6.md → 6.006/fall-2011/lec6.md
diff --git a/6.006/lec7.md → 6.006/fall-2011/lec7.md b/6.006/lec7.md → 6.006/fall-2011/lec7.md
diff --git a/6.006/lec8.md → 6.006/fall-2011/lec8.md b/6.006/lec8.md → 6.006/fall-2011/lec8.md
diff --git a/6.006/lec9.md → 6.006/fall-2011/lec9.md b/6.006/lec9.md → 6.006/fall-2011/lec9.md
diff --git a/6.006/media/lec19-1.jpg → 6.006/fall-2011/media/lec19-1.jpg b/6.006/media/lec19-1.jpg → 6.006/fall-2011/media/lec19-1.jpg
diff --git a/6.006/media/lec6-1.jpg → 6.006/fall-2011/media/lec6-1.jpg b/6.006/media/lec6-1.jpg → 6.006/fall-2011/media/lec6-1.jpg
diff --git a/6.006/media/lec6-2.jpg → 6.006/fall-2011/media/lec6-2.jpg b/6.006/media/lec6-2.jpg → 6.006/fall-2011/media/lec6-2.jpg
diff --git a/6.006/spring-2020/index.md b/6.006/spring-2020/index.md
@@ -0,0 +1,20 @@
+---
+layout: default
+title: MIT 6.006 - Introduction to Algorithms (Spring 2020)
+nav_order: 2
+has_children: true
+has_toc: false
+---
+
+# MIT 6.006 - Introduction to Algorithms
+Taught by Prof. Erik Demaine, Dr. Jason Ku, and Prof. Justin Solomon
+
+## Course Description
+This is an introductory course covering elementary data structures (dynamic arrays, heaps, balanced binary search trees, hash tables) and algorithmic approaches to solve classical problems (sorting, graph searching, dynamic programming). Introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. Emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.
+
+[Course Website](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/)
+[Lecture Videos (YouTube)](https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY)
+
+## Lectures
+1. [Algorithms and Computation]({% link 6.006/spring-2020/lec1.md %})
+2. [Data Structures and Dynamic Arrays]({% link 6.006/spring-2020/lec2.md %})
diff --git a/6.006/spring-2020/lec1.md b/6.006/spring-2020/lec1.md
@@ -0,0 +1,8 @@
+---
+layout: default
+title: Lecture 1 - Algorithms and Computation
+parent: MIT 6.006 - Introduction to Algorithms (Spring 2020)
+nav_order: 1
+---
+
+# Lecture 1 - Algorithms and Computation
diff --git a/6.006/spring-2020/lec2.md b/6.006/spring-2020/lec2.md
@@ -0,0 +1,8 @@
+---
+layout: default
+title: Lecture 2 - Data Structures and Dynamic Arrays
+parent: MIT 6.006 - Introduction to Algorithms (Spring 2020)
+nav_order: 2
+---
+
+# Lecture 2 - Data Structures and Dynamic Arrays
diff --git a/index.md b/index.md
@@ -13,15 +13,16 @@ This work is licensed under the Creative Commons license -
 [(CC BY-NC-SA 4.0)](https://creativecommons.org/licenses/by-nc-sa/4.0/)
 
 # Course List
-1. [MIT 6.006 - Introduction to Algorithms]({% link 6.006/index.md %})
-2. [MIT 6.042J - Mathematics for Computer Science](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.ol0v6d6j0pp6)
-3. [MIT 6.046J - Design and Analysis of Algorithms]({% link 6.046/index.md %})
-4. [MIT 6.004 - Computation Structures](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.uetcvbt511e3)
-5. [MIT 6.01SC - Introduction to Electrical Engineering & Computer Science - 1](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.sj0f8ojnbzed)
-6. [MIT 6.045J - Automata, Computability, Complexity]({% link 6.045J/index.md %})
-7. [MIT 6.172 - Performance Engineering of Software Systems](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.11w7nhxufzh9)
-8. [MIT 6.890 - Algorithmic Lower Bounds](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.j62llohq37q3)
-9. [MIT 6.851 - Advanced Data Structures](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.y6d0wld558lb)
-10. [CMU 15-445 - Database Systems]({% link CMU15445/index.md %})
-11. [UCB CS 162 - Operating Systems & Systems Programming]({% link CS162/index.md %})
-12. [MIT 6.858 - Computer Systems Security]({% link 6.858/index.md %})
+1. [MIT 6.006 - Introduction to Algorithms - Fall 2011]({% link 6.006/fall-2011/index.md %})
+2. [MIT 6.006 - Introduction to Algorithms - Spring 2020]({% link 6.006/spring-2020/index.md %})
+3. [MIT 6.042J - Mathematics for Computer Science](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.ol0v6d6j0pp6)
+4. [MIT 6.046J - Design and Analysis of Algorithms]({% link 6.046/index.md %})
+5. [MIT 6.004 - Computation Structures](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.uetcvbt511e3)
+6. [MIT 6.01SC - Introduction to Electrical Engineering & Computer Science - 1](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.sj0f8ojnbzed)
+7. [MIT 6.045J - Automata, Computability, Complexity]({% link 6.045J/index.md %})
+8. [MIT 6.172 - Performance Engineering of Software Systems](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.11w7nhxufzh9)
+9. [MIT 6.890 - Algorithmic Lower Bounds](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.j62llohq37q3)
+10. [MIT 6.851 - Advanced Data Structures](https://docs.google.com/document/d/1R45m9aDnBevrHaDSq0DdEzmRHZFV40cQ41g7GezPBK8/edit#heading=h.y6d0wld558lb)
+11. [CMU 15-445 - Database Systems]({% link CMU15445/index.md %})
+12. [UCB CS 162 - Operating Systems & Systems Programming]({% link CS162/index.md %})
+13. [MIT 6.858 - Computer Systems Security]({% link 6.858/index.md %})