CS 42: Principles and Practice of Computer Science
Assignments, Lectures, and Examples

Assignment 13, Due Friday, December 9 by 11:59pm

• Lecture 25: Undecidability

• Lecture 26: Use It or Lose It; Compression; AI search

Assignment 12, Due Monday, December 5 by 11:59pm

• Lecture 22: Decision Problems, Formal Languages, and DFAs
• Lecture 23: NFAs, Regular Expressions, and Turing Machines
• Lecture 24: Turing Machines, Cardinality

Assignment 11, Due Tuesday, November 29 by 11:59pm

• Lecture 21: Prolog Puzzles
• sort.txt: removeAll, perm, sort, etc., from lecture (Rename to sort.pl before use)
• money.txt: the SEND+MORE=MONEY puzzle (Rename to money.pl before use)
• einstein.txt: the zebra puzzle (Rename to einstein.pl before use)
• spam.txt: alien/spam/spampede puzzle (Rename to spam.pl before use)

Assignment 10, Due Monday, November 14 by 11:59pm

• Lecture 19: Introduction to Prolog
• facts.txt: food-pairing facts from lecture. (Rename to facts.pl before use)
• Lecture 20: Prolog Details

Assignment 9, Due Monday, November 7 by 11:59pm

• Lecture 17: References, GC, Inheritance
• Lecture 18: Event-Driven Programming

Assignment 8, Due Monday, October 31 by 11:59PM.

• Lecture 15: Style; Python classes
• Lecture 16: ADTs, Stacks, Queues, BFS/DFS

Assignment 7, Due *Tuesday*, October 25 by 11:59PM.

• Lecture 12: Python
• Lecture 13: Sorting
• Lecture 14: More Sorting and More Python

Assignment 6, Due Monday, October 10 by 11:59PM.

• You can turn in the extra credit without spending a Euro, any time up through 5pm Friday October 15. But send e-mail so we mark your required problems as showing up on time.
• Lecture 11: Computer Architecture; Calling Conventions
• HMMM Official Documentation

Assignment 5, Due Monday, October 3 by 11:59PM.

• Lecture 9: Introduction to HMMM; Binary Arithmetic
• Lecture 10: Binary Concluded; Logic Circuits
• HMMM Official Documentation

Assignment 4, Due Monday, September 26 by 11:59PM.

• Lecture 6: Dijkstra's Algorithm, Grammars
• Lecture 7: Introduction to Parsing
• Lecture 8: Recursive Descent Parsing, Interpreters

Assignment 3, Due Monday, September 19 by 11:59PM.

• Lecture 5: Big-O, Trees, and Graphs
• See the assignment itself for links to 3 important unicalc files.

Assignment 2, Due Monday, September 12 by 11:59PM.

• Lecture 3: Tail Recursion, Higher-Order Functions
• Lecture 4: Binary Search Trees
• See the assignment itself for links to 3 important unicalc files.

Assignment 1, Due Monday, September 5 by 11:59PM.

• Scheme Quick Reference Card (see also the References page)
• Lecture 1: Course Introduction, Picobot
• Lecture 2: More Picobot, Introduction to Racket
• hw1pr3.rkt, a starting point for HW1 Problem 3, with an example function and comments. (You can copy and edit this for HW 1 Problem 4.)