CalendarDates below are for the Winter 2012 offering. 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 January 2)Module 1: Prefix notation. Translating expressions. Defining functions and constants. Readings: Preface, Sections 1, 2. Language Level: Beginning Student. Assignment 0: January 6, 2012. Week 2 (Week of January 9)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, 4, 5. Assignment 1: Wed. January 11, 2012, 9:15AM. Week 3 (Week of January 16)Module 3: The semantics of Beginning Student. Stepping. Module 4: Compound data. posns. Defining structures. Data definitions. Templates. Consuming and producing compound data. Mixed data and union types. Checked functions. Readings: Intermezzo 1, Sections 6,7. Assignment 2: Wed. January 18, 2012, 9:15AM. Week 4 (Week of January 23)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. Lists of structures. Readings: Sections 9, 10. Assigment 3: Wed. January 25, 2012, 9:15AM. Week 5 (Week of January 30)Midterm Exam 1: January 30, 2012, 7:00-8:50PM 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. Assignment:none Week 6 (Week of February 6)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 4: Wed. February 8, 2012, 9:15AM. Week 7 (Week of February 13)Module 8: Binary arithmetic expressions. Tree terminology. Characteristics of trees. Mutual recursion. Binary search trees. General trees. General arithmetic expressions. Readings: Sections 14, 15, 16. Assignment 5: Wed. February 15, 2012, 9:15AM. Reading Week (Week of February 20)Monday, February 20: University Holiday - Family Day No lectures, tutorials or assignment this week. Week 8 (Week of February 27)Midterm Exam 2: February 27, 2012, 7:00-8:50PM Module 8: Other uses of general trees. 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:none Week 9 (Week of March 5)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 6: Wed. March 7, 2012, 9:15AM. Week 10 (Week of March 12)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 7: Wed. March 14, 2012, 9:15AM. Week 11 (Week of March 19)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. Readings: Section 28. Assignment 8: Wed. March 21, 2012, 9:15AM. Week 12 (Week of March 26)Module 12: Termination of find-route. Termination for DAGs. Backtracking in implicit graphs. Making find-route efficient. Module 13: History of topics covered in the course. Readings: Sections 30, 31, 32. Assignment 9: Wed. March 28, 2012, 9:15AM. UPDATE: Assignment 9 is due Mon. Apr. 2, 9:15AM Week 13 (Week of April 2)Last day of UW classes for term: Mon. April 2. No CS135 Lectures or Tutorials his week. |
Last modified on Tuesday, 27 March 2012, at 11:50 hours.