Synopsis
Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well.
A manual of selected solutions is available for sale to students; see sidebar. A complete solution manual is available free to instructors who have adopted the book as a required text. To request a copy of the complete solutions contact Susannah Sieper at 303-817-1996 or email [email protected].
The authors have created an Errata sheet, which they update periodically.
Selected excerpts are available for evaluation: - Contents - Instructor's Preface - Chapter Summaries - Recursive Algorithms - Induction and Recursive Algorithms - Shortest Paths - Combinatorial Identities and Combinatorial Arguments
Booknews
A text for a half- or full-year course in discrete mathematics, written in a clear and lively style. Emphasis is on themes and ideas, with detailed study of algorithms and recursive and inductive paradigms. Contains chapters on mathematical preliminaries, difference equations, logic, algorithmic linear algebra, and infinite processes. Includes worked examples, problems, and hints and answers. Designed for better prepared students, with lengthy discussion within problems, material presents topics of interest to a wide variety of students, not just computer science and math majors. Annotation c. by Book News, Inc., Portland, Or.