Best guess at roadmap for Part 2

Author: luccaflower

docs/computer-science/theory/index.md

@@ -42,6 +42,24 @@ Primary topics: WIP
 - Watch 14.1-16.2
 - Do [Programming Assignment #2.4: Two-Sum](https://github.com/beaunus/stanford-algs/tree/master/testCases/course2/assignment4TwoSum)
 
+### Part 2
+- Watch 1-21
+- Do [Programming Assignment #3.1: Scheduling And Minimums Spanning Trees](https://github.com/beaunus/stanford-algs/tree/master/testCases/course3/assignment1SchedulingAndMST)
+- Watch 22-32
+- Do [Programming Assignment #3.2: Clustering](https://github.com/beaunus/stanford-algs/tree/master/testCases/course3/assignment2Clustering)
+- Watch 33-43
+- Do [Programming Assignment #3.3: Huffman And Maximum Weight Independent Sets](https://github.com/beaunus/stanford-algs/tree/master/testCases/course3/assignment3HuffmanAndMWIS)
+- Watch 44-48
+- Do [Programming Assignment #3.4: Knapsack](https://github.com/beaunus/stanford-algs/tree/master/testCases/course3/assignment4Knapsack)
+- Watch 49-67
+- Do [Programming Assignment #4.1: All Apirs Shortest Path](https://github.com/beaunus/stanford-algs/tree/master/testCases/course4/assignment1AllPairsShortestPath)
+- Watch 68-78
+- Do [Programming Assignment #4.2: Traveling Salesman](https://github.com/beaunus/stanford-algs/tree/master/testCases/course4/assignment2TSP)
+- Watch 79-84
+- Do [Programming Assignment #4.3: Traveling Salesman Heuristic](https://github.com/beaunus/stanford-algs/tree/master/testCases/course4/assignment3TSPHeuristic)
+- Watch 85-95
+- Do [Programming Assignment #4.4: 2SAT](https://github.com/beaunus/stanford-algs/tree/master/testCases/course4/assignment4TwoSat)
 
 ## Extra Resources
-- [Coursera Alogorithms Specialization](https://www.coursera.org/specializations/algorithms): For students that want access to extra theory problems as well as paid certificate.
+- [Coursera Alogorithms Specialization](https://www.coursera.org/specializations/algorithms)  
+  For students that want access to extra theory problems as well as paid certificate.