Readings and Seminar Schedule, Foundations of Computing -- Fall 2000

Lectures and seminars: Tuesdays and Thursdays 5:30 -- 7:00 pm, L 1308 (Tuesdays) and L1316 (Thursdays)

Full references for the seminar readings, with URL's if available.

Last revised November 1, 2000. Use your browser's Reload or Refresh button to get the latest version.

Back to Fall quarter page.


WEEKDATESACTIVITY
WEEK 1 Sept. 26 Foundations of Computing program overview (Jon Jacky)
Sept. 28 Computer science education

Simply Scheme forward and preface (Jon Jacky)
The joys (and woes) of the craft Frederick Brooks (Ray Alvarado)
Teach Yourself Programming in Ten Years Peter Norvig (Tod Antilla)
WEEK 2 Oct. 3 Design judgment

Who cares about elegance? Bruce J. MacLennan
elegant, definition from the The Jargon File, Eric Raymond (ed.)
Introduction from R5RS, the Scheme standard
(all by Jenera Burton)

The rise of worse is better Richard Gabriel (Patrick Cavanaugh)
Oct. 5 Quantitative reasoning

The Back of the Envelope, Jon Bentley (Daniel Creech)
Perspective on Performance, Jon Bentley (Pamela Derkacht)
WEEK 3 Oct. 10 Scheme in use

VideoScheme: A Programmable Video Editing System ..., Matthews et al
(Uva Beatrice Dolezal, Kimberly Gutholm)
Oct. 12 Artificial Intelligence I

Roots of Artificial Intelligence, Herb Simon
(Diep Huynh, Sarah Jackson)
WEEK 4 Oct. 17 Artificial Intelligence II

Managing Plans of Action, Eugene Charniak and Drew McDermott
(Michael Jones, Son Le)
Oct. 19 Program design I

Simply Scheme Chapter 10: Tic-Tac-Toe, pages 147 -- 156
(Joan Mackey, Sandy McDonald)
WEEK 5 Oct. 24 Program design II

Simply Scheme Chapter 10: Tic-Tac-Toe, pages 157 - 166
(Don Mikler, Lance Miller)
Oct. 26 List Processing I: Constructors, Selectors, and Predicates

Simply Scheme Chapter 17: Lists, pages 281 -- 288, 290 -- 291
(Chris Moncrief, Kathy Pickens-Rucker)
WEEK 6 Oct. 31 List Processing II: Higher-Order Functions, Association Lists

Simply Scheme Chapter 17: Lists, pages 289 -- 290, 291 -- 292
(Jori Sackin, Debbie Sanders)
Nov. 2 Recursion I: Numbers and Lists

Simply Scheme pages 170 -- 171, 190 -- 194, 197 -- 200, 210 -- 213
(Eric Sabisch, Scott Smith, James Thompson)
WEEK 7 Nov. 7 Recursion II: Structured Lists

Simply Scheme pages 294 -- 298
(Minhtrung Vo, John Walker)
Nov. 9 Recursion III: Trees

Simply Scheme pages 305 -- 316
(Bruce West, Ray Alvarado)
WEEK 8 Nov. 14 Recursion IV: Sorting

Simply Scheme pages 235 -- 236, 238 -- 239
(Tod Antilla, Genera Burton)
Nov. 17 Input and Output I: Effects, Sequence and State

Simply Scheme pages 340 -- 341, 343 -- 365
(Patrick Cavanaugh, Daniel Creech)
BREAK Nov. 21 Thanskgiving break week --- no class
Nov 23 Thanksgiving holiday
WEEK 9 Nov. 28 Input and Output II: Files

Simply Scheme pages 387 -- 403
(Pam Derkacht, Beatrice Dolezal)
Nov. 30 The Truth About Lists (lecture, no reading assignment)
(Jon Jacky)
WEEK 10 Dec. 5 Scheme and Functional Programming, Review and Summary (lecture, no reading)
(Jon Jacky)
Dec. 7 Review, Q & A
(all)
EVALUATION Dec. 10 Evaluation meetings
Dec. 14 Evaluation meetings

Jon Jacky, jackyj@evergreen.edu