Back to the CS 60 homepage

Assignment 12 (DFA, NFA, Turing Machines), due Friday, December 14th by 11:59pm

• Lecture 25: DFAs, NFAs, Proofs
• Lecture 26: Turing Machines + Awesomeness

Assignment 11 (DP and big-O), due Monday, December 10th by 11:59pm

• hw11.zip: Starter files for the assignment.
• Lecture 23: DP and big-O
• Lecture 24: sorting out big-O

Assignment 10 (Seam Carving), due Monday, December 3rd by 11:59pm

• hw10.zip: Starter files for the assignment.
• Lecture 21: Seam Carving; Dynamic Programming
• Lecture 22: Dynamic Programming Concluded.

Assignment 9: Spampede, Due Tuesday, November 20 by 11:59pm.

• hw9files.zip, the starter files for Spampede...
• Lecture 20 notes (Various Threads!)
• Lecture 19 notes (Graphics + Spampede)
• Lecture 18 notes (Inheritance)

Assignment 8, Due Monday, November 12 by 11:59pm.

• hw8.zip, a starter file for your BFS maze-solving...
• Lecture 17
• Lecture 16
• Lecture 16 (Stack animation)

Assignment 7, Due Monday, November 5 by 11:59pm.

• hw7.zip, A starting point for your Unicalc language implementation
• now with mergesort instead of minsort
• also, the constructors and getSmallDB match the hwk's description
• A zip file of our MiniMath example language from class
• Lecture 14
• Lecture 15

Assignment 6, Due Monday, October 29 by 11:59pm.

• Point.java, our Point class example
• Complex.java, a starting point for the Complex number class
• BSTNode.java, most of the BSTNode class
• OpenList.java, the OpenList starter code
• MainFromCompletedOpenList.java, tests for OpenList



• Lecture 12
• Lecture 13

Assignment 5, Due Monday Tuesday, October 15 October 16 by 11:59pm.

• hw5.zip, the starting point for your Prolog code, including
  • logic.pl - A short starter for the Knights-and-Knaves problem
  • spamventure.pl - Starting code for your text adventure
• Lecture 10: Adventurous Prolog
• Lecture 11: Caffeinated Java!

Assignment 4, Due Monday, October 8 by 11:59pm.

• hw4.zip, the starting point for your Prolog code, including
  • ex.pl - A collection of simple example predicates
  • einstein.pl - Code to solve the zebra puzzle
  • lists.pl - Starter code for the assignment, part 1
  • logicpuzzle.pl - Starter code for the assignment, part 2
  • twentyfour.pl - Starter code for the assignment's extra credit
• Lecture 8: Becoming unified with Prolog
• Lecture 9: Puzzling in Prolog

Assignment 3, Due Monday, October 1 by 11:59pm.

• hw3.zip, the starting point for your Prolog and Racket code.
• Note - you can change the filename of hw3pr1.txt to hw3pr1.pl.
• Lecture 6's ppt slides (Mon 9/24/12) Introduction to Prolog
• Lecture 7's ppt slides (Wed 9/26/12) Recursion and Lists in Prolog

Assignment 2, Due Monday, September 24 by 11:59pm.

• hw2pr1.rkt, a starting point for your racket code
• Lecture 4's ppt slides (Mon 9/17/12) Lambda, HOFs, Trees
• Lecture 5's ppt slides (Wed 9/19/12) Graphs, Use-it-or-Lose-it, Trees
• Just for fun: The self-balancing-binary-tree applet demoed in class.

Assignment 1, Due Monday, September 17 by 11:59pm.

• Materials:
• hw1pr1.rkt, a starting point for Hw1 problem 1, with empty function definitions and some tests - here is a .txt version, in case it's easier to download or copy...
• There is no special starter file for hw1pr2.rkt, but feel free to copy (and alter) the former file... .
• Lecture 2's ppt slides (Mon 9/10/12) Recursion in Racket!
• Lecture 3's ppt slides (Wed 9/12/12) How recursion functions...

Assignment 0, Due Monday, September 10 by 11:59pm.

• There is no starter file for the first problem, hw0pr1.rkt, because you'll use the Racket Quick introduction
• hw0pr2.rkt, a starting point for Hw0 problem 2, with an example function, example tests, and comments


• Lecture 1: Introduction to CS 60 and Racket    Lecture 1's racket handout
• A four-page Racket reference card    Thanks to Prof. Keller for putting all of the Racket functions in one place!
• Additional references:
  • Racket's graphical quick reference for problem 1.
  • Racket's official guide aka, the Racket walk-through.
  • Racket's official language reference.
  • The venerable textbook, How to Design Programs, or htdp. It uses Scheme, which is for our purposes identical to Racket.