CS50 satisfies the PAC 3 requirement.
The fall 2002 version of CS50 meets three times a week in Andrew 257. The lectures are on Mondays and Wednesdays from 1:15-2:30; the labs are on Fridays from 1:15-2:30.
The TA is Thomas Elgin (thomas.elgin@pomona.edu). He will be around to help with the labs on Friday. He will also hold "office hours" in Andrew 257 from 8 to 9PM on Thursdays.| Week | Monday | Wednesday | Friday (lab) |
|---|---|---|---|
| 9/02 | *no class - labor day* | intro to cs50 <ps> <pdf> | using emacs, javac <ps> <pdf> |
| 9/09 | objects, classes, methods <ps> <pdf> | objects, classes, methods <ps> <pdf> <code> | using/implementing classes <ps> <pdf> |
| 9/16 | fundamental data types <ps> <pdf> <code> | computer arithmetic <ps> <pdf> <code> | Math class, implementing classes <ps> <pdf> |
| 9/23 | applets & graphics <ps> <pdf> | applets & graphics <ps> <pdf> <survey> | applets & graphics <ps> <pdf> |
| 9/30 | selection <ps> <pdf> | selection, iteration <ps> <pdf> | iteration, input <ps> <pdf> |
| 10/07 | review | *Midterm I* | random #s, simulation <ps> <pdf> |
| 10/14 | designing classes <ps> <pdf> | static variables, methods <ps> <pdf> | interfaces, polymorphism <ps> <pdf> |
| 10/21 | *no class - fall recess* | inheritance <ps> <pdf> | testing, debugging <ps> <pdf> |
| 10/28 | inheritance, recursion <ps> <pdf> | recursion <ps> <pdf> | recursion <ps> <pdf> |
| 11/04 | arrays (1d) <ps> <pdf> | arrays (1d and 2d) <ps> <pdf> | arrays <ps> <pdf> |
| 11/11 | review | *Midterm II* | exceptions <ps> <pdf> |
| 11/18 | files <ps> <pdf> | files, GUIs <ps> <pdf> | GUIs, event-driven programming <ps> <pdf> |
| 11/25 | event-driven prog, sorting <ps> <pdf> | sorting, demo <ps> <pdf> | *no class - Thanksgiving* |
| 12/02 | sorting, big-O notation <ps> <pdf> | sorting, big-O notation <ps> <pdf> | searching <ps> <pdf> |
| 12/09 | data structures <ps> <pdf> | wrap-up | *no class - end of semester* |