CSci 555: Functional Programming
Spring Semester 2001
Instructor's Bulletin Board

1 May 2001: Final Exam

The Final Examination:

• is scheduled for Tuesday, 8 May 2001, at 7:30 P.M. in the normal classroom; you will have three hours to complete the exam.
• is comprehensive; it covers all topics covered in class this semester.

Remember I will drop the lowest of the three exam grades and count the other two exams equally toward the examination portion of the grade.

1 May 2001: Homework Assignment #6

Homework Assignment #6:

• is now optional. I will use the five best homework grades to compute the homework portion of the grade.
• is due on Friday, 4 May 2001.

Note: If you do all six assignments and do especially well on Assignment #6, I will take that into consideration if your grade falls on a borderline between letter grades for the semester.

I apologize for not having graded the homeworks on a timely basis this semester. I will try to get them graded by Monday morning of finals week so you can make the final decision about taking the final examination.

18 April 2001: Second mid-term examination

Remember that the second examination is scheduled for next Tuesday, 21 April 2000.

• As requested, I will have a question and answer question on Friday, 20 April, at 3:00 p.m. in the usual classroom.

• I gave out the exam from last year. Any leftover copies are in an envelope on my door.

• I sent email earlier with Haskell functions for problems 4, 6, and 8.

• I have also put the photocopies of my rough solutions to problems 2 and 3 in envelope on my door.

• The exam will focus on the material we have covered since the last examination, but, of course, these concepts and techniques build on the basic concepts and techniques discussed earlier.

• Topics covered since the previous exam includes:
  • "More on Data Types", section 8 of my Notes
  • "Algebraic Types", chapter 14 of the Thompson textbook

  • "Program Development", chapter 11 of the Thompson textbook
  • "Problem Solving", Section 10 of my Notes, even though I did not explicitly lecture on that material)

  • "Gofer Laws", section 11 of my Notes
  • extra two page handout for map (f . g.) = map f . map g
  • including section 14.7 of the Thompson textbook

  • "Models of Reduction", section 11 of my Notes

  • "Lazy Programming", chapter 17 of the Thompson textbook
  • "Infinite Data Structures", section 15 of my Notes, even though I did not explicitly lecture on that material
  • Handout on the process networks for the Hamming problem and Fibonnaci sequence

  • "Programming with Actions", chapter 18 of the textbook (focusing mainly on sections 18.1 thru 18.6)

• Good luck!

I also handed out Homework #6. Extra copies are on door or check the Web site. I likely will give more credit to this program than the previous programs.

UP to CSCI 555 root document?