|
CSE 143
|
The homework due dates refer to the final part of each project. Sometimes 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. Students are expected to have read the textbook before attending class.
Subject to change.
| Week | Day | Date | Topic | Textboook Reading |
| #1 | M | 6/21/1999 | Intro and Welcome
C vs. C++ |
Appendix A1-A37 |
| #1 | W | 6/23 | C vs. C++ (cont.)
Principles of Programming and Software Engineering |
Ch. 1 |
| Th | Multi-file program construction | |||
| #1 | F | 6/25 | Principles (cont.)
ADTs and Lists |
Ch. 1
Ch. 3 |
| #2 | M | 6/28. HW#1 due | C++ Classes: member functions, privacy | Ch. 3 |
| Tu | ||||
| #2 | W | 6/30 | C++ Classes: constructors
List Implementation with Arrays |
Ch. 3 |
| #2 | F | 7/2 | File I/O, error checking | Appendix A38-A52 |
| #3 | M | 7/5 | NO CLASS | |
| #3 | W | 7/7 HW#2 due | Recursion | Ch. 2
Adv. reading: Ch. 5 |
| #3 | F | 7/9 | Recursion
Pointer Review |
Ch. 2, Ch. 4 |
| #4 | M | 7/12 | Dynamic Memory | Ch. 4 |
| #4 | W | 7/14
HW#3 due |
Dynamic Memory | Ch. 4 |
| #4 | F | 7/16 | Classes with Dynamic Memory: deep vs. shallow copy; destructors | Ch. 4 |
| #5 | M | 7/19 | Linked Lists | Ch. 4 |
| #5 | W | 7/21 | Stacks | Ch. 6 |
| #5 | F | 7/23 | Midterm #1 | |
| #6 | M | 7/26
HW#4 due |
Queues | Ch. 7 |
| #6 | W | 7/28 | Class Relationships: inheritance | Ch. 8 |
| #6 | F | 7/30 | Class Relationships: virtual functions | |
| #7 | M | 8/2
HW#5 due |
Overloading. Object-Oriented Programming | |
| #7 | W | 8/4 | Algorithm Efficiency | Ch. 9 |
| #7 | F | 8/6 | Sorting Algorithms: Quadratic Sorts | |
| #8 | M | 8/9 | Sorting Algorithms: Quicksort | |
| #8 | W | 8/11 | Trees | Ch. 10 |
| #8 | F | 8/13 | Graphs | Ch. 13 |
| #9 | M | 8/16 HW#7 due | Tables and Hashing | Ch. 11-12 (parts) |
| #9 | W | 8/18 | Beyond C++ | |
| #9 | F | 8/20 | FINAL EXAM |