An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


CSC105 At A Glance

Week 01: Background
Monday, January 24, 2000
Introduction to the Course
Reading: Introductory Handout
Tuesday, January 25, 2000
Lab: Getting Started in the MathLAN
Reading: Handout: Getting Started in the MathLAN
Wednesday, January 26, 2000
Markup Languages
Reading: Handout: Abbreviated Guide to HTML
Friday, January 28, 2000
Lab: HTML
Reading: Handout: Getting Started with HTML
Week 02: Algorithms
Monday, January 31, 2000
HTML, Experimentation and Reflections
Reading: none
Tuesday, February 1, 2000
Logical vs. Physical Formatting, Revisited
Reading: Scan the documentation for cascading style sheets
Wednesday, February 2, 2000
The Building Blocks of Computer Programs
Reading: Dewdney 1 (Algorithms), 17 (The Random Access Machine), 48 (The SCRAM)
Friday, February 4, 2000
The Parts of an Algorithm
Reading: Dewdney 21 (The Newton-Raphson Method)
Week 03: Analyzing Algorithms
Monday, February 7, 2000
Analyzing Algorithms
Reading: Dewdney 15 (Time and Space Complexity)
Tuesday, February 8, 2000
Searching
Reading: None
Wednesday, February 9, 2000
Sorting
Reading: None
Friday, February 11, 2000
Sorting, Revisited
Reading: Dewdney 35 (Sequential Sorting), 40 (Heaps and Merges)
Week 04: Introduction to Ethical Issues
Monday, February 14, 2000
Background for Ethical Issues
Reading: Forester&Morrison 1 (Introduction)
Tuesday, February 15, 2000
Computer Crime and Morality
Reading: Forester&Morrison 2 (Computer Crime)
Wednesday, February 16, 2000
Computer Crime, Revisited
Reading: None
Friday, February 18, 2000
Detour: Growing a Language
Reading: None
Week 05: Miscellaneous Topics
Monday, February 21, 2000
Open Source Software
Reading: Guy Steele, Growing a Language and Eric Raymond, The Cathedral and the Bazaar
Tuesday, February 22, 2000
Class Cancelled
Reading: None
Wednesday, February 23, 2000
Public-Key Cryptography
Reading: Dewdney 37 (Public-Key Cryptography)
Friday, February 25, 2000
Computer Viruses
Reading: Forester&Morrison 4 (Hacking and Viruses) and Dewdney 60 (Computer Viruses)
Week 06: JavaScript
Monday, February 28, 2000
Introduction to JavaScript
Reading: None
Tuesday, February 29, 2000
Lab: Introduction to JavaScript
Reading: None
Wednesday, March 1, 2000
Lab: Some Simple JavaScripts
Reading: None
Friday, March 3, 2000
More Sample JavaScripts
Reading: None
Week 07: JavaScript, Continued
Monday, March 6, 2000
Lab: Control Structures, Reconsidered
Reading: None
Tuesday, March 7, 2000
Reflections on JavaScript
Reading: None
Wednesday, March 8, 2000
Final Reflections on JavaScript
Reading: None
Friday, March 10, 2000
No Class
Reading: None
Week 08: Reliability
Monday, March 13, 2000
Some Reliability Considerations
Reading: Forester&Morrison 5 (Unreliable Computers)
Tuesday, March 14, 2000
Proving Programs Correct
Reading: Dewdney 10 (Program Correctness)
Wednesday, March 15, 2000
The Costs of Reliability
Reading: None
Friday, March 17, 2000
PacMan, Revisited
Reading: None
Week 09: Artificial Intelligence
Monday, April 3, 2000
Introduction to Artificial Intelligence
Reading: Forester&Morrison 7 (Artificial Intelligence and Expert Systems)
Tuesday, April 4, 2000
Game Trees
Reading: Dewdney 6 (Game Trees)
Wednesday, April 5, 2000
Expert Systems
Reading: Dewdney 58 (Predicate Calculus) Dewdney 64 (Logic Programming)
Friday, April 7, 2000
Expert Systems, Revisited
Reading: None
Week 10: More Artificial Intelligence
Monday, April 10, 2000
Neural Networks
Reading: Dewdney 27 (Perceptrons) 36 (Neural Networks that Learn)
Tuesday, April 11, 2000
Genetic Algorithms
Reading: Dewdney 16 (Genetic Algorithms)
Wednesday, April 12, 2000
AI Experiments
Reading: None
Friday, April 14, 2000
Evaluating AI
Reading: None
Week 11: What is Computable?
Monday, April 17, 2000
Models of Computation
Reading: Dewdney 2 (Finite Automata) 7 (The Chomsky Hierarchy) 66 (Church's Thesis)
Tuesday, April 18, 2000
Costs of Computing
Reading: Dewdney 26 (Nondeterminism), 54 (NP-Complete Problems)
Wednesday, April 19, 2000
The Limits of Computing
Reading: Dewdney 5 (Godel's Theorem) 59 (The Halting Problem)
Friday, April 21, 2000
Planning for the Rest of the Semester
Reading: None
Week 12: Student Presentations
Monday, April 24, 2000
Software Piracy
Reading: Forester and Morrison 3
Tuesday, April 25, 2000
Privacy
Reading: Forester and Morrison 6
Wednesday, April 26, 2000
Ethics Overview
Reading: Forester and Morrison Thought Questions
Friday, April 28, 2000
Analog Computation
Reading: Dewdney 33 (Analog Computers)
Week 13:
Monday, May 1, 2000
Autonomous Systems
Reading: Handout
Tuesday, May 2, 2000
Operating Systems (I)
Reading: Dewdney
Wednesday, May 3, 2000
Operating Systems (II)
Reading: Handout
Friday, May 5, 2000
Computerizing the Workplace
Reading: Forester and Morrison 8
Week 14:
Monday, May 8, 2000
Random Numbers
Reading: Dewdney 8 or http://www.cs.auckland.ac.nz/CDMTCS/chaitin/
Tuesday, May 9, 2000
Core Wars
Reading: Handout
Wednesday, May 10, 2000
Course Evaluation
Reading: None
Friday, May 12, 2000
Course Summary
Reading: None

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