Discrete Mathematics

by John A. Dossey

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.

Genres: Mathematics, Reference

555 pages, Hardcover

First published January 1, 1901

Reviews

[Austin · Rating 2 out of 5]

Although I feel the book fit the purpose of helping me learn discrete mathematics, I felt it could have been both organized and written better. For example, in the first couple of chapters of the book the authors decide to write about topics which are not covered until chapters 8 and 9 (Combinations and Permutations, as well as trees and bridges).

I feel this book could have been better organized and/or had a more efficient method of writing each chapter.

[Earl · Rating 4 out of 5]

A good book in content and diverse information, but the author needs to explain processes better, many topics needed more details to flesh-out his message.