Week #

Monday

Tuesday

Wednesday

Thursday

Friday

1

March 30: Overview, Intro to C++ (1.1-1.5, Appendix B)

Passed out syllabuses and HW#0 handout. Introduced TAs (all present).  Slides through "Declarations are Statements" (#19)

First staff meeting 4:30.

Get acquainted.  C++ features.

April 1: Streams (Appendix C)

Continued, into Streams, up to 31 (briefly showed 33).

Streams, modules.

April 3: Modules (Ch 2)

"Stream Puzzler" exercise.  Finished streams.  Started Modules through #52 (separate compilation).

2

April 6: Data Abstraction (1.1-1.5) and Intro. to Classes (3.1-3.2)

In-class puzzler on file streams.  Announced skipping "Error Handling" in lecture, would be covered in section.  Finished "Modules".  Started "ADTs" through #81.

April 8: Data Abstraction: Class Constructors (3.3)

Completed "ADT", started "Constructors" through slide #97.

Quiz #1.

HW#1 collected.

HW#2 released.

April 10: Data Abstraction: Overloading (3.6)

Completed "Constructors," started "Overloading" through 111.

3

April 13: ADTs: Arrays, Records, Lists (4.1-4.4)

"Software Archeology" problem at beginning of class.  Finished overloading.  Started "Collection ADTs" through #124.

Quiz #2 (take-home): syllabus questions, classes and constructors

April 15: ADTs: Stacks and Queues (4.5-4.6)

Finished Lists (unresolved question about implementation).  Barely started Stacks.

Will need to cover Queues.

April 17: Dynamic Memory (Ch 7)

Completed Stacks, skimmed Queues, Sets, Tables.  Barely started Dynamic Memory.

4

April 20: Dynamic Memory

Continued Dynamic Memory, through "Garbage" (slide 175).

Postfix; dynamic memory

April 22: Dynamic Memory

Continued Dynamic Memory (including 2 new slides sent out on announce list), through "Classes with Dynamic Data" (195, retitled "Smart Advice").  Kept people 3 minutes late by accident.

Dynamic memory

April 24: MIDTERM EXAM #1

Graded starting at 4:00.

5

April 27: Recursion (Ch 6)

Announced different topic order: Linked Lists would be covered before Recursion.

Reviewed Vector class from Dynamic Memory.  Started Linked Lists, through "Manipulating Nodes" (worked by students in-class).

No staff meeting.

April 29: Linked Lists (Ch 8)

Continued LL through starting discussion of insertAfter.

Linked lists.  HW#2 passed back to some sections; others on Friday in lecture.

May 1: Linked Lists

Finished Linked Lists.

6

May 4: Linked Lists

Started Recursion.

Most TAs did linked lists, etc.

Jason did a special session 4-6pm, focus on stack-based calculator implementation.

May 6: OO Design (Ch 10,11)

Showed a recursion puzzler at beginning

Completed Recursion.  Did not start OO Design.

Recursion.

HW#3 collected.

May 8: OO Design

PT (Pascal's Triangle) recursion puzzler shown at beginning.

Started and completed OO Design.  Did a couple of slides from OO Programming.

7

May 11: OO Design

Square root recursion puzzler shown at beginning.

Continued OO programming, through about 271.  "Green and yellow parasols" used to move students around, people already paired for HW4 in one group, not paired in the other group.

Recursion; inheritance?

May 13: Algorithm Efficiency (Ch12.1-12.3, 12.5)

Continued OO Programming, through about slide 284 (introduction of "virtual.")

Saurabh, Ruth, and Shuichi (?) did a review session 6-7:30.

May 15: MIDTERM EXAM #2

Graded midterm 4:00.

8

May 18: Algorithm Efficiency

A couple of minutes at beginning for partner interactions.  Started with 2 news slides on virtual vs. non-virtual cases; skimmed rapidly through final slides of OO Prog, 285-292; did introduce "Abstract" and "Pure Virtual Function" ideas.   Skipped last 3 (294-296) on adventure game.  Showed 2 new slide on "Trends in Programming."  Started "Efficiency" to "Analysis of Sum."

May 20: Searching and Sorting (Ch 12.4,12.7-12.9)

Completed "Efficiency," but very lightly on last slides.

Final part of HW#4 due in section.

HW#5 was not available until the end of Friday.

May 22: Searching and Sorting

Started Searching and Sorting, through initial QuickSort discussion.

9

May 25: No classes (Memorial Day)

May 27: Trees (Ch 13)

Completed Searching and Sorting, light on the last slides in the section.  Started Trees; basic terminology, up to but not including binary trees.

Quiz #3 (Efficiency).  1st part of HW#5 due in section.

May 29: Trees

"Tree Quiz."  Continued with binary trees; ready to resume with Binary Search Trees.  Dismissed a few minutes so students could get to Tony DeRose talk.

10

June 1: Trees

Trees up to but not including BST deletion.

Quiz #4 (mainly tree terminology) BST deletion (from lecture packet).

June 3: Hashing (Ch 12.6)

Review BST deletion; continued through end of traversals; very lightly on the programming. Did in-class tree exercises today and Monday.  Collected suggestions for Friday mini-lecture.

Course evals.

June 5 (Last day of classes): Special Topics

Course evals... About 6 slides on Hash Tables. The special topics were a quick overview of MFC and Java. Short 143 wrap-up lecture.

11

 TUESDAY June 9

2:30 pm