CSE 143 - Section AA CSE 143 Summer 2000 >> Section AA

section notes

Tuesdays and Thursdays, 9:40 to 10:40 am
Loew 217

Vocabulary lists, topic outlines, example code, and additional materials from section will be posted here shortly after each section. Not all materials here will have been presented in section; some of it, I couldn't get to, others are just presented as related and supplementary.

• cumulative vocabulary list

• Tuesday, 20 June 2000 - welcome greetings, why most professors can't teach, expecting more of your education, concepts instead of syntax, how you should treat section differently from lecture
• Thursday, 22 June 2000 - software engineering, modularity, multi-file projects, the build process
  see also: lecture slides, Set C; Carrano et al. (your textbook), Chapter 1
• Tuesday, 27 June 2000 - abstraction, ADTs, intro to classes
  see also: lecture slides, Sets D, E, F; Carrano et al., p. 15-22, p. 106-110, p. 125-141 (some material not yet covered), p. 129 (example class sphereClass)
       simpledate.h - typo in filename comment corrected (.cpp => .h), 28 Jun 2000 11:00 am
       simpledate.cpp
  
• Thursday, 29 June 2000 - stream I/O
  see also: lecture slides, Set G; Carrano et al., Appendix A, p. A38-A52
• Tuesday, 4 July 2000 - no section
• Thursday, 6 July 2000 - list ADT, recursion
  see also: lecture slides, Sets H and I; Carrano et al., Chapters 2 (recursion) and 3 (list ADT)
       vector.h
       vector.cpp
  
• Tuesday, 11 July 2000 - dynamically allocated memory, the No. 1 source of bugs in real software
  see also: lecture slides, Set J; Carrano et al., Chapter 4, p. 148-157
• Thursday, 13 July 2000 - list ADT as implemented using a linked list
  see also: lecture slides, Sets L and M; Carrano et al., Chapter 4, p. 157-179, 184-190
• Tuesday, 18 July 2000 - various meanings and usages of keyword const; copy constructors, destructors, operator= for classes with dynamic memory
  see also: lecture slides, Sets K and N; Carrano et al., p. 25-26, 130, A5-A6, A17 (const), p. 171-174 (copy constructors, destructors), 377-381 (operator overloading, operator=)
• Thursday, 20 July 2000 - better learning through discipline, not thrashing; studying how code breaks; abstraction and various implementations of ADTs; stack as implemented using a linked list
  see also: lecture slide Set O; Carrano et al., esp. p. 265-269 (header, implementation)
• Tuesday, 25 July 2000 - class inheritance
  see also: lecture slide Set Q, esp. Slides Q-1 through Q-21 (approx.); Carrano et. al, p. 343-354
       inheritance.h
  
• Thursday, 27 July 2000 - derived class for base class substitution (instances, pointers, references); static vs. dynamic dispatching
  see also: lecture slides, Sets Q and R; Carrano et al., p. 354-360
       dispatching rules on one page
  
• Tuesday, 1 August 2000 - more dynamic dispatching (pure virtual functions) see also: lecture slides, end of Set R; Carrano et al., p. 360-371
       notes on Slide R-18
  
• Tuesday, 3 August 2000 - operator overloading; running time analysis
  see also: lecture slides, Set T; Carrano et al., p. 377-381 (operator overloading); lecture slides, Set U; Carrano et al., Chapter 9
• Tuesday, 8 August 2000 - quicksort, selection sort
  see also: lecture slides, Set V
• Thursday, 10 August 2000 - quicksort, selection sort review; mergesort review and running time analysis
  see also: lecture slides, Set V
       heavily annotated version mergesort code posted by Martin
       Martin's original post
  
• Tuesday, 15 August 2000 - fun tricks with binary search trees
  see also: lecture slides, Set X
       various functions on trees - Write them before you peek. Don't cheat yourself!
          min./max. in bin. search tree
          min./max. in bin. tree
          # items in tree
          height of tree
          # leaves in tree
          sum/product of items in tree
          average of items in tree
       sorting using a binary search tree
  
• Thursday, 17 August 2000 (the last section!) - hashing review, HW 5 Part III remarks, evaluations
  see also: lecture slides, Set V
  

Ken Yasuhara
yasuhara@u.washington.edu, yasuhara@cs.washington.edu
office hours: Wednesdays, 9:30 am, Sieg 226a or by appointment

Hey, whaddaya know! It's the amazing...

• anonymous feedback form - I strongly encourage you to take advantage of this. Not sure what to write? Maybe you could use some...
  
  suggested questions, remarks
  
  request emphasis, review on certain topics
  Did I confuse you today? How?
  Did I unconfuse you especially effectively today? How?
  Tell me how incredibly _____ section was today, filling in _____ with one of the following: engaging/boring, helpful/useless, enlightening/confusing, well-paced/too fast, organized/disorganized...
  What do you find most/least useful about section?
  request more work, exercises, etc. to reinforce concepts
  Tell me how this page could be made more useful.
  Recommend your favorite poem or short story, Italian restaurant, bop or cool jazz recording...
  Send me a cookie recipe and hope that I'll make a batch for the whole section.
  
  ...but remember, I can't reply to you directly, so please take care when asking questions about homeworks, quizzes, etc.

mailing list archive

Messages specific to our section are sent to the e-mail list cse143-section-aa and are archived here. You are welcome to contact your classmates through this list.

• archive of mail sent to cse143-section-aa

Please make sure you are also subscribed to the main course mailing list, cse143-announce. (See "Email addresses, discussion groups" link on the course web.)

Most of the e-mail I send is useful to the class as a whole, so it often goes to the full course list:

• archive of mail sent to cse143-announce