Synopses & Reviews
Suitable for an introductory discrete mathematics course, this text covers the subfields of mathematics and computer science that fall under the general umbrella term. It fits the ideas of the basic curriculum as outlined in the SIGCSE guidelines into a framework that focuses on content rather than technique. The book covers standard and practical topics required in discrete math classes. The author also incorporates classroom activities as well as instructor 's notes at the end of every chapter.
Synopsis
Containing exercises and materials that engage students at all levels, Discrete Mathematics with Ducks presents a gentle introduction for students who find the proofs and abstractions of mathematics challenging. This classroom-tested text uses discrete mathematics as the context for introducing proofwriting.
Facilitating effective and active learning, each chapter contains a mixture of discovery activities, expository text, in-class exercises, and homework problems.
- Elementary exercises at the end of each expository section prompt students to review the material
- Try This sections encourage students to construct fundamental components of the concepts, theorems, and proofs discussed.
- Sets of discovery problems and illustrative examples reinforce learning.
- Bonus sections can be used for take-home exams, projects, or further study
- Instructor Notes sections offer suggestions on how to use the material in each chapter
Discrete Mathematics with Ducks offers students a diverse introduction to the field and a solid foundation for further study in discrete mathematics and complies with SIGCSE guidelines. The book shows how combinatorics and graph theory are used in both computer science and mathematics.