Algorithms Course Materials (uiuc.edu) 180 points by afshinmeh on June 30, 2013 | hide | past | favorite | 13 comments

 This is Jeff Erickson's free textbook (really a set of detailed lecture notes) on Algorithms, a course that Jeff teaches at UIUC and routinely wins teaching awards for. Definitely worth your time. Jeff is working on a similar set of notes for Computational Topology: http://www.cs.uiuc.edu/~jeffe/teaching/comptop/schedule.html. These are not as developed yet. He's also written an interesting piece about getting into a graduate school with low grades: http://3dpancakes.typepad.com/ernie/2005/03/re_phd_with_low.....
 You just got me REALLY interested in the Fast Fourier Transform.
 Have fun:E.g., there isEnders A. Robinson, 'Multichannel Time Series Analysis with Digital Computer Programs', Holden-Day, San Francisco.So, the main application here is finding oil! So, go "boom" and send a sound wave into the earth. At each different layer, get back a reflection of part of the energy. So, to get back just the layers, just use the FFT.Also have fun with X-ray diffraction, holography, etc.For signal processing, the core foundational point is that a 'time-invariant linear system' can be fully described by Fourier theory. Basically the output is a convolution of the input, and the fast way to do a convolution is with the FFT.The impact of the FFT on signal processing was enormous.Have fun!
 Yes algorithms courses are a bit of a grab bag. Really, whether you enjoy them just comes down to your interests. I loved learning algorithms because the important ideas can be conveyed without getting bogged down in applications. On top of that a lot of what I learned in CS will be useless in 20 years, but algorithms have lasting value.
 Concise, elegantly simple, and precisely measured for student consumption over one semester (16-17 weeks).Masterfully hidden from view are the edits, re-edits, discussions, Tex/Latex tutorials, file conversions, hand-written notes, lecture preps, student questions and a hundred other details that end in an 814 page treatise for humans to enjoy via that "other thing" they did at UIUC.Well done Jeff Erickson, et.al.
 "Describe and analyze an algorithm that determines, given a legal arrangement of standard pieces on a standard chess board, which player will win at chess from the given starting position if both players play perfectly"Ok, but [Hint: There is a one-line solution!]Am I missing something obvious like "it's always a draw"?
 You're missing that there is no need for the algorithm to be anywhere close to efficient. Just searching the whole game tree recursively will do it. Remember the draw rules in chess: if no one eats a figure for 50 turns or so, the game ends. Therefore, the game tree is actually of finite height, and the naive algorithm will eventually terminate.
 I am so excited to take this class. JeffE, from all accounts, is an amazing professor.
 Took this with Erickson back in Fall 2002 - go to all the lectures, they're worth it! And find a good study group, some of these homeworks are hard when learning them for the first time.have fun!
 Coursera is starting an Algorithm course July 1st if anyone wants to join: https://www.coursera.org/course/algo
 This is fantastic, thanks for this link!
 Nice materials! I just need this.

Search: