Computer Science I
Spring 1999

Tentative Schedule
Day
Topic
Readings
Mo 1/11 What is Computer Science 1.1 (p. 3-8)
We 1/13 Hardware and Software 1.2 (p. 10-19)
Fr 1/15 Getting started in UNIX handout
Mo 1/18 Problem Solving, files & directories 2.1
We 1/20 Problem Solving, web pages 2.2
Fr 1/22 Editing with EMACS handout
Mo 1/25 Dissecting C programs 3.1, 3.2
We 1/27 Selection Structure "if" 5.2
Fr 1/29 Compiling
Mo 2/1 Arithmetic Chap. 3 (wrap-up)
We 2/3 if else, loops 5.2
Fr 2/5 More editing and compiling
Mo 2/8 Robustness, truth tables
We 2/10 while loops 5.3.1
Fr 2/12 Nested loops 5.3.3
Mo 2/15 Nested loops
We 2/17 Nested loops
Fr 2/19 "Lion in desert"
Mo 2/22 Review
We 2/24 Midterm
Fr 2/26 Functions
Mo 3/1 Functions 5.1
We 3/3 Flags Chap. 5 (wrap-up)
We 3/10 Arrays 7.1
Fr 3/12 Random Numbers
Mo 3/15 Arrays, Binary Numbers 4.1.4
We 3/17 Arrays and Functions 7.2
Fr 3/19 Graphics
Mo 3/29 2-D Arrays 7.3
We 3/31 2-D Arrays
Fr 4/2 More Graphics
Mo 4/5 2-D Arrays
We 4/7 Strings 7.4
Fr 4/9 Strings
Mo 4/12 Debugging Chap. 7 (wrap-up)
We 4/14 futurama
Fr 4/16 futurama
Mo 4/18 Review
We 4/20 Review