Assignment 11 (Floyd-Warshall; Computability), due Monday, April 23 by 11:59pm

• Lecture 22b: Formal Languages
• Lecture 23: Introduction to State Machines
• Lecture 24: State Machines Concluded
• Lecture 25: Turing Machines

Assignment 10 (Seam Carving), due Monday, April 16 by 11:59pm

• hw10files.zip: Starter files for the assignment.
• Lecture 21: Sorting Concluded; Dynamic Programming
• Lecture 22a: Dynamic Programming Concluded.

Assignment 9 (Complexity), due Monday, April 9 by 11:59pm

• Lecture 20: Asymptotic Complexity and Sorting

Assignment 8 (Unicalc, Part 2), due Monday, April 2 by 11:59pm

• hw8.zip: Starter files for the assignment.
• Lecture 17: TreeSet vs. HashSet concluded; Lexing; Regular Expressions.
• Lecture 18: Files and Regular Expression in Java; Introduction to Grammars.
• The MakeDB.java example program from Lecture 18.
• Lecture 19: Grammars and Recursive-Descent Parsing.
• The Minilog.java example program from Lecture 19.

Assignment 7 (Unicalc, Part 1), Due Monday, March 26 by 11:59pm.

• No starter code this week.
• Mathematical functions: Math.
• Useful abstract interfaces: Collection, Set, List, Map.
• Useful concrete classes: ArrayList, LinkedList, HashSet, TreeSet, HashMap, TreeMap.
• Related classes with useful helper functions: Arrays, Collections.
• Documentation for the rest of the"Java Collections Framework".
• Lecture 16: Sets, Lists, and Maps in Java

Assignment 6 (Spampede), Due Wednesday, March 7 by 11:59pm.

• hw6files.zip, the starting point for your Java code.
  • If your Maze.java works, feel free to use that rather than the one provided here! (You'll have to make a few more changes, e.g., mazeStrings).
• Lecture 12: OOP and Inheritance
• Lecture 13: GUIs and Applets
• Lecture 15a: Concurrency
• Lecture 15b: Garbage Collection

Assignment 5 (SpamSeeker), Due Monday, February 27 by 11:59pm.

• hw5.zip, the starting point for your Java code, including
  • StackInterface.java --- Interface for generic Stack implementations
  • Stack.java --- Generic Stack, which can serve as a basis for your generic Queue
  • QueueInterface.java --- Interface for generic Queue implementations
  • Maze.java --- Code to construct Maze objects, and run your BFS code.
  • test*.maze --- Various mazes for testing purposes.
• Lecture 9b: Introduction to Java
• Point.java from lecture 9b
• Lecture 10: Stacks and Queues, DFS and BFS
• Lecture 11: SpamSeeker; Industrial Strength Stacks and Queues

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

• hw4.zip, the starting point for your Prolog code, including
  • ex.pl --- A collection of simple example predicates
  • zebra.pl --- Code to solve the zebra puzzle
  • money.pl --- Code to solve the SEND+MORE=MONEY puzzle
  • hanoi.pl --- Code to solve the Towers of Hanoi puzzle
  • logicpuzzle.pl --- Starter code for the assignment
  • twentyfour.pl --- Starter code for the assignment
  • riverpuzzle.pl --- Starter code for the assignment
• Lecture 8: Puzzles in Prolog
• Lecture 9a: Prolog Concluded
• Lecture 9b: Introduction to Java
• Point.java from lecture

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

• hw3.zip, the starting point for your Prolog code.
• Lecture 6: Abstraction; DFS vs. BFS; Introduction to Prolog
• Lecture 7: Programming with Prolog Note: we rushed through the last few slides in class; I've added a bit more explanation.

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

• hw2pr1.rkt, a starting point for your racket code
• Lecture 4: Review; Higher-Order Functions; Introduction to Trees
• Lecture 5: Trees; Graphs; Use-it-or-Lose-it
• Just for fun: The self-balancing-binary-tree applet demoed in class.

Assignment 1, Due Monday, January 30 by 11:59pm.

• hw1pr1.rkt, a starting point for Problem 1, with empty function definitions and some tests
• Lecture 2: Lists in Racket; Asymptotic Complexity
• Lecture 3: Recursion and Tail Recursion; more Asymptotic Complexity
  Note: the Lecture 3 slides have been revised and (I hope) improved since you saw them in class.

Assignment 0, Due Monday, January 23 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: Administrivia; Introduction to Racket
• 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.