(Latest Revision: 09/19/2000)
Week 03 Notes for CS 2500 -- Fall 2000
Monday, September 18
            
		 -  Level two of programming assignment #1 is
		      due today.
		 
 -  The final level of programming assignment
		      #1 is due next Monday.
		 
 -  Friday I will be out of town. Get your
		      questions answered before I leave on
		      Thursday evening.
		 
 -  Friday you will work in the lab
		      (P-288) during class time.  Exchange some
		      ideas with your classmates.
		 
 -  We are reading about recursion in
		      Carrano, and about CDE and the unix file
		      system in Andersen.
                 
 -  I posted programming assignment #2 in the
		      class web space.
            
 
       -  Answer any remaining questions/concerns regarding
	    programming assignment #1.
       
 -  Show example of reading e-mail on the Sun Ultra's.
       
 -  Discuss the class mailing list (majordomo::cs2500-1)
       
 -  More discussion of the programming assignment.
       
             -  Go over the hints we have not discussed yet.
	     
 -  Questions?
       
 
 
Wednesday, September 20
       -  Take Roll.
       
 -  Schedule Highlights.
       
 -  Remind class of the importance of using the
            exact subject lines specified for the program
            submissions.
       
 -  Look over the remaining hints for the programming assignment
            (the decoder).
       
 -  Any questions about the programming assignment?
       
 -  Discussion of the level two programs that were
            turned in on Monday.
       
 -  The compiler command option for naming the
            executable file:
            (g++ -o decode decode.cpp)
        -  Discuss compiling/debugging with jove
       
             -  How to execute the compiler "inside" jove:
	         (C-u, C-x, C-e)
	     
 -  How to break out of jove to a sub-shell
		  whilst "saving your place": (M-s)
	     
 -  Testing the program while in the sub-shell.
	     
 -  How to break out of the sub-shell and return
		  to "your place" in jove: (exit)
       
 
        -  Discuss recursion
       
             -  Examine non-recursive and recursive versions of in-order
                  traversal of a BST.  Show the non-recursive first, and then
                  the recursive.  This is good to indicate the power of
                  recursion.  (Source: Stubbs and Webre)
	     
 -  Discuss Activation Records and implementation of recursion.
                  Use the evaluation of factorials as the working example.
	     
 -  Write out a "tree" to show how inefficient it is to calculate
                  n choose k with recursion.
       
 
 
Friday, September 22
     -  I will be out of town.  I will be back on Monday.
     
 -  Work in the lab (P-288) during class time.  Exchange
	  some ideas with your classmates.