CS 135: Designing Functional Programs

Fall 2017 Calendar

This page contains information on the rough timing of topics, assignment due dates, exam dates, and other important milestones. The selection and ordering of topics is correct except possibly at the very end, where somewhat more or less might be covered depending on timing. Due dates are also precise. The exact timing of lecture topics will almost certainly vary from this, and readings (all from the textbook, "How To Design Programs") are linked to the timing of lectures. DrRacket implements a series of language subsets, and the changes from one level to the next are noted under the heading "Language Level".

Week 1 (Week of September 7-13)

Module 1: Prefix notation. Translating expressions. Defining functions and constants.

Readings: Preface, Sections 1, 2.

Language Level: Beginning Student.

Assignment 00: Due Tuesday, September 12, 9:00PM

Week 2 (Week of September 14-20)

Module 2: The design recipe: contract, purpose, examples, definition, tests. Comparisons and predicates. Boolean functions and special forms. Short circuiting. Symbols and strings. Equality testing. Conditional expressions. Writing and testing conditional functions. Helper functions.

Readings: Sections 3-5.

Assignment 01: Due Tuesday, September 19, 9:00PM

Week 3 (Week of September 21-27)

Module 3: The semantics of Beginning Student. Stepping.

Module 4: Compound data. posns. Defining structures. Stepping with structures. Data definitions. Templates. Consuming and producing compound data.

Readings: Intermezzo 1, Sections 6, 7.

Assignment 02: Due Tuesday, September 26, 9:00PM

Week 4 (Week of September 28 - October 4)

Module 4: Mixed data and union types. Checked functions.

Module 5: Defining lists. Basic list constructs. Box-and-pointer visualization of lists. Extracting values from a list. Semantics of list functions. Functions on lists. Processing lists. Recursive data definitions. Recursive functions. Tracing recursive functions. Structural recursion. Templates and design recipes for recursive data definitions and recursive functions. Useful list functions. Producing lists. Nonempty lists. Strings and lists of characters.

Readings: Sections 9, 10.

Assignment 03: Due Tuesday, October 3, 9:00PM

Week 5 (Week of October 5-14)

Module 5: Lists of structures.

Module 6: Natural numbers and recursion. Subintervals of natural numbers. Recursion on integers. Insertion sort. List abbreviations. Quoting lists. Lists containing lists. Lists versus structures. Kinds of lists. Dictionaries. Association lists.

Readings: Sections 11, 12, Intermezzo 2.

Language Level: Beginning Student with List Abbreviations.

Thanksgiving Day Holiday: Monday, October 9: No classes or consulting/office hours

Study Days: Tuesday, October 10 and Wednesday, October 11: No classes

Thursday, October 12: Tuesday class schedule

Friday, October 13: Wednesday class schedule - NO tutorials this week

Midterm Exam 1: Saturday, October 14, 2:00-3:50PM

Week 6 (Week of October 16)

Module 6: Two-dimensional data. Processing two lists simultaneously. Merging sorted lists. Consuming a list and a number. List equality.

Module 7: The limits of structural recursion. Preview of accumulative and generative recursion.

Module 8: Trees.

Readings: Section 17.

Assignment 04: Due Tuesday, October 17, 9:00PM

Week 7 (Week of October 23)

Module 8: Binary arithmetic expressions. Tree terminology. Characteristics of trees. Mutual recursion. Binary search trees. General trees. General arithmetic expressions.

Readings: Sections 14-16.

Assignment 05: Due Tuesday, October 24, 9:00PM

Week 8 (Week of October 30)

Module 8: Other uses of general trees. Nested lists as leaf-labelled trees. Flattening a nested list.

Module 9: Local definitions. Semantics of local. Naming common subexpressions. Using local for clarity. Encapsulation. Terminology associated with local.

Readings: Intermezzo 3.

Language Level: Intermediate Student.

Assignment 06: Due Tuesday, October 31, 9:00PM

Midterm Exam 2: Friday, November 3, 6:30-8:20PM

Week 9 (Week of November 6)

Module 10: Functional abstraction. Consuming functions. Producing functions. Putting functions in lists. Contracts and types. Simulating structures. Scope. Producing anonymous functions. lambda.

Readings: Sections 19, 20.

Language Level: Intermediate Student with lambda.

Assignment: None.

Week 10 (Week of November 13)

Module 10: Syntax and semantics of Intermediate Student with Lambda. Contracts for abstract list functions. Parametric types. Built-in abstract list functions. Building an abstract list function. foldr. Higher-order functions.

Module 11: Generative recursion. Termination.

Readings: Sections 21-23, Intermezzo 4, 25-27.

Assignment 07: Due Tuesday, November 14, 9:00PM

Week 11 (Week of November 20)

Module 11: Quicksort. Processing strings. More higher-order functions. foldl.

Module 12: Directed graphs. Backtracking algorithms. Graph terminology. Representing graphs. Structural recursion on graphs. Finding routes. Termination of find-route. Termination for DAGs. Backtracking in implicit graphs.

Readings: Section 28.

Assignment 08: Due Tuesday, November 21, 9:00PM

Week 12 (Week of November 27- Deceber 4)

Module 12: Making find-route efficient.

Module 13: History of topics covered in the course.

Readings: Sections 30, 31, 32.

Assignment 09: Due Monday, December 4, 9:00PM

Last day of UW classes for term: Monday, December 4

Last modified on Tuesday, 03 October 2017, at 11:37 hours.