Discrete Math For Computer Science Students

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.

• | Author: Stahl Zsolt
• | Publisher: CreateSpace Independent Publishing Platform
• | Publication Date: Aug 28, 2016
• | Number of Pages: 344 pages
• | Language: English
• | Binding: Paperback
• | ISBN-10: 1537344161
• | ISBN-13: 9781537344164