Section AB CSE 143 Summer 2001 >> Section AB

Last Updated: 8-16 1:00pm

• Itinerary for Section 1, or what we covered in section.
• Slides-Intro to Style (Note: these were unused, as there were no overheads outside. ;o)

• Itinerary for Section 2, or what we covered in section.
• Slides-References
• Slides-Strings and Files, using fstream.h
• Slides-Streams and a Preview of Ojects

• Itinerary for Section 3, or what we covered in section.
• Slides-Anatomy of a Class
• Slides-Public vs private
• Slides-Using a class RIGHT

• Itinerary for Section 4, or what we covered in section.
  
  No slides this time around. . .We used some old slides and did a design excercise instead.
• Handouts for Design Excercise

• Itinerary for Section 5, or what we covered in section.
• Slides-Multiple Inclusion demystified!
• Slides-Meet your new best friend: const
• Slides-Steve's constructor mind-trip answers
  
  We also had a handout in class. This was a simple self-test designed to thoroughly cover overloaded, or multiple, constructors.
• Handout for Constructor Excercise

• Itinerary for Section 6, or what we covered in section. Its pretty short--we took a quiz, and then did some review via CSE Jeopardy!
• Slides-CSE Jeopoardy!

• Itinerary for Section 7, or what we covered in section. Most of the class is Q and A, since homework is due tomorrow!
• Slides-Anatomy of the overload of operator<<, and some talk about ways memory is used in a program. This is a prelude to dynamic memory.

• Itinerary for Section 8, or what we covered in section. Dynamic memory!
• Slides-Comprehensive review of Dynamic Memory

• Itinerary for Section 8, or what we covered in section. Copy constructors, operator overloading, and midterm review.
• Slides-An example using all of the above, and some midterm review questions.

• Slides-What we've covered so far. . .

Midterm today in section. . .Good luck!

• Midterms Returned--Section AB kicked searious rear!! GREAT JOB!! :o)
• Itinerary for Section 11, or what we covered in section. We went over the midterm for the entire time, and I gave you guys the chance to put in some feedback on how section's going via a survey.
• Steve's 'How am I doing?' Survey. . .You're welcome to print it out and give me one if you didn't make it to class today!
• The overheads today were just of the test, so nothing'll be posted here. Instead, look at the midterm solutions here.

• Itinerary for Section 12, or what we covered in section. We went over a LOT today. . .From inheritance to static and dynamic dispatch. We didn't get through as much stuff as I wanted too, however, so see the slides below for what we missed--we'll catch it next time.
• Slides-Is a vs. Has a
• Slides-Inheritance and Static Dispatch
• Slides-Inheritace and Constructors
• Slides-Dynamic Dispatch and using Virtual
• Slides-Abstract Classes
• Here is the source code for the slides, in order of appearence. If you're confused, mayhap looking at the source will help. Feel free to compile it and poke at it, and let me know if you have any questions!
  • Program 1: simple inheritance
    • main.cpp
    • brian.h
    • jeff.h
    • steve.h
  • Program 2: constructor fun
    • main.cpp
    • brian.h
    • jeff.h
    • steve.h
  • Program 3: dynamic dispatch
    • main.cpp
    • brian.h
    • jeff.h
    • steve.h
  • Program 4: 'brian' as an abstract class
    • main.cpp
    • brian.h
    • jeff.h
    • steve.h

• Itinerary for Section 13, or what we covered in section. Another busy section! We covered more dynamic dispatch, abstract classes, and recursion, as well as handed quizzes and homeworks back and answering hw Q.
• Slides-More Abstract Class Examples
• Slides-Recursion
• Here is the source code for the slides, in order of appearence. If you're confused, mayhap looking at the source will help. Feel free to compile it and poke at it, and let me know if you have any questions!
  • Program 1: abstract classes, the Ninja program
    • main.cpp
    • NinjaTracker.h
    • Ninja.h
    • SwordNinja.h
    • BowNinja.h
    • HealerNinja.h
  • Program 2: recursion
    • main.cpp

• Itinerary for Section 14, or what we covered in section. Linked lists and more Linked Lists!
• Slides-Linked Lists, Linked Lists with Recursion

• Itinerary for Section 14, or what we covered in section. Lots of stuff! Stacks, Queues, and a review of linked lists and dynamic memory.
• Slides-Stacks
• Slides-Queues
• Slides-Dynamic Dispatch and Linked Lists
• Here is the source code for the slides, in this case the PrintQueue program. If you're confused, mayhap looking at the source will help. Feel free to compile it and poke at it, and let me know if you have any questions!
  • main.cpp
  • Node.h
  • PrintQueue.h
  • PrintQueue.cpp

• Itinerary for Section 16, or what we covered in section. We talked about Big O notation, and took a quiz.
• Slides-Big O fun!

• Itinerary for Section 17, or what we covered in section. We talked about sorting and Trees!.
• Slides-Sorting-o-rama
• Slides-Trees

• Itinerary for Section 18, or what we covered. . .We ate food, reviewed as much as possible, and rated me as a TA. ;o)
• Three Pages of Final Review Questions. These questions are simple memory-joggers I made up to help you make sure you don't miss anything in your studying. If you can answer all these perfectly and without help, then you should do just fine. ;o) Good luck!

Final Review Session:

Misc. Stuff: