I've been watching MIT's Mathematics for Computer Science, from Fall 2010 whilst reading Concrete Mathematics. Honestly the topic seems like a hodgepodge of ideas. I can follow about 2/3 of the material quite well so far but the other 1/3 is a big hurdle. At my current college nothing but calculus, differential equations and linear algebra are offered.
I'm currently in a Calculus III course which covers series, but my question is if I were to step back and build a primer for discrete math, combinatorics and graph theory(math subjects with applications to computer science as I am a CS student pursuing a math minor) how might I start doing that?
I have watched all of Gilbert Strang's and Norman Wildberg's lectures on linear algebra, while also having done a lot of work through Strang's and Lay's textbook. I feel like at my level that my Linear is quite strong as I can tutor it despite not having taken the course yet.
What is a direction that I could go that would be productive use of my time? I am not the best calculus student as I find that subject quite boring and not as applicable for computer science as far as I've seen. I guess I'm not only looking for a list of textbooks? Are there good books on nurturing a thinking process of doing the sort of math I asked? I've read Proof and Refutations by Imre Lakatos and have checked out Pólya's How to Solve It.