Keunwoo Lee
CSE 143 : Computer Programming II
Winter 2000


Professor: Hal Perkins

News


About this page

This is not the official homepage for the course; the official homepage is found at the following URL:

http://www.cs.washington.edu/education/courses/cse143/00wi/

However, this is the page for information pertaining specifically to Keunwoo Lee's quiz sections, as follows:

Section Time Location
143 AI 8:30 a.m. - 9:20 a.m. 217 Loew Hall
143 AF 9:30 a.m. - 10:20 a.m. 220 Loew Hall


Contact info and office hours

For most purposes, I am klee@cs (you should append a ".washington.edu" if you're emailing from a non-cs machine). Please do learn to spell my actual name (Keunwoo, pronounced "canoe"), since you may have to write it on official course materials.

If you want to reach me anonymously, use the web form at the following URL, which is an anonymous mailer provided by the University (so there really is no way I can trace the messages back to you):

http://depts.washington.edu/ctlt/catalyst/umail/mail.cgi?user=keunwoo&form=1

Obviously, there is no way I can reply to anything sent to this address, so if you need personal feedback you'll have to use regular e-mail.

In general, my office hours are as follows (subject to change):

Date Time Location
Tuesday 10:30 - 11:30 p.m. Hallway outside IPL (323 Sieg Hall)
Thursday 2:30 - 3:30 p.m. 226b Sieg Hall

If neither of these times is convenient for you, you can also e-mail me and set up an appointment. Don't be shy: I am usually reasonably flexible about making room in my schedule.


Section Policies

For definitive course-wide policies, see the official course home page. If any of the following conflicts with anything on the official home page, the official page is right (and please notify me!). Further course policies for my sections will be posted here as necessary.

Archived notes

4 jan 2000: intro, C review, I/O and C/C++ strings.
6 jan 2000 (solutions): more strings.
11 jan 2000: intro to classes.
13 jan 2000: implementing classes (examples: point, color, date), software engineering.
18 jan 2000: testing and development, drivers.
1 feb 2000: more dynamic memory.
3 feb 2000: inheritance, memory layout, static vs. dynamic dispatch.
8 feb 2000: project organization, dependencies, constructors and destructors.
10 feb 2000: recursion.
15 feb 2000: midterm review, more recursion.
22 feb 2000: more about declarations and definitions, containers and iterators.
24 feb 2000: data structures and algorithms, queues, stacks, efficiency and big-O notation.
29 feb 2000: mergesort, quicksort, radix sort, complexity revisited, binary trees.
2 mar 2000: writing an iterator over binary trees.

Keunwoo Lee
Last modified: Mon Jul 17 23:02:22 PDT 2000