One course I've been going through lately is the MIT course on Abstract Interpretation ( <a href="http://web.mit.edu/16.399/www/" rel="nofollow">http://web.mit.edu/16.399/www/</a> ). Programmers tend to break execution into "cases" to reason about it; e.g.: when writing a routine to reverse a string, you might think about the cases where the string is of even or odd length. Abstract Interpretation lets you capture this kind of reasoning precisely, and thereby automate it.
MIT's OpenCourseWare is a fantastic project. It's been a while since I was involved with it, but I contacted them a few years ago and helped TeX up some of the notes (for Physics courses, not CS). Anyhow, if you feel inspired or just want to learn a subject even better by reading its notes carefully enough to typeset them, consider contacting OCW and asking if they've got anything available. It's a good experience and it's nice to think about how many people benefit from it.
Why does a HS/freshman-level discrete math course count as "advanced"? Same with that undergrad algorithms course at UIUC (though it <i>does</i> have great lecture notes).
This[1] is much more comprehensive and useful, imo. Compiled by the good folk from 4chan's /sci/ board.<p>[1]: <a href="https://sites.google.com/site/scienceandmathguide/" rel="nofollow">https://sites.google.com/site/scienceandmathguide/</a>
I had taken Jon Kleinberg’s CS 6850 – Structure of Information Networks. (<a href="http://www.cs.cornell.edu/courses/cs6850/2011sp/" rel="nofollow">http://www.cs.cornell.edu/courses/cs6850/2011sp/</a>)<p>Really brilliant course and very pertinent to interpreting and making sense of today’s connected world.
I'll add a couple of courses I've really enjoyed at CMU (<a href="http://www.cs.cmu.edu" rel="nofollow">http://www.cs.cmu.edu</a>):<p>15-410 Operating System Design and Implementation:
<a href="http://www.cs.cmu.edu/~410/" rel="nofollow">http://www.cs.cmu.edu/~410/</a><p>15-251 Great Theoretical Ideas in Computer Science (webpage might be out of date):
<a href="http://www.andrew.cmu.edu/course/15-251/" rel="nofollow">http://www.andrew.cmu.edu/course/15-251/</a>
Some of these courses look really interesting. Having just passed my Algorithms Qual it is interesting to see the different ranges of topics covered in equivalent courses.
Nice, but seems to me that a thorough study of Knuth V-1-4 plus computational Mathematics might be a better approach. Then cherry pick the offered list.