UMBC CMSC 202, All Sections, Spring 2000

UMBC CS 202, Spring 00

UMBC CMSC 202 Spring '00

UMBC CMSC 202, Computer Science II
Spring 2000

Ms. Mitchell's Section

The code for programs demonstrated in class can be found in my public directory:

/afs/umbc.edu/users/s/m/smitchel/pub
The Word 97 file containing the transparencies I used for my recursion lectures are here.
The PowerPoint 97 file containing the transparencies I used for my Runtime Efficiency lecture are here.
The PowerPoint 97 file containing the transparencies I used for my Stacks and Queues lecture are here.
The Exam 1 Review Sheet is here.
The Exam 2 Review Sheet is here.
The binary search tree (BST) source code is available at:

/afs/umbc.edu/users/s/m/smitchel/pub/bst

You can copy it from this directory into yours. I have provided a sample main function (bstmain.C). Make sure that you read through the code and understand the LOGIC for the final exam. Note that the delete method that I wrote is iterative. If you are curious about a recursive algorithm, see Mr. Kukla's code in his public directory.
IMPORTANT NOTE REGARDING GRADES
A spreadsheet containing all project scores, exam scores, and final grades will be posted by Saturday, May 27. I will be available via e-mail after the final grades have been posted for a period of ONE WEEK (until Friday, June 2). YOU MUST CONTACT ME WITHIN THAT TIME PERIOD IF YOU WISH TO DISCUSS YOUR GRADE. If we need to get together in person or speak via telephone, that can be arranged. BUT YOU MUST E-MAIL ME BY FRIDAY, JUNE 2. I will be unavailable after June 2 until the fall semester.