Includes bibliographical references (pages 537-538)
CONTENTS NOTE
Text of Note
Theme: the basics. Counting and proofs -- Sets and logic -- Graphs and functions -- Induction -- Algorithms with ciphers -- Theme: combinatorics. Binomial coefficients and Pascal's triangle -- Balls and boxes and PIE: counting techniques -- Recurrences -- Cutting up food: counting and geometry -- Theme: graph theory. Trees -- Euler's formula and applications -- Graph traversals -- Graph coloring -- Other material. Probability and expectation -- Fun with cardinality
0
SUMMARY OR ABSTRACT
Text of Note
"Suitable for an introductory course in discrete mathematics, this textbook has few mathematical prerequisites and does not assume any prior exposure to proofwriting. Still, it covers the standard and practical topics required in a discrete mathematics course and fits the curriculum as outlined in the SIGCSE guidelines, focusing on content rather than technique. Particularly amenable to discovery- or inquiry-based learning, the text includes many exercises and classroom activities, and the author has incorporated instructor's notes at the end of every chapter"--