Back to the CS 60 homepage

Assignment 13: Theoretic Computing, Due Friday, May 3rd by 11:59pm.

• Lecture 26: Turing Machines
• Lecture 27: Review

Assignment 12: Spampede, Due Monday, April 29th by 11:59pm.

• hw12.zip, the starter files for Spampede...
• Lecture 24: Java Quiz Review, Runtimes, DFAs
• Lecture 25: DFAs, Proofs

Assignment 11 (Sorting and Spampede (Starter)), Due Monday, April 22nd by 11:59pm.

• Lecture 22: Spampede + Sorting
• Lecture 23: Spampede Graphics + Sorting

Assignment 10 (Unicalc and Unilang), Due Monday, April 15th by 11:59pm.

• hw10.zip, A starting point for your Unicalc language implementation
• Lecture 20: Parsing Framework
• Lecture 21: Inheritance, Exceptions, Sorting

Assignment 9 (DP and big-O), due Monday, April 8th by 11:59pm

• hw9.zip: Starter files for the assignment.
• Lecture 18: DP and big-O
• Lecture 19: sorting out big-O and Parsing

Assignment 8 (PhotoEditor), Due Monday, April 1st by 11:59pm.

• hw8.zip, a starter file for your photo editor...



• Lecture 16: Photo Editor (Dynamic Programming Intro)
• Lecture 17: Dynamic Programming

Assignment 7 (Java: Spam Seeker - Maze solver - merge/mergeSort), Due Wednesday, March 27 by 11:59pm.

• hw7.zip, a starter file for your BFS maze-solving...



• Lecture 14: Inheritance, Interfaces, Queues, Stacks, Debugging
• Lecture 15: Inheritance & Casting, Breadth First Search(BFS), Depth First Search (DFS)

Assignment 6 (Java: Complex, BSTNode, List), Due Monday, March 11 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
• List.java, the List starter code
• ListTest.java, JUnit test cases for List.java



• Lecture 13: Java Arrays, Lists, and Trees

Assignment 5 (Prolog Logic checker & Spampede), Due Monday, March 4 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
  • Hw5pr3.java - Starting code for your Java assignment
  • Hw5pr3Test.java - Starting code for your Java JUnit tests
• Lecture 11: Adventurous Prolog (Hw5 info)
• Lecture 12: Java: Classes, Constructors, Methods, Arrays

Assignment 4 (Prolog Lists & Puzzle Solver), 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
  • Hw4pr3.java - Starter code for the Java methods
  • Hw4pr3Test.java - Starter code for the Java methods tests
• Lecture 9: Becoming unified with Prolog
• Lecture 10: Puzzling in Prolog

Assignment 3 (Prolog - Simpsons & Unicalc in Racket), Due Monday, February 18 by 11:59pm.

• hw3.zip, the starting point for your Prolog, Java, and Racket code.
• Lecture 7: Map Reduce, Mutual Recursion, Prolog
• Lecture 8: Prolog: \+, =, ==, is

Assignment 2 (Racket Tree and Graph Problems), Due Monday, February 11 by 11:59pm.

• hw2pr1.rkt, a starting point for your racket code
• Hw2pr2.java and Hw2pr2Test.java, a starting point for your Java code
• Lecture 5: Graphs, Trees, Use-it or Lose-it
  • Video: Graph representations: nodes, kids, leaf?, grandkids
  • Video: Use-it or lose-it: sublist
  • Video: Use-it or Lose-it: reach
• Lecture 6: BSTs, Map Reduce (Google's not-so secret weapon)
  • Video: Tree vocab, BST introduction and representations
  • Video: Binary Search Trees (BSTs) - Insert and Remove Explained

Assignment 1 (Racket Lists), Due Monday, February 4 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 3: Tail Recursion, Higher Order Functions (HOFs), & Lambda
  • Video: Eclipse
  • Video: TBD
  • Video: TBD
• Lecture 4: Tree Recursion
  • Video: Implementing cons WITHOUT built-in pairs
  • Video: Focus on pairs: writing reverse and remove from copy
  • Video: Deep-list/List-of-list example: flatten
  • Video: Graphs (Vocab) Intro
  • Video: BONUS: What are these dots? (cons)

Assignment 0 (Racket Tutorial + Racket Problems), Due Monday, January 28 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
• Video: Racket intro: functions, define, if, cond
• Video: Racket testing and debugging
• Video: Brief & simplified Big-O
• Lecture 2: Recursion and Racket functions
  • Video: Ways of representing and tracing recursive calls
  • Video: List functions: first, rest, null?, list, append, cons
  • Video: TBD
• 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.