Midterm Exam 2 Study Guide, CISC181

Spring 2004, P. Conrad

   Exam Date: Friday, 04/23/04.   



   Topics: (preliminary list 3/10/04; updated 4/19/04)

   Labs thru lab06.
              
   Lecture notes thru 4/19, with emphasis on 3/10 through 4/19.

   Deitel/Deitel: 
        Chapters 1-6, with emphasis on 4-6
           (see WebCT for specific sections)
           (More chapters may be added later)
        Also emphasized: 
 
   Additional Deitel/Deitel Sections covered in lab and lecture:
      Section 7.6 on "new" and "delete"
         Note: textbook says to #include  when using the "new" operator.
         That's a new one on me (no pun intended.)
         We'll do it from now on, but don't worry about it for this exam.
      However, other topics from Chapter 7 such as "const member functions",
      "friend classes", and "static data members" will NOT be on this
      exam, they will be on the final.

   Anderson: Chapters 1,2, 4, 6-8, 10.6 (redirection) 
             Chapter 14 or 15 (vi or emacs), 32, 34 (except 34.8 and 34.18).
      Especially, be sure you know all the Unix commands from chapters 6-8,
      particularly the ones covered in lecture and lab.
         
   Labs 0-6, emphasis on 4 thru 6

   Project 1


   Some topics from lecture/lab that you shoudl particularly 
   emphasize:
 
   * review number conversions
   * tracing programs that set up linked lists and drawing the pictures
   * review the idea of the stack, function calls
   * Setting up simple linked lists using a struct such as:

     struct node 
     {
       int data;
       node *next;
     };
     
   * the (*x).y and x->y notations.
   * type expressions (lecture notes from 4/16), role of unary & (address of)
     operator, and unary * (dereference operator)
   * accessing command line parameters with int main(int argc, char **argv)...
   * redirection of input and output files
   * opening input files 
   * number conversions (also covered in
     Appendix C in Deitel; you may omit section
     C.6 (two's complement) for this exam.)
   * basics of classes: constructor/destructor, set and get functions,
     rules for accessing private data members, 
     binary scope resolution operator, "dot notation" for calling member 
     functions