CS 70, Fall 2002 Calendar

Calendar for CS 70, Fall 2002

I try to make the current week correct as of the previous Friday. Future weeks are estimates.

Reading assignments are in red. The books are abbreviated by the first initial of the authors' names: K&P = Kernighan and Pike, W = Weiss, and S = Stroustrup.

 

September
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
 1



 2



 3
 1st day of classes


 4
 Class introduction
 Overview of style
  
 No reading assignment
 Useful general information
 5



 6



 7



 8



 9
 Programming style
 K&P 1
 S 1.1, 1.2, 1.7, 1.8, 2, 6.4
 Style examples
 10



 11
 Programming Style
 S 4
 HW1: Style
 HW1 grading curve
 12



 13



 14



 15



 16
 History of C++
 Intro to pointers
 W 1-1.3, D.1, D.3
 S 5.1, 5.4
 17



 18
 Variable and pointer lifetimes
 W 2.1-2.2
 S 5.2-5.3, 5.5-5.6, 10.1-10.3
 Cookie recipe
 HW2: Style checker
 HW2 grading curve
 19



 20



 21



 22



 23
 Arrays and pointers
  
 No reading assignment
 24



 25
 New and delete
 W 1.4, D.2, 2.3-2.7
 S 6.2.6-6.3.3.1, 6.4, 10.4-10.5
 HW3: DGP pseudocode
 HW3 grading curve
 26



 27



 28



 29



 30
 C++ classes
 S 12





















 

October
Sunday Monday Tuesday Wednesday Thursday Friday Saturday








 1



 2
 Debugging
 K&P 5-6
 broken.cc
 unbroken.cc
 reallybroken.cc
 HW4: Registrar database
 HW4 grading curve
 3



 4



 5



 6



 7
 Complexity analysis
 W 6
 Insertion Sort
 8



 9
 Complexity analysis
  
 No reading assignment
 Complexity classes
 HW5: Debuggers
 HW5 grading curve
 10



 11
 Midterm available


 12



 13



 14
 Make
 W 4
 Sample Makefile
 15



 16
 Operator overloading
 S 11

 17



 18
 Midterm due


 19



 20



 21
 Fall break


 22



 23
 Midterm post-mortem
  
 No reading assignment
 24



 25



 26



 27



 28
 Operator overloading (cont'd)
  
 No reading assignment
 29



 30
 Iterators
 W 5
 dumbcontainer.hh
 dumbcontainer.cc
 containertest.cc
 HW6: Complexity analysis
 HW6 grading curve
 31











 

November
Sunday Monday Tuesday Wednesday Thursday Friday Saturday




















 1



 2



 3



 4
 Lists stacks, queues, and deques
 W 16

 5



 6
 Templates
 W 3
 S 13
 HW7: Genetic algorithm
 HW7 grading curve
 7



 8



 9



 10



 11
 Hash tables
 W 20

 12



 13
 Hash tables
  
 No reading assignment
 HW8: Bar simulation
 HW8 grading curve
 14



 15



 16



 17



 18
 Trees and tree representation
 W 18

 19



 20
 Tree traversal
  
 No reading assignment
 HW9: Encryption
 HW9 grading curve
 21



 22



 23



 24



 25
 Binary search trees
 W 19.1-19.3

 26



 27
 AVL trees
 W 19.4-19.6
 HW10: Spell checker
 HW10 grading curve
 28
 Thanksgiving


 29



 30



 

December
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
 1



 2
 B-trees
 W 19.7-19.8

 3



 4
 STL
 W 7
 STL information
 5



 6



 7



 8



 9
 No class


 10



 11
 No class


 12
 HW11: DMV database
 HW11 grading curve

 13



 14



 15



 16
 Finals


 17
 Finals


 18
 Finals


 19
 Finals


 20
 Finals


 21



 22



 23



 24



 25



 26



 27



 28



 29



 30



 31




















© 2002, Geoff Kuenning

This page is maintained by Geoff Kuenning.