This is an extremely “user friendly” book than the vast majority of similar ones. The text is written with the “beginning” reader in mind and has a conversational and stimulating style to make learning as much interesting as possible. The examples and exercises are integrated throughout each chapter. It also emphasizes “Active Reading,” a skill vital to success in learning how to think mathematically and to write clean, error-free programs. An indispensable book for computer science and even maths courses. FEATURES :
More than 300 worked examples and 3500 exercises. The problem sets are carefully graded by level of difficulty.
More than 150 Pauses (short questions)—inserted at strategic points. Full solutions to Pauses are included at the end of each section.
A free Student Solutions Manual is built into the back of the text.
A strong emphasis on graph theory, incorporating its coverage throughout six chapters.
A glossary of definitions and a list of symbols and notation.
IMPORTANT ADDITIONS TO THIS EDITION :
The chapter on “Proofs” is now spread to two chapters, the first mainly expository on proofs, the second focused on logic (truth tables, propositions).
Two sections on probability (2.4 and 2.5).
Section 11.3 on RNA chains has been rewritten to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest.
True/false questions (with all answers in the back of the book) have been added to every section.
An additional 900 exercises; complete solutions to an additional 200 exercises in the back of the book.
Many new exercises on mathematical induction, which is now one of the strongest, basic presentations available.
An appendix on matrices.
A number of new computer science applications.About the AuthorGOODAIRE EDGAR G., Memorial University of Newfoundland.|PARMENTER MICHAEL M., Memorial University of Newfoundland.
