Discrete Mathematics and Its Applications

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

I second Discrete Mathematics and its Applications. This book was the book I used in the first class that required a substantial amount of proof writing. A majority of it was easily tackled within a six week course.

First make sure you have a solid operational foundation on the basics. Advanced topics will feel so much easier. For that I can recommend Discrete Mathematics and its Applications by Kenneth H. Rosen. Optionally supplemented by Student's Solutions Guide for more elaborate answers to exercises. Do as many exercises as possible.

…me others languages that you have to learn. But, I am sure that these are the main three. In fact, you don't have to learn tonnes of language to be good in CS. From what you describe, you may be lack of some practical experience on programming. Try to work on some open source projects or your pet projects. But, I strongly recommend you to work on open source projects so that you can learn from other good programmers in the project. For Math, it is good for you to learn some basics of Discrete Math before you start learning some deep algorithms that may require more advanced math than high school math. I don't know any book that I can recommend to you. But, I am using "Discrete Mathematics and Its Applications" in my first semester in UIUC. The author of this book tried to relate Discrete Math with Computer Science. So, it may be a good he…

I've been casually studying along with this: http://aduni.org/courses/discrete/ The recommended text is Discrete Mathematics and its Applications , by Rosen, which is a mixed bag according to reviews but the consensus is generally good. AdUni provides a full series of video lectures and quite a bit of course material. Nearly all of the AdUni.org stuff is awesome (though the ancient Abelson and Sussman lectures are far better than the Yanco lectures at AdUni.org) and a great supplement to self-study. It's mostly taught by MIT grad students (which is what you'd get if you were taking the courses at MIT, so not a bad deal).