Discrete Math for Computer Science Students

By Stahl Zsolt

Discrete Mathematics for Computer Science Students emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

• Format: Paperback
• Language: English
• ISBN: 1537344161
• ISBN13: 9781537344164
• Release Date: August 2016
• Publisher: Createspace Independent Publishing Platform
• Length: 346 Pages
• Weight: 1.02 lbs.
• Dimensions: 0.7" x 6.0" x 9.0"