This third edition offers an introduction to discrete mathematics, covering relations, induction, counting techniques, logic and graphs. More advanced topics of Boolean algebra and permutation groups are included, and there are numerous examples to reinforce the material.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Informal but thorough in its coverage, this introduction to discrete mathematics offers a carefully graded treatment of the basics essential to computer science.From the Back Cover:
Presenting conceptual chains in an orderly and gradual fashion, this informal but thorough introduction to discrete mathematics offers a careful treatment of the basics essential for computer science such as relations, induction, counting techniques, logic, and graphs. It also covers the more advanced topics of Boolean algebra and permutation groups, and comes with a wealth of examples to reinforce material and to allow readers to view topics from several perspectives. The book includes new coverage of probability that examines such areas as random variables and distributions and new sections on the Euclidean algorithm and loop invariants, providing a powerful tool for designing algorithms and verifying their correctness.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.