Algorithms

Notes, code and problem solutions for the following discrete mathematics and algorithms courses and books:

• Algorithms: Design and Analysis: lectures by Tim Roughgarden (Stanford)
• Mathematics for Computer Science 6.042J: lectures by Tom Leighton and Marten van Dijk (MIT)
• Algorithms: textbook by Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani

TODO

6042j

• Read chapter 1
  • Make flashcards
• Watch lecture 1
• Start homework 1
• Read chapter 2
  • Make flashcards
• Watch lecture 2
• Finish homework 1
• Read chapter 3
  • Make flashcards
• Watch lecture 3
• Do homework 2
• Watch lecture 4
• Watch lecture 5
• Finish chapter 4
  • Make flashcards
• Do homework 2

dpv

• Read chapter 0
  • Make flashcards
• Do homework 0
• Read chapter 1
  • Finish flashcards
• Do implementations from chapter 1
• Write tests for implementations from chapter 1
• Do most of homework 1
• Do exercise 1.37 (Chinese remainder theorem)
• Do ex 1.45 and 1.46 (digital signatures)