CSE 143
Autumn 1998

Day by Day Activity Schedule

A tentative calendar of lecture topics, textbook readings, and exam times follows. Note that it is subject to change, and all changes will be made available here. Only the most earth-shaking changes will also be announced in lecture and/or section.

The fourth 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. Last revised 9/18/98. 

Day Date Topic Reading (Headington and Riley)
M 9/28 Intro 1.1 - 1.5, Appendix B
W 9/30 Streams Appendix C
F 10/02 Modules Chapter 2
       
M 10/05 Abstraction 3.1 - 3.2
W 10/07 Abstraction 3.3
Th 10/08 HW1 Due  
F 10/09 Abstraction 3.6
       
M 10/12 Arrays 4.1 - 4.4
W 10/14 ADTs 4.5 - 4.6
F 10/16 Stack and queues 4.7- 4.8
       
M 10/19 Dynamic Memory Chapter 7
W 10/21 Dynamic Memory  
Th 10/22 HW2 Due  
F 10/23 Dynamic Memory  
       
M 10/26 Program Design  
W 10/28 Midterm  
F 10/30 Linked Lists Chapter 8
       
M 11/02 Linked Lists  
W 11/04 Recursion Chapter 6
Th 11/05 HW3 Due  
F 11/06 Object Oriented Design Chapter 10, 11
       
M 11/09 Object Oriented Design  
W 11/11 Holiday  
F 11/13 Object Oriented Design  
       
M 11/16 TBD  
W 11/18 Algorithm Efficiency 12.1 - 12.3, 12.5
Th 11/19 HW4 Due  
F 11/20 Algorithm efficiency  
       
M 11/23 Sorting 12.4, 12.7 - 12.9
W 11/25 Sorting  
F 11/27 Holiday  
       
M 11/30 Trees Chapter 13
W 12/02 Trees  
F 12/04 Hashing 12.6
       
M 12/07 TBD  
W 12/09 TBD - Last day of class  
Th 12/10 HW5 Due  
       
M 12/14 Final 2:30-4:30.