CS 20, Summer 2009

Programming Projects

Project 1 - past due (6/30/09, 9:00pm) - Learn to manage user errors and implement Java interfaces
Project 2 - past due (7/14/09, 9:00pm) - Practice with linked data and recursion, and implement a type of stack
Project 3 - past due (7/28/09, 9:00pm) - Implement a flexible heap, and implement a binary search tree node

Solutions

The solutions to CS 20 assignments are not posted on the web.

  1. See Date.java, DaysBetween.java, Rectangle.java and ArraySquareMatrix.java in ~cs20/solutions/p1/ on CSIL.
  2. See LinkedStringLog2.java, EvenOddStack.java, stacktest.txt, Palindrome.java and Power2.java in ~cs20/solutions/p2/ on CSIL.
  3. See Heap.java and BST.java in ~cs20/solutions/p3/ on CSIL.
Note: Our solutions are adequate - they fully satisfy project specifications. Usually there are infinite solutions that could satisfy these specifications just as well, or better.

C.S. 20 homepage