Computer Science 201 Spring 2002 Schedule

Key: Sn = Section in Horsmann, QT=Quality tip (Improve your grades), PH=Productivity Hint (Save time online), CE=Common Error (Avoid embarrassment), AT=Advanced Topic (Impress your colleagues), RF=Random Fact.  
Class# and Date Finish Reading Before Class Topics Lab#
1. Apr 2 Computer Science 201: Introduction and survival guide lab01: Owl Book pages 16-47
2. Apr 4 Handouts + Scan all of Horstmann Chapter 1. Then study Sn1.8, CE1.1, Sn1.9, CE 1.2, Figures 15 and 16, Sn1.11 Programming: Computers, Languages, Compilers, Algorithms, Errors
3. Apr 9 Finish The Owl Book
Horstmann Chapter 2: Sn2.1, QT2.1, QT2.2, AT2.1, AT2.2, AT2.3, Sn2.2, Sn2.3 CE2.1, PH2.1, Sn2.4, QT2.3
Basics: Numbers, Variables, Input/output, Assignment statements, Constants, First Quiz: Write a complete program to output ___. lab02: programming
4. Apr 11 Chapter 2: AT2.1, AT2.3, Sn2.5, CE2.2, CE2.3, CS2.4, AT2.6, PH 2.2, QT2.4, QT2.5, Sn2.6, Summary Simple Data: Arithmetic, Strings, Formatted Input/Output (IO)
5. Apr 16 Chapter 3: Sn3.1, Sn3.2, CE3.1, Sn3.2, PH3.2, Sn3.4, Sn3.5, CE3.2, PH3.3, Sn3.6, PH3.4 Objects: Complex data lab03: Objects
6. Apr 18 Chapter 3: RF3.2 Sn3.7, Sn3.8, QT3.1, RF3.3, Summary Graphics, Project Work
Apr 22 - Last Day to Drop -
7. Apr 23 Chapter 4: Sn4.1, QT4.1, PH4.1, Sn4.2, CE4.1, QT4.2, CE4.2, Sn4.3, QT4.3, Sn4.4 Simple Decisions: The if and if/else Statements, Relational Operators, Blocks, The switch Statement lab04: Decisions
8. Apr 25 Chapter 4: AT4.1, Sn4.5, AT4.2, Sn4.6, QT4.4, PH4.3, CE4.3, CE4.4, Sn4.7, AT4.3, CE4.5, CE4.6, Sn4.8, Sn 4.9, Summary Complex Decisions: Nested Branches, Boolean Data and Operators
9. Apr 30 Chapter 5: Sn5.1, Sn5.2, PH5.1, Sn5.3, PH5.2, PH5.3, Sn5.4, CE5.1, Sn5.5, QT5.1, CE5.2, AT5.1, Sn5.6, Sn5.7, Sn5.8, AT5.2 Functions: Functions Already Used, Functions as Black Boxes, Function Documentation, Procedures, Parameters, lab05: Functions
10. May 2 Chapter 5: QT5.2, Sn5.9, QT5.3, Sn5.10, Sn5.11, Sn5.12, PH5.4, PH5.5, Sn 5.13, Sn5.14, CE5.3, PH5.6, Summary Functions: Scope, Design, Stepwise Refinement, PseudoCode, Walkthroughs, Recursion
11. May 7 Chapter 6: Sn6.1, CE6.1, Sn6.2, CE6.2, CE6.3, QT6.1, QT6.2, Sn6.3, PH6.1, AT6.1, QT6.3, QT6.4 Basic Iteration: The while, for, and do-while Statements, Common Loop Types. lab06: Iterations
12. May 9 Chapter 6: AT6.2, CE6.4, CE6.5, Sn6.4, Sn6.5, Sn6.6, AT6.3, Summary Complex Iterations: Advice, Simulation, Nested Loops, Block Scope ( Roll Call)
13. May 14 Chapter 6: AT6.4, RF6.2, summary. Chapter 7: RF7.1, RF7.2, Sn7.1 Bugs  lab07: Debugging
14. May 16 Chapter 7: Sn7.2, Sn7.3, PH7.1, Sn7.4, Sn7.5, Sn7.7 Testing: Unit Tests, Test Cases, Automating Tests, Program Tracing
15. May 21 Chapter 8: Sn8.1, CS8.1, Sn8.2, CE8.2, Sn8.3, Sn8.4, CE8.3, Sn8.5, Sn8.6, CE8.4, CE8.5, Sn8.7 Classes: Classes Already Used, Encapsulation, Interfaces, Member Functions, Constructors, Accessing data lab08: Classes
16. May 23 Chapter 8: AT8.1, AT8.2, Sn8.8 Sn8.9 + Handout Designing Classes Object-Oriented Design, The UML
17. May 28 Chapter 9: Sn9.1, Sn9.2, CE9.1, QT9.1, PH9.2, AT9.1, RF9.1, Sn9.3, AT9.2, Vectors : Starting Vectors, Subscripts, Parameters, UML for vectors lab09 Vectors
18. May 30 Chapter 9: Sn9.4, Sn9.5, QT9.2, Sn9.6 More Vectors: Algorithms, Parallels vs Objects
19. Jun 4 Chapter 9: Sn9.7, AT9.3, CE9.2, CE9.3, RF9.2, Summary More Data Structures: Arrays, 1 and 2 dimensions, last quiz lab10: Classes and Vectors
20. Jun 6 Review Chapters 1 thru 9 Review and prepare for final, last project
Jun 10Last projects to Kelly
Jun 13 10am-12pm Chapters 1 thru 9 Comprehensive Final
Kay Zemoudeh 12/9/1997 and Dick Botting 02/Mar/2002