CS 222 Winter 1999, Instructor: Jeffrey Horn

General Student Concerns: Colloquia and Seminars Local Events NMU CS Employmen
ANNOUNCEMENTS (Wednesday, April 7, 1999)

What's REALLY New:

NO LAB TODAY!! (it was booked, sorry) So back to our usual classroom for another lecture, finishing up hashing. PLAN FOR FRIDAY: a short little QUIZ! followed by lab (yes I definitely reserved it this time!). The quiz will only count for 5% of your grade, AT MOST, and will be on binary search vs. linear search, pointers, operator overloading, and will be open book, open notes, etc. It is meant as preparation for a full TEST next Wednesday, April 14. Put that on your calendars!
ALSO: EXTRA CREDIT: Attend the seminar today right after class, 11:00 in WS 160 I think, by Kirk Duffin, visiting candidate for CS faculty, and email me a paragraph or so with some original thought/analysis of his topic (computer vision and graphics). Worth up to ten points added to a homework grade.
ADDED HOMEWORK 5. Short. Due in one week!! See below for the link. Please note that the code now is fixed from the one I presented in class this morning (Fri. April 2). It will compile, and then exceed virtual memory (both parts of the assignment). Find the memory leak and fix it! (I will try to post some examples of destructors, use of delete, etc., on the web later.)
Lab (MAC lab) on Monday, April 5.

Not so New (Older Announcements):

IMPORTANT!!! For the Wed. lab, 3/23, for which I am gone, please read this:

In the current assignment, HW4, I think it is too much to ask that when you switch your binary search to pointers, that you also figure how to change the method

void SortedArray::InitializeFromFile()

(which is in the file "sortedarray.cc") to handle pointers. So let me do it for you, and use it as an example of how to handle pointers. The pointer version of this method is in the file

"~jeffhorn/pub/Classes/CS222/Code/Examples/sortedarray.cc" and I show it here below:

void SortedArray::InitializeFromFile()   // NOTE: This method has been "fixed" to work with
     {                                   // the array "everyone" being an array of POINTERS to
                                         // individuals. Note the changed lines below, see comments.
       char tempchar;
       int i,j;

       ifstream infile("input");            // Open file for reading.
       loIndex=0;
       hiIndex=-1;

       while(infile)           // Main loop here goes through file line by line,
          {                    // until end of file.
           hiIndex++;
           everyone[hiIndex] = new Individual(); // NEW: NEED TO CREATE NEW INDIV. FOR EACH ARRAY ELEMENT.
           for (i = 0; i < CHROMLENGTH; i++) // Inner loop here goes down a
             {                                // chromosome bit by bit, reading in
               infile.get(tempchar);          // a single character from file as
               if(tempchar == '0')            // the next bit.
                                              //
                                              // NEW: NOTE HOW NEXT TWO LINE NOW USE THE "->" OPERATOR,
                                              // SINCE "EVERYONE[i]" IS NOW A POINTER, NOT AN INDIVIDUAL.

                 everyone[hiIndex]->chromosome[i] = FALSE;    // '0' is FALSE.
                 else everyone[hiIndex]->chromosome[i] = TRUE; // '1' is TRUE.
             };
               infile.get(tempchar);         // Get newline character, to skip it.
           };
        hiIndex--;                           // Decrement hiIndex just before returning,
                                             // because it gets incremented one too many times
                                             // loop.
       };

We can discuss this on Friday!

Interested in some funding for some robot building, via the Spooner Student Research grant? If so, see me ASAP! (applications due next week!) Follow the link for more on-line info. (This would mean doing a directed study course with me. You get the credit, I get the robot! Well, the dept. does.)

Added more on-line info on UNIX stuff you need, like making directories and copying groups of files. See link to SUPPLEMENTAL below.
Handed out HW3, program 2, you lucky dogs. Binary Search through a see of artificial "chromosomes". See below.
NOW HW2 is really fixed, for good! New due date, code that compiles, etc. Please see the web page for hw2 for the latest, and final, information.
Fixed "arrayofpeople.cc" code for HW2. (Just eliminate the constructor for the arrayOfPeople class; you don't need one. Sorry.)
Added HOMEWORK 2 (see below)
Everybody should have working UNIX accounts now. If not, see me! ASAP.
NOTE: Class on Monday, Jan. 25 is MOVED to a lab on Thursday (same time, 10am) in the Mac lab in WS. On Wed., 10 am, Jan. 27, our next lecture, we will start using our UNIX accounts. I hope to have the first programming assignment ready then too. Check this page frequently!
OK, here's the deal on homeworks and due dates:

HW0: Yes, I do want you to fill in the blanks on that binary search handout (click here for it) and hand it in as an easy homework (call it HW 0). You can fill out the blanks from class notes, or looking it up in a textbook, or by actually thinking about it! All except the avg. case performance perhaps. That is typically hard to analyze. We can talk about that later. For now, give it a try. Xtra credit to anyone who gets it right, but partial credit for those who simply attempt it (so don't leave blank!). (hint: think of finding "x" about "half way through" your search. DUE DATE: WEDNEDAY, JANUARY 27, end of the day. (you can put in my mailbox in WS 161.)
HW1: Another pencil and paper workout. See below for links to the pages of the handout, which was handed out in class today, Friday, Jan. 22. Due: Next Friday, Jan. 29. (Don't worry, this is NOT a math class. I just want you to start thinking in terms of running times of your programs. This requires some basic math functions and being able to distinguish their growth rates. Hint: If you have trouble visualizing the growth rates of n! versus 2^n, and seeing which grows faster, then try a graphing calculator, or program, or just graph by hand, or plug in big numbers ofr "n" to see which function is bigger.)

Syllabus is on the web. See below.
Textbook: OK, I forgot that I had requested a better textbook (I didn't think my request was in time, but apparently it was). So yes, the book I showed you Mon. and Wed. this week is NOT the right one. The right one is

Data Abstraction and Problem Solving with C++ (Walls and Mirrors) by Carrano, Helman, and Veroff (2nd Edition)

That is the REQUIRED one. The OPTIONAL one is

(a practical introduction to) Software Design with C++ by Steven P. Reiss

The Campus Bookstore might have incorrectly listed BOTH as required. The optional book is meant as a C++ reference book. I recommend that, or any other C++ reference book.

If you purchase "Intro to Data Structures and Algorithm Analysis with C++" by Pothering and Naps, I suggest you return it for a full refund by Friday, January 15, which I heard is the deadline at the campus bookstore.