Far more "user friendly" than the vast majority of similar books, this volume is truly written with the unsophisticated reader in mind. The pace is leisurely, but the authors are rigorous and maintain a serious attitude towards theorem proving throughout.
Emphasizes "Active Reading" throughout, a skill vital to success in learning how to write proofs. Offers two sections on probability (2.4 and 2.5). Moves material on depth-first search, which previously comprised an entire (very short) chapter, to an earlier chapter where it fits more naturally. Rewrites section on RNA chains to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest. Provides true/false questions (with all answers in the back of the book) in every section. Features an appendix on matrices.
A useful reference for mathematics enthusiasts who want to learn how to write proofs.
Six chapters are geared toward a sophomore course in discrete mathematics, and seven later chapters are for a junior course in graph theory. These later chapters are self-contained. Chapter Seven introduces the concepts of algorithm and complexity and serves as a final topic for the first course or an introduction to the second course. Includes worked examples and some 1,000 exercises arranged by difficulty, some with solutions. This text is more elementary and written in a more leisurely style than other comparable texts. Assumes no background in linear algebra or calculus. Annotation c. by Book News, Inc., Portland, Or.