CS 51 Notes

By Melissa Kwan, [email protected]

Code Review 1: Intro to Functional Programming

Date: 2/4

• Why CS 51?
• Partial application
• Motivating polymorphic types
• General course advice

Code Review 2: Types, Higher-Order Functions, and Options

Date: 2/11

• Recursive strategies
• Partial application + currying
• Relative power of higher-order functions
  • Write map using fold
• Motivating polymorphic types
• Options (Some and None)

Code Review 3: Algebraic Data Types, Nested Data Structures

Date: 2/18

• Software design and style
• Algebraic types, records, etc.
• Trees and nested data structures
• Intuition on PSET 3

Code Review 4: Modules and Functors

Date: 2/25

• Modules vs. signatures
• Safe modules vs. unsafe modules
• Sharing constraints

Code Review 5: Midterm Review

Date: 3/4

• Higher-order functions
• Modules & functors
• Recursive data types

Code Review 6: Semantics & Time Complexity (Skipped)

Code Review 7: Imperative Programming & Graph Search

Date: 3/25

• Tail recursion
• Mutable data types (useful for PSET 7)
• Depth first search (DFS) and breadth first search (BFS)

Code Review 8: Infinite Data Structures

Date: 4/1

• Infinite streams
• Naive vs. Lazy
• Composing streams
• Lazy trees

Code Review 9: Object-oriented Programming

Date: 4/8

Code Review 10: Semantics

Date: 4/15

Code Review 11: Midterm Review

Date: 4/22