...
Week | Day | Date | Topic | Work Assigned | Work Due |
|---|---|---|---|---|---|
1 | Tues | Aug 25 | |||
| Thur | Aug 27Course Tools and Setup | The Nature of Doubles, The Design Recipe | |||
2 | Tues | Sep 01 | Introduction to Scala | ||
| Thur | Sep 03 | Programming with Intention | Hwk 0 | |
3 | Tues | Sep 08 | Test-Driven Development | ||
| Thur | Sep 10 | Defining and Using Functions and Recursion | Hwk 1 | Hwk 0 | |
4 | Tues | Sep 15 | Referential Transparency and the Substitution Model | ||
| Thur | Sep 17 | Tail Recursion | Hwk 2 | Hwk 1 |
5 | Tues | Sep 22 | Lists and Functional Data Structures | ||
| Thurs | Sep 24 | Types, Type Systems, and Polymorphic Functions | Hwk 3 | Hwk 2 |
6 | Tues | Sep 29 | Programming with Options and Pattern Matching | ||
| Thur | Oct 01 | Map, Reduce, and Higher Order Functions | Hwk 4 | Hwk 3 |
7 | Tues | Oct 06 | Comprehensions and flatMap | ||
| Thurs | Oct 08 | Programs as Proofs and the Curry-Howard Isomorphism | ||
8 | Tues | Oct 13 | MIDTERM RECESS | ||
| Thur | Oct 15 | Contracts and Data Integrity | Hwk 5 | Hwk 4 |
9 | Tues | Oct 20 | Functional Leftist Heaps and Binomial Heaps | ||
| Thur | Oct 22 | Functional Red-Black Trees | Hwk 6 | Hwk 5 |
10 | Tues | Oct 27 | Strictness and Lazy Evaluation | ||
| Thur | Oct 29 | Stream Processing and Incremental I/O | Hwk 7 | Hwk 6 |
11 | Tues | Nov 03 | Closures, Effects, and the Environment Model | ||
| Thur | Nov 05 | Programming with Continuations | Hwk 8 | Hwk 7 |
12 | Tues | Nov 10 | Domain-Specific Languages with Higher Order Functions | ||
| Thur | Nov 12 | Parallelism and Functional Programming | Hwk 9 | Hwk 8 |
13 | Tues | Nov 17 | Big Data and Distributed Computing with Apache Spark | ||
| Thur | Nov 19 | DataFrames and Spark SQL | Hwk 10 | Hwk 9 |
| 14 | Tues | Nov 24 | Guest Lecture (TBA) | ||
| Thur | Nov 26 | THANKSGIVING | ||
15 | Tues | Dec 01 | Pipelines and SparkML (Machine Learning) | ||
| Thur | Dec 03 | Course Wrap Up | Hwk 10 |
...