syllabus
title: Algorithms
number: NSC469
faculty: Jim Mahoney
credits: 4
time: Tue/Thu 11:30 - 12:50
place: Sci 217
level: intermediate
prereq: some programming and discrete math
work: weekly assignments and midterm/final projects or exams TBA
text: Algorithms, Dasgupta et al
ISBN 0073523402
($32 from amazon, or free pdf at
http://www.cs.berkeley.edu/~vazirani/algorithms.html)
blurb:
A close look at the classic recipes and the ideas behind
them in computer science. Topics may include ideas from
searching, sorting, data structures, randomness, compression,
parsing, cryptography and so on. This is an intermediate level
foundation course, strongly recommended for folks considering
further work in computer science. The primary programming
language will (I think) be C, though some assignments may
be done in one of your choice.
(We'll discuss this at the start of the term.)
