CSI 201 - Computer Science I

Week #

Lecture #s

Descriptions

Handouts
16
  • 45
  • Final Exam
  • Monday, 12/10/07 from 9:00-11:30
15
  • 44
  • 43
  • Review
  • Classes get/set
     
14
  • 42
  • 41
  • 40
  • Exam #3
  • Review
  • Classes Chapter 6
13
  • 39
  • 38
  • 37
  • Thanksgiving
  • Thanksgiving
  • I/O Manipulations
     
12
  • 36
  • 35
  • 34
  • Binary Search
  • Fibonacci P#1 p 595
  • Recursion Proofs
11
  • 33
  • 32
  • 31
  • Recursion with Return Values
  • Recursion
  • File Name from User, HW #12
10
  • 30
  • 29
  • 28
  • File Input/Output
  • Advising Day
  • File Redirection - HW DUE FRIDAY!
  • Extra Credit (Diving Scores with File Input/Output)
     
     
9
  • 27
  • 26
  • 25
  • Exam #2
  • Review
  • HW #11
8
  • 24
  • 23
  • 22
  • Partially Filled and Dynamic Arrays
  • Sorting
  • Standard Deviation
7
  • 21
  • 20
  • 19
  • Fall Break
  • an array search function
  • array fns
6
  • 18
  • 17
  • 16
  • using arrays
  • array basics
  • factorial
5
  • 15
  • 14
  • 13
  • for loops
  • Exam #1
  • Review
4
  • 12
  • 11
  • 10
  • call by reference
  • call by value
  • user defined fn, rounding reals (rounding function code due Friday)
3
  • 9
  • 8
  • 7
  • user defined functions, using while loops
  • predefined functions
  • scope, while loops
2
  • 6
  • 5
  • 4
  • Booleans, Short Circuit
  • Branching
  • Linux and Emacs commands
1
  • 3
  • 2
  • 1
  • Arithmetic, Output, Input
  • Variables, Types and Assignment
  • Logic and Computer Science, pseudocode