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 Mar 27] Overview and Intro to ML in Elm
• [F Mar 31] Intro to ML in Elm (continued) and Intro to MVC in Elm
• [M Apr 03] Asymptotic Analysis and Persistence
• [F Apr 07] More Trees And Then...
• [M Apr 10] Heaps
• [F Apr 14] Leftist Heaps and Binomial Heaps
• [M Apr 17] More Random Elm
• [F Apr 21] Concurrency and Parallelism (Professor Reppy)
• [M Apr 24] Concurrency and Parallelism (continued)
• [F Apr 28] Midterm Exam
• [M May 01] Red-Black Trees
• [F May 05] Red-Black Trees: Delete
• [M May 08] Tail Recursion and Laziness
• [F May 12] Lazy Lists
• [M May 15] Queues and Amortized Analysis
• [F May 19] Lazy Queues and Real-Time Queues
• [M May 22] Testing and Beyond
• [F May 26] Final Exam
• [M May 29] No Class (Memorial Day)
• [F Jun 02] No Class (Reading Period)