[Home] [Syllabus] [Assignments] [Resources]

This page contains problem set assignments for the course. The assignments will be added as they become available.- Problem set 1, WAS due Wedn. Sept 10th at the beginning of the
class, NOW due Fri., Sept. 12th.

Exercises 2.1, 2.2, and 2.3 on p. 17.

*Hint for 2.2, 2.3*. In the proof of undecidability of halting problem we used if/else statement to construct a new function from a given one. Likewise, you may use all available C (or Java) machinery to construct new functions. In particular, you may use conditionals, loops, and input/output statements, such as writing to standard output and reading from standard input. You may assume that the standard input is the same as the standard output. - Problem Set 2 (PDF) Solutions for the Scheme questions are posted here.
- Problem Set 3 (PDF). Due Friday, October 3rd. The handout on the call-by-value and call-by-name lambda-calculus might be helpful.
- Problem set 4 (PDF). Due Monday, October 20th. NEW:Selected solutions.
- Problem set 5 (PDF). Due Wedn., October 29th.
- Problem set 6 (PDF). Due Wedn., November 5th.
- Problem set 7 (PDF). Due Friday,
November 14th.

Some helpful resources:- The source code for LinkedList class
for problems 1, 2. Also available on epoxy at
`~elenam/pub/4651/LinkedList.java`

- tutorial on Java exceptions from java.sun.com.
- Overview of ML exceptions by Robert Harper.

- The source code for LinkedList class
for problems 1, 2. Also available on epoxy at
- Problem set 8 (PDF). Due Monday, November 24th.
- Problem set 9 (PDF). Due Friday, December 5th. NEW:Selected solutions.
- Problem set 10 (PDF). Due Wednesday, December 10th. The API of the Java class Point might be helpful. NEW:Selected solutions.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.