
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
The strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Computational and algorithmic exercise sets follow each chapter section and supplementary exercises and computer projects are included in the end-of-chapter material. This Fifth Edition features a new Chapter 3 covering matrix codes, error correcting codes, congruence, Euclidean algorithm and Diophantine equations, and the RSA algorithm.MARKET: Intended for use in a one-semester introductory course in discrete mathematics.
This manual provides the structured solutions and methodological guidance necessary to master the foundational concepts of discrete mathematics. Author John A. Dossey supports the pedagogical framework of the primary text by offering step-by-step breakdowns of algorithmic exercises. The content is designed to reinforce analytical skills and problem-solving techniques essential for students navigating introductory discrete mathematics coursework.
What You Will Find
Instructors and students frequently utilize this manual as a primary reference for verifying complex mathematical proofs and algorithmic logic. The text is noted for its clarity and direct alignment with the curriculum of introductory discrete mathematics courses.
Page Count:
240
Publication Date:
2001-01-01
Publisher:
Addison-Wesley
ISBN-10:
0201754835
ISBN-13:
9780201754834
No comments yet. Be the first to share your thoughts!