[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Quizzes] [Questions] [Risks] [Examples]

Week 01: Background | |||

Monday, January 24, 2000Introduction to the CourseReading: Introductory Handout |
Tuesday, January 25, 2000Lab: Getting Started in the MathLANReading: Handout: Getting Started in the MathLAN |
Wednesday, January 26, 2000Markup LanguagesReading: Handout: Abbreviated Guide to HTML |
Friday, January 28, 2000Lab: HTMLReading: Handout: Getting Started with HTML |

Week 02: Algorithms | |||

Monday, January 31, 2000HTML, Experimentation and ReflectionsReading: none |
Tuesday, February 1, 2000Logical vs. Physical Formatting, RevisitedReading: Scan the documentation for cascading style sheets |
Wednesday, February 2, 2000The Building Blocks of Computer ProgramsReading: Dewdney 1 (Algorithms), 17 (The Random Access Machine), 48 (The SCRAM) |
Friday, February 4, 2000The Parts of an AlgorithmReading: Dewdney 21 (The Newton-Raphson Method) |

Week 03: Analyzing Algorithms | |||

Monday, February 7, 2000Analyzing AlgorithmsReading: Dewdney 15 (Time and Space Complexity) |
Tuesday, February 8, 2000SearchingReading: None |
Wednesday, February 9, 2000SortingReading: None |
Friday, February 11, 2000Sorting, RevisitedReading: Dewdney 35 (Sequential Sorting), 40 (Heaps and Merges) |

Week 04: Introduction to Ethical Issues | |||

Monday, February 14, 2000Background for Ethical IssuesReading: Forester&Morrison 1 (Introduction) |
Tuesday, February 15, 2000Computer Crime and MoralityReading: Forester&Morrison 2 (Computer Crime) |
Wednesday, February 16, 2000Computer Crime, RevisitedReading: None |
Friday, February 18, 2000Detour: Growing a LanguageReading: None |

Week 05: Miscellaneous Topics | |||

Monday, February 21, 2000Open Source SoftwareReading: Guy Steele, Growing a Languageand Eric Raymond, The Cathedral and the Bazaar |
Tuesday, February 22, 2000Class CancelledReading: None |
Wednesday, February 23, 2000Public-Key CryptographyReading: Dewdney 37 (Public-Key Cryptography) |
Friday, February 25, 2000Computer VirusesReading: Forester&Morrison 4 (Hacking and Viruses) and Dewdney 60 (Computer Viruses) |

Week 06: JavaScript | |||

Monday, February 28, 2000Introduction to JavaScriptReading: None |
Tuesday, February 29, 2000Lab: Introduction to JavaScriptReading: None |
Wednesday, March 1, 2000Lab: Some Simple JavaScriptsReading: None |
Friday, March 3, 2000More Sample JavaScriptsReading: None |

Week 07: JavaScript, Continued | |||

Monday, March 6, 2000Lab: Control Structures, ReconsideredReading: None |
Tuesday, March 7, 2000Reflections on JavaScriptReading: None |
Wednesday, March 8, 2000Final Reflections on JavaScriptReading: None |
Friday, March 10, 2000No ClassReading: None |

Week 08: Reliability | |||

Monday, March 13, 2000Some Reliability ConsiderationsReading: Forester&Morrison 5 (Unreliable Computers) |
Tuesday, March 14, 2000Proving Programs CorrectReading: Dewdney 10 (Program Correctness) |
Wednesday, March 15, 2000The Costs of ReliabilityReading: None |
Friday, March 17, 2000PacMan, RevisitedReading: None |

Week 09: Artificial Intelligence | |||

Monday, April 3, 2000Introduction to Artificial IntelligenceReading: Forester&Morrison 7 (Artificial Intelligence and Expert Systems) |
Tuesday, April 4, 2000Game TreesReading: Dewdney 6 (Game Trees) |
Wednesday, April 5, 2000Expert SystemsReading: Dewdney 58 (Predicate Calculus) Dewdney 64 (Logic Programming) |
Friday, April 7, 2000Expert Systems, RevisitedReading: None |

Week 10: More Artificial Intelligence | |||

Monday, April 10, 2000Neural NetworksReading: Dewdney 27 (Perceptrons) 36 (Neural Networks that Learn) |
Tuesday, April 11, 2000Genetic AlgorithmsReading: Dewdney 16 (Genetic Algorithms) |
Wednesday, April 12, 2000AI ExperimentsReading: None |
Friday, April 14, 2000Evaluating AIReading: None |

Week 11: What is Computable? | |||

Monday, April 17, 2000Models of ComputationReading: Dewdney 2 (Finite Automata) 7 (The Chomsky Hierarchy) 66 (Church's Thesis) |
Tuesday, April 18, 2000Costs of ComputingReading: Dewdney 26 (Nondeterminism), 54 (NP-Complete Problems) |
Wednesday, April 19, 2000The Limits of ComputingReading: Dewdney 5 (Godel's Theorem) 59 (The Halting Problem) |
Friday, April 21, 2000Planning for the Rest of the SemesterReading: None |

Week 12: Student Presentations | |||

Monday, April 24, 2000Software PiracyReading: Forester and Morrison 3 |
Tuesday, April 25, 2000PrivacyReading: Forester and Morrison 6 |
Wednesday, April 26, 2000Ethics OverviewReading: Forester and Morrison Thought Questions |
Friday, April 28, 2000Analog ComputationReading: Dewdney 33 (Analog Computers) |

Week 13: | |||

Monday, May 1, 2000Autonomous SystemsReading: Handout |
Tuesday, May 2, 2000Operating Systems (I)Reading: Dewdney |
Wednesday, May 3, 2000Operating Systems (II)Reading: Handout |
Friday, May 5, 2000Computerizing the WorkplaceReading: Forester and Morrison 8 |

Week 14: | |||

Monday, May 8, 2000Random NumbersReading: Dewdney 8 or http://www.cs.auckland.ac.nz/CDMTCS/chaitin/ |
Tuesday, May 9, 2000Core WarsReading: Handout |
Wednesday, May 10, 2000Course EvaluationReading: None |
Friday, May 12, 2000Course SummaryReading: None |

[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Quizzes] [Questions] [Risks] [Examples]

**Disclaimer** Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS105/2000S/Handouts/glance.html

Source text last modified Sat Jan 22 23:36:32 2000.

This page generated on Wed May 10 09:04:33 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu