syllabus
title: Algorithms
number: NSC469
faculty: Jim Mahoney
credits: 4
time: Mon/Thu 1:30-2:50pm
place: Sci 217
level: intermediate
prereq: some programming and discrete math
work: weekly assignments and midterm/final projects or exams TBA
text: "Introduction to the Design & Analysis of Algorithms, 2nd edition"
Anany Levitin, ISBN 0-321-35828-7
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 programming language will
be C, though some assignments may be done in one of your choice.
schedule: (tentative)
Mon/Thu text_chapter
Jan 25 (intro class Tue 23)
29, 1 1 - intro
Feb 5, 8 2 - efficiency analysis
12, 15 3 - brute force
19, 22 4 - divide and conquer
26, 1 5 - decrease
Mar 5, 8 6 - transform (midterms grades due 9th)
12, 15 7 - space vs time
-- spring break --
Apr 2, 5 9 - greedy
9, 12 10 - iterative improvement
16, 19 11 - P, NP, and all that
23, 26 12 - coping with limitations
30, 3 other - random, genetic, ...
May 7 (last day of classes Wed 9)
(reading days Thu/Fri 10/11)
(finals Sat 12 - Tue 15)
