Lecture Notes
These notes are not intended to be comprehensive, so reading them is not a good substitute for attending class and taking notes. The schedule is tentative and subject to change.
[M Apr 01]Overview and Intro to ML in Elm[F Apr 05]Intro to ML in Elm (continued) and Intro to MVC in Elm[M Apr 08]Intro to MVC in Elm (continued) and More Random Elm[F Apr 12]Asymptotic Analysis and Persistence[M Apr 15]More Trees And Then... and Heaps[F Apr 19]Leftist Heaps and Binomial Heaps[M Apr 22]Binomial Heaps (continued) and Red-Black Trees[F Apr 26]No Class (Elm in the Spring)[M Apr 29]Using Nicer Programming Languages at Work (Richard Feldman)[F May 03]Midterm Exam[M May 06]Queues and Amortized Analysis[F May 10]Tail Recursion and Laziness[M May 13]Laziness (continued)[F May 17]Laziness (continued) and Lazy Lists[M May 20]Lazy Queues[F May 24]Real-Time Queues[M May 27]No Class (Memorial Day)[F May 31]Dynamic and Static Contract Checking;Debug.todo "Holes"[M Jun 03]Final Exam[F Jun 07]No Class (Reading Period)
