Week 03 Notes for CS 2500, Section 002 -- Spring 2001

• Class starts at 09:40. I take roll at 09:50
• This week we are reading in Carrano about recursion.
• This week we are reading in Andersen about CDE and the Unix file system.
• The level #2 version of program #1 was due yesterday (before midnight)
• The finished version of program #1 is due next Monday.
• Announcement(s)
  • It is not working well to print my web pages from the Sun Ultra's. To print web pages, please print from one of the NT machines or one of the Mac's.
  • I will be away on Wednesday, Feb 28 (no office hours that day)
• Do we need to finish up with any of the compiling inside JOVE stuff from last time?
• The compiler command option for naming the executable file:
  (g++ -o phrase phrase.cpp)
• Discuss compiling/debugging with jove
  • How to execute the compiler "inside" jove: (C-u, C-x, C-e)
  • C-x 1 "unsplits" the screen.
  • How to break out of jove to a sub-shell whilst "saving your place": (esc-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)
• If interested, you can read the compileHelp document for more information about using JOVE for compiling and debugging. This document is in the General_Info section of the class web space.
• We need to deal with questions about how to get things done in the level-three portions of the solution to programming problem #1. There are new files in the Asg01 directory that help with this:
  • asciiArt
  • copyArt.cpp
  • copyArt.script

• Class starts at 09:40. I take roll at 09:50
• Announcement(s)
  • It is not working well to print my web pages from the Sun Ultra's. To print web pages, please print from one of the NT machines or one of the Mac's.
  • A few students have sent e-mails with the wrong subject line. Please get that right for me.
• Sometime this week, we need to look at samples of recursive functions and programs that use them. The following files serve that purpose:
  • factorialA.cpp
  • factorialA.out
  • factorialB.cpp
  • factorialB.out
  • inorderNonRecursive
  • inorderRecursive
  • runTimeStack.cpp
  • runTimeStack.jpg
  • runTimeStack.script
• 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.
• We may go to the lab at about 10:10 today to work on the program.