| |
CSE 143 |
A calendar of lecture topics, textbook readings, and exam dates follows. This may change as the quarter evolves. The topic list includes links to online copies of the lecture slides. These are links to the slides in the course packet for upcoming topics; they will be updated if necessary after the corresponding lecture has been given this quarter.
Homework will be due Wednesday evenings (electronic by 10 pm), with printed copies due in sections the next day. There should be a homework assignment every week, except for the two weeks where a midterm exam is scheduled in Thursday sections. Some of the later assignments may form parts of a larger project.
The last column indicates the chapters/sections of the textbook that are relevant to the lecture material. Please read the textbook before attending class.
Subject to change. Last revised 05/23/01 06:00 PM
| Week | Day | Date | Topic | Textbook Reading |
| #1 | M | 3/26 | A. Intro and Welcome B. Intro to C++ |
|
| W | 3/28 |
B. Intro to C++ |
| |
| F | 3/30 | C. Multi-file program construction (C-11 to C-17) | Ch. 1 | |
| #2 | M | 4/2 |
Ch. 1 | |
| W | 4/4 | F. C++ Classes: constructors &
Overloading HW1 due |
Ch. 8, pp 377-381 | |
| F | 4/6 | H. List ADT using arrays | Ch. 3 p. 134ff | |
| #3 | M | 4/9 | G.
More about Streams K. const |
Appendix A38-A52 |
| W | 4/11 |
J. Pointers and Dynamic Memory |
Ch. 4, pp 148-157, 172-177 | |
| F | 4/13 | J. Pointers and Dynamic Memory (concluded) | ||
| #4 | M | 4/16 | N. Classes w/Dynamic Memory | |
| W | 4/18 | Ch. 4 | ||
| Th | 4/19 | MIDTERM 1 in sections | ||
| F | 4/20 | N. Dynamic memory,
concl C. Some Principles of Software Design |
Ch 1, Ch 8 | |
| #5 | M | 4/23 | Ch. 4 | |
| W | 4/25 | Q. Classes & Inheritance HW3 due |
||
| F | 4/27 | Ch. 6 | ||
| #6 | M | 4/30 | S. Object-oriented design; T-Overloading, Overriding, and Scope |
|
| W | 5/2 | T-Overloading,
Overriding, and Scope (concl) HW4 due |
Ch 2, Ch 5 | |
| F | 5/4 | I. Recursion (review) | Ch 4, Ch 6, pp 265-271 | |
| #7 | M | 5/7 | L. Linked Lists | |
| W | 5/9 | M. Classes (vector) using Linked Lists | Ch 3 | |
| Th | 5/10 | MIDTERM 2 in sections | ||
| F | 5/11 | O. Stacks | Ch 3 | |
| #8 | M | 5/14 | P. Queues & simulation | CH 3, Ch. 9, pp 390-401 |
| W | 5/16 | U. Algorithm Efficiency, O( ) Notation HW5 due |
Ch. 9, pp 391-401 | |
| F | 5/18 |
| ||
| #9 | M | 5/21 | Ch. 9, pp 402-432 | |
| W | 5/23 | W. Trees; Expression Trees HW6 due |
Ch 10 | |
| F | 5/25 | W. Trees; Expression Trees | ||
| #10 | M | 5/28 | Memorial Day - NO CLASSES | |
| W | 5/30 |
X. Binary Search Trees Y. Tables & Hashing |
Ch. 11-12 (parts) | |
| F | 6/1 | |||
| #12 | Tue | 6/5 |
FINAL EXAM - 2:30-4:20, KANE 130 |