CS173 at UIUC: https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/Lec...

ArsDigita Discrete Mathematics course (this one gives a really gentle start):

http://www.aduni.org/courses/discrete/index.php?view=cw

MIT Mathematics for Computer Science (harder but still not that hard):

http://ocw.mit.edu/courses/electrical-engineering-and-comput...

Steve Skienna discrete mathematics course (graduate course based on Knuth's "Concrete Mathematics", quite hard):

http://www3.cs.stonybrook.edu/~algorith/math-video/

I also recommend checking out some books:

http://infolab.stanford.edu/~ullman/focs.html - free "Foundations of Computer Science" book that combines discrete mathematics with C programming and some theory of computation stuff, a pretty good way to make things more practical

http://www.amazon.com/Discrete-Mathematics-Elementary-Beyond... - very pleasant introductory discrete mathematics book, a welcome break from the usual "brick" format and covers some important topics that often do not make it into the normal discrete mathematics curriculum e.g. induction on trees.

http://www.amazon.com/Introductory-Combinatorics-Modern-Birk... - classic introduction to combinatorics

CS 103 at Stanford: http://web.stanford.edu/class/cs103/

The course reader [1] covers the first half of the class and is pretty good.

[1] http://web.stanford.edu/class/cs103/notes/Mathematical%20Fou...

This isn't a course but this book has been consistently word-of-mouth recommended as a comprehensive survey of undergraduate mathematics.

http://www.amazon.com/Mathematics-Content-Methods-Meaning-Do...

CS70 at Berkeley is always a good bet, the notes available online are fantastic.