Back to the CS 60 homepage

Extra-credit assignment (hw12), Due Friday, May 9 by 11:59pm

• This has now been updated to hw12, with files named hw12.zip but the specifications are the same as always!
• It's worth up to +50/0 points:
  • Up to +10 for Quantity.java (Unicalc in Java!)
  • Up to +5 for Tokenizer.java (tokenizing with Java's RE library)
  • Up to +15 for Parser.java (Grammar-based parsing via recursive descent)
  • Up to +12 for Evaluator.java (Recursive evaluation!)
  • Up to +8 for any additional language features you add, e.g., functions

Assignment 11, Due Friday, May 2 by 11:59pm

• Lecture 23: nondeterminism and inheritance
  Not commonly paired topics, I suspect!
• Lecture 24: Java's object-oriented graphics...
• Lecture 25: Stacks, Queues, BFS, DFS, and search = AI!
• Lecture 26: CS60's summarized: language is computation: REs and grammars

Assignment 10, Due Tuesday, April 22 by 11:59pm

• Lecture 21: FSMs, DFAs, and distinguishability
• Lecture 22: Nonregular languages, NFAs, and TMs
• Here is a zip archive of a set of tests for each of the (non-extra-credit) JFLAP machines
  The note after problem one provides more detail about how to batch-test your machines -- be sure to test them!

Assignment 9, Due Tuesday, April 15 by 11:59pm

• Lecture 19: Fast algorithms and big-O
• Lecture 20: Sorting out big O...

Assignment 8, Due Tuesday, April 8 by 11:59pm

• Lecture 17: Fast Java! (part 1: data)
• Lecture 18: Fast Java! (part 2: algorithms)
• Here is hw8src.zip, all of the starter files and tests in a single zip archive.

Assignment 7, Due Tuesday, April 1 by 11:59pm

• Lecture 1: Pixels + Seams!
• Lecture 2: Dynamic programming!

Assignment 6, Due Tuesday, March 25 by 11:59pm

• Lecture 12: Java!
• No lecture on Thu. 3/6 - midterm
• Lecture 13: Data structures in Java!
• Lecture 14: Thinking with references (and loops!)

Assignment 5, Due Monday, March 3 by 11:59pm.

• No lecture on Tues. 2/25 - Ryan's birthday!
• Lecture 11: Adventurous Prolog
• There are also links to two starter files:
  • spamventure.pl - Starting code for your text adventure
  • logic.pl - A short starter for the Knights-and-Knaves problem

Assignment 4, Due Monday, February 24 by 11:59pm.

• Lecture 8's ppt slides (Tue 2/18/14) Data structures in Prolog
• Lecture 9's ppt slides (Thu 2/20/14) Prolog's passion: Puzzles!

Assignment 3, Due Monday, February 17 by 11:59pm.

• Lecture 6's ppt slides (Tue 2/11/14) Introduction to Prolog
• Lecture 7's ppt slides (Thu 2/13/14) Unicalc! and Recursion+Lists in Prolog

Assignment 2, Due Monday, February 10 by 11:59pm.

• hw2pr1.rkt, a starting point for your racket code
• lec5_in_class.rkt, a Racket file with the three use-it-or-lose-it examples and the graph examples from class... These might be good starting points for the use-it-or-lose it and graph hw problems...   Confession: the first three are well commented! The rest, not so much...
• lec4_for_posting.rkt, a Racket file with the tree examples from Tuesday's class - this includes insert, which is a good starting point for the delete problem on the HW.
• Lecture 4's ppt slides Trees and Binary Search Trees...
• Lecture 5's ppt slides Graphs and use-it-or-lose-it algorithm design
• Just for fun: The self-balancing-binary-tree applet demoed in class.

Assignment 1, Due Monday, February 3 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 (Tue 1/28/14 - guest lecture by Josh Eckroth!) Recursion and tail recursion!
• Lecture 3's ppt slides (Thu 1/30/14) How recursion functions... (old slides for now, to be replaced after lecture)

Assignment 0, Due Monday, January 27, 2014 at 11:59 pm

• 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 big-O solution, an example function, example tests, and comments


• Lecture 0: Introduction to CS 60 and big-O
• Lecture 1: Racket! (a.k.a. Scheme or LISP) -- now posted    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 (too vast for ordinary use, perhaps...).
  • A venerable textbook, How to Design Programs, or htdp. It uses Scheme, which is for our purposes identical to Racket.