Reddit mentions of Discrete Mathematics with Applications

The hardest two classes in my studies were Discrete Structures and Analysis of Algorithms. Mainly because they were so math-heavy.

• Discrete Mathematics with Applications, 5th Edition
  
  
• Introduction to Algorithms, 3rd Edition (aka CLRS)
  
  The material in the former is really critical to the later. If you can make it through the first 3 or 4 chapters of CLRS, you're golden.
  
  Good luck!

I would recommend these books:

https://www.amazon.ca/How-Prove-Structured-Daniel-Velleman/dp/1108439535/ref=dp_ob_title_bk

https://www.amazon.ca/Discrete-Mathematics-Applications-Susanna-Epp/dp/1337694193/ref=dp_ob_title_bk

https://www.teach.cs.toronto.edu/~csc165h/winter/resources/csc165_notes.pdf

​

The two top books were actually recommended as guides at the time when I took CSC165 last year. The last one is the actual course notes for 165. They're all pretty intro level stuff and there is some overlap, but good resources. Yeah, I guess the best strategy would be to just read the actual course notes, then look at the others for more detail. That's the approach I used when I took 165, but I didn't have the summer before to prepare, so you've got a nice advantage.