Date: Wed, 11 Feb 2004 10:57:33 -0600 (CST)
   From: Mark Jacobson <jacobson@math-cs.cns.uni.edu>
     To: 810-151-04@uni.edu
Subject: [810-151-04] Scheme exam on February 18th, WEDNESDAY...

                            February 2004
                         Su Mo Tu We Th Fr Sa
                          1  2  3  4  5  6  7
                          8  9 10 11 12 13 14
                         15 16 17 18 19 20 21
                         22 23 24 25 26 27 28
                         29
Hi Scheme students,

     Your last Scheme programming project (binary search trees, sublist,
and list-head procedures) will be collected on Friday, IF you have it done
by class time.                                 ------

     However, you may have until 5 p.m. on Monday, February 16th to
turn in your last programming prujects.  Slide them under my Wright 106
office door, if I'm not there if you turn them in outside of class.

VIP:  Tuesday, the solution to and discussion of the last Scheme programming
      assignments will be posted to the web page, so turn in your best
      effort by 5 p.m. next Monday!

     The Scheme final exam will be on Wednesday, February 18th at 9 a.m.
It will be held in Wright 105 classroom, as usual.

     I will give the Visual Basic students that day off, so if you
are in both classes, there is no problem.

     Visual Basic .Net class will start on Monday February 16th, and will
have its 2nd meeting on Friday, February 20th.

     VB .Net will thus have a total of 14 instead of 15 class meetings.
I have taught Visual Basic 15 times since fall of 1997, so it is the class
that will be easiest to cover in one less lecture!

     C/C++ will have 15 MWF sessions in 5 weeks.

     Scheme will have had 15 sessions, since the extra session next
     Wednesday will make up for the Martin Luther King holiday.

     This Friday, February 13th, we will go over the 2nd quiz and review
for the final exam.  I will also show a solution to the following
problem:

           Given the preorder list and the postorder list for
           a binary search tree traversal, construct the binary
           search tree that produced that pair of traversals.

      http://www.cns.uni.edu/~jacobson/scheme/

      I will update the web page with today's handout later today, and put
some of Friday's new and review for test material there ahead of time, if
you want to preview it on Thursday evening.

      See you on Friday.

      Mark