Discrete mathematics for computer science
/ Gary Haggard, John Schlipf and Sue Whitesides.
- New Delhi : Cengage Learning, 2009
- xxiii, 600 p. ; 24 cm. +
1. Sets, proof templates and induction 2. Formal logic 3. Relations 4. Functions 5. Analysis of algorithms 6. Graph theory 7. Counting and combinatorics 8. Discrete probability 9. Recurrence relations