Week 03 Notes for CS 2500, Section 001 -- Spring 2002

• Take roll.
• Announcement(s)
  • We have the following messages about tutoring:

    From: esalazar@gmx.net
    Date: Wed Feb 20, 2002  03:21:37  PM US/Pacific
    To: rsc@eos.csustan.edu, lamie@altair.csustan.edu, john@alcyone.csustan.edu
    Subject: CS1500 & 2500 Workshop
    
    The workshop will be in the conference room (P280) at the following times:
    
    Tues. & Thurs. at 11:30am - 12:30 pm
    Wed. & Fri. at 10:00am - 11:00am
    
    The first session will be Tuesday, February 26.
    
    This workshop is for all 1500 and 2500 students, regardless of major. Please
    announce this in you class.
    
    Thank you,
    Elmer E. Salazar
    

    Date: Mon, 25 Feb 2002 16:49:28 -0800 (PST)
    From: Marlys Knutsen 
    To: cs@pollux.csustan.edu
    Subject: another CS tutor
    
    We have another CS tutor available.  Chris Sandoval works through the
    Tutoring Center, so any students would need to make an appointment through
    that department.  Chris indicated he is comforable tutoring in any CS class
    including Calc I and II, but except CS 3050, Files.
    
    Thanks.
    
    marlys knutsen
    CSU Stanislaus
    marlys@pollux.csustan.edu
    
    

  • It does not work well to print 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.
  • This week we are reading in Carrano about recursion (chapter 2).
  • This week we are reading in Andersen about CDE and the Unix file system.
  • The level #2 version of program #1 is due today (before midnight)
  • The finished version of program #1 is due next Tuesday.
• Discuss requirements of third and fourth level of program #1.
  • A call like this can perform the tiling:

    doTileJob(buffer, numTileRows, numTileCols, imgHeight, imgWidth)

  • What should function "doTileJob" do? It could do the tiling one row at a time by making a function call like this:

    makeRow(buffer,numTileCols,imgHeight,imgWidth)

    numTileRows times.
    
    
  • What should function "makeRow" do? It could make one row of the tiling by making this function call:

    makeRowLine(lineNum, buffer, numTileCols, imgWidth)

    once for each value of lineNum from 1 to imgHeight. Each call would make one line of the tiling on the screen.
    
    
  • What should the function call:

    makeRowLine(lineNum, buffer, numTileCols, imgWidth)

    do? In an inner loop, it can execute this statement

    cout << buffer[lineNum][charNum]

    once for each value of charNum from 1 to imgWidth. This code would write one line of the image. An outer loop can make the inner loop repeat numTileCols times, so that the line of the image is repeated the desired number of times.
    
    
• Do you know how to get input files off the web space for use in testing your program?
  
  
• Do we need to discuss compiling inside JOVE?
• 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.

• Take roll.
• Announcement(s)
• 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.