CSE 143
Summer 2001

Lecture and Activity Schedule

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 usually be due Wednesday evenings (electronic by 9:30 pm), with printed copies due in sections the next day.  There should be a homework assignment almost every week.  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 08/10/01 2:01 PM 

Week Day Date Topic Textbook Reading
#1 M 6/18 A. Intro and Welcome
B. Intro to C++ 


Appendix A1-A37

  W 6/20

B.  Intro to C++
B1. Stream basics 
HW0 due

 

  F 6/22 C. Multi-file program construction and princliples of software design Ch. 1
         
#2 M 6/25

D. ADTs
E. C++ Class basics: member functions, privacy 

Ch. 1
Ch. 3, pp 125-144 (skim example); App. A

  W 6/27 F. C++ Classes: constructors & Overloading
HW1 due		 Ch. 8, pp 377-381
  F 6/29 H. List ADT using arrays Ch. 3 p. 134ff
         
#3 M 7/2 K. const p. 25, 130, A17
  W 7/4 Independence Day - NO CLASSES  
  F 7/6

G. More about Streams

 Appendix A38-A52
         
#4 M 7/9 J. Pointers and Dynamic Memory Ch. 4, pp 148-157, 172-177
  W 7/11 J. Pointers and Dynamic Memory (concluded)
HW2 due		  
  F 7/13 N. Classes w/Dynamic Memory Ch. 4
         
#5 M 7/16 N. Classes w/Dynamic Memory; deep vs shallow copy  
  W 7/18

Q. Classes & Inheritance

 Ch. 8
  Th 7/19 MIDTERM EXAM in sections  
  F 7/20 Q. Classes & Inheritance (concluded)  
         
#6 M 7/23

R. Dynamic Dispatch

 Ch. 6
  W 7/25 R. Dynamic Dispatch (concluded)
HW3 due		  
  F 7/27 S. Object-oriented design  
         
#7 M 7/30 I. Recursion (review) Ch 4, Ch 6, pp 265-271
  W 8/1 L. Linked Lists
M. Classes (vector) using Linked Lists
HW4 due
Ch 3
  F 8/3 O. Stacks Ch 6
         
#8 M 8/6 P. Queues & simulation Ch. 7
  Tu 8/7 HW5 Part I Due  
  W 8/8

U. Algorithm Efficiency, O( ) Notation

 Ch. 9, pp 391-401
  F 8/10 V. Searching & Sorting Ch. 9, pp 402-432
         
#9 M 8/13 W. Trees; Expression Trees
X.  Binary Search Trees
Y.  Tables & Hashing
HW5 Part II due		 Ch. 10
Ch. 11-12 (parts)
  W 8/15

Z.  Beyond Basic C++: templates, libraries, &c.

 
  F 8/17

FINAL EXAM - 10:50-11:50, EE 125