When | Tuesday / Thursday 10:00-11:20am |

Where | Sci 217 |

Who | Jim Mahoney (mahoney@marlboro.edu) |

Credits | 4 ( i.e. 12 hours/week including class ) |

Level | Intermediate |

Prereq | permission of instructor |

Textbook | Mastering Algorithms with Perl by Orwant, Hietaniemi, and Macdonald
ISBN 1-56592-398-7 |

Website | http://cs.marlboro.edu/term/spring05/statistics/home.html |

A close look at the classic recipes and the ideas behind them in
computer science. Topics may include searching methods and data
structures, hashes, sorting, randomness, Turing machines, P/NP
completeness, compression, parsing, cryptography, logic resolution,
and so on, depending on student background and interests. This is an
intermediate level foundation course, strongly recommended for folks
considering further work in computer science. The programming language
used will be a combination of Perl and C, though you may be able to do
some work in other languages if you so choose.

Prerequisites: Previous programming experience and basic math
(Elementary Math Learning System or equivalent). If in doubt,
talk to Jim.

- Thur Jan 20
- generating permutations recursively, run times, gnuplot, O(N) graphics

- Tue Jan 25
- mention Benchmark.pm
- review C++
- more on permutations: group operation, parity, inverse
- O(N?) for finding parity of a given permutation?
- O(N?) for finding inverse of a given permutation?
- definition of turing machine ; see resources
- basics of "complexity theory": P and NP problems

Tu Th wk notes
------------------------------------------------
Jan 20 1 TW 18-19 intro
25 27 2
Feb 1 3 3
8 10 4
15 17 5
22 24 6
Mar 3 7 VT Town Meeting
8 10 8
spring break
29 31 9
Apr 5 7 10
12 14 11
19 21 12
26 28 13
May 3
Fri/Sat 5/6 reading days
Sun-Tues 7-9 finals
Wed 11 last work
Fri 13 final faculty mtg
Sat 15 commencement

last modified Tuesday Febuary 1 2005 7:22pm EST