| |
CSE 143
|
A calendar of lecture topics, textbook readings, and exam dates follows. Note that it is subject to change! On-line versions of the slides are also available.
The homework due dates (to be added later) refer to the final part of each project. Often there will be parts due on earlier dates.
The last column indicates the chapters/sections of the required textbook that are relevant to the lecture material. Please read the textbook before attending class.
Note on slide numbers: these numbers match the current (updated) versions of the slides, which may be different from those in the course packet.
Subject to change. Last revised 08/16/00 04:48 PM
| Week | Day | Date | Topic | Textbook Reading |
| #1 | M | 6/19 | A. Intro and Welcome B. C vs. C++ |
Appendix A1-A37 |
| #1 | W | 6/21 | C. Principles of Programming and Software Engineering HW0 due |
Ch. 1 |
| #1 | Th | 6/22 | C. Multi-file program construction (C-11 to C-17) | |
| #1 | F | 6/23 | D. ADTs E. C++ Class basics: member functions, privacy |
Ch. 1 Ch. 3 |
| #2 | M | 6/26 | F. C++ Classes: constructors
HW1 due |
|
| #2 | Tu | |||
| #2 | W | G. File Streams
|
Appendix A38-A52 | |
| #2 | Th | |||
| #2 | F | H. List ADT via arrays |
Ch. 3 p. 134ff |
|
| #3 | M | 7/3 (no class Tuesday 7/4) | I. Recursion
|
Ch. 2 |
| #3 | W | 7/5 | J. Pointers and Dynamic Memory HW2 due 10:00 pm |
Ch. 4 |
| #3 | F | Midterm #1 | ||
| #4 | M | 7/10 | J. Pointers and Dynamic Memory (concluded)
L. Linked Lists |
Ch. 4 |
| #4 | W | M. Vector ADT implementation N. Classes with Dynamic Memory: vector as dynamic array; deep vs. shallow copy; copy constructors (beginngin) HW3-I due |
Ch. 4 | |
| #4 | Th | |||
| #4 | F | N. Classes with Dynamic Memory: this pointer; overloaded assignment; destructors (continued) | ||
| #5 | M | 7/17 | N. Classes with Dynamic Memory: this pointer; overloaded assignment; destructors (conclusion) O. Stacks (beginning) |
Ch. 6 |
| Tu | K. Const | |||
| #5 | W |
O. Stacks (conclusion) HW3-II due |
Ch. 7 | |
| #5 | F | P. Queue ADT and implementations (P-1 to P-18); Problem-solving with Lists, Queues, and Stacks. Simulation (P-19 to P-23) | Ch. 7 Ch. 8 pp.343-354 |
|
| #6 | M | 7/24 | Q. Class Relationships and inheritance | |
| #6 | W | R. Virtual functions and dynamic dispatch | ||
| #6 | Th | |||
| #6 | F | Midterm #2 | ||
| #7 | M | 7/31 | R. Virtual functions and dynamic dispatch
(concluded)
S. Object-Oriented Programming HW4 due |
Ch. 8 pp.377-381 |
| #7 | W | 8/2 | U. Algorithm Efficiency (to U-21) |
Ch. 9 pp.309-402 |
| Th |
T. Scope Review and Overloading |
Ch. 8 pp.354-370 | ||
| #7 | F | 8/4 | U. Algorithm Efficiency (concluded) | Ch. 9 pp.403-430 |
| #8 | M | 8/7 |
V. Searching. Quadratic Sorts V. Sorting Algorithms: Quicksort |
|
| #8 | W | 8/9 | V. Sorting Algorithms: Mergesort
W. Trees: Basics |
Ch. 10 pp.438-445
|
| #8 | Th | 8/10 | HW5-Part III due | |
| #8 | F | 8/11 | W. Trees: Traversals. Expression trees.
|
Ch. 10 pp. 446ff |
| #9 | M | 8/14 | X. Trees: Binary Search Trees
|
|
| #9 | W | 8/16 | Y. Tables and
Hashing (to Y-9) Z. Beyond CSE143 Last day of lecture |
Ch. 11-12 (parts) |
| #9 | Th | 8/17 | ||
| #9 | F | 8/18 | Final Exam! | |