4
$\begingroup$

A student studying Computer Science requires some knowledge of finite mathematics, including logic, probability, counting, etc. In the use-case at hand, a HS or University course in finite math is not an option as the student is self studying.

What are good resources by which a student can learn the necessary material to support a CS degree? These could be books or online resources or perhaps other things not yet considered.

However, one essential aspect is that the student needs access to materials by which the topics can be practiced, not just read about. Resources with lots of exercises at different levels with a way to obtain feedback (answer key or other) would be essential.

Improve this question
$\endgroup$
2
  • $\begingroup$ The necessary material surely depends on the syllabus of the CS degree. I don't remember ever needing probability or combinatorics (which I assume is what you mean by "counting"). Could you be more specific about the requirements? $\endgroup$
    – Peter Taylor
    Commented Jan 29, 2018 at 9:32
  • $\begingroup$ Courses in finite/discrete math often include at least elementary combinatorics and some probability. I'm surprised yours had no need of it at all. $\endgroup$
    – Buffy
    Commented Jan 29, 2018 at 12:10

2 Answers 2

Reset to default
3
$\begingroup$

John Kemeny et all have published a set of books on Finite Mathematics that are classics. They have lots of exercises but no solutions in the books themselves. However, the solutions guide may be available for some of them online or especially at eBay with a suitable search.

One of the classics is Finite Mathematics with Business Applications. Don't let the title fool you. It is serious mathematics.

Another, more common and possibly lighter weight book is Introduction to Finite Mathematics

These books are both old and out of print, but readily available. I think the latter one is available as a PDF online (but without answers).

Improve this answer
$\endgroup$
3
$\begingroup$

Most of the maths in undergraduate CS is proof by structural induction (and we do at least in part deserve the reputation we have among mathematicians of not knowing that there are other proof techniques). That technique apart, the "non-CS" maths can be more than covered by chapters 2 and 4 of Concrete Mathematics, Graham, Knuth, and Patashnik, ISBN: 0-201-55802-5. This book contains many exercises and solutions thereof, or hints in the case of unsolved problems. There are PDFs available online, but I'm not sure whether they're authorised so I won't link to any.

Improve this answer
$\endgroup$
3

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.