|ISBN: 9780073383095 / 0073383090
Division: Higher Education
Pub Date: JUN-11
|Discrete Mathematics and Its Applications
(Visiting Research Professor, Monmouth University, New Jersey)
|About the book|
Discrete Mathematics and its Applications, Seventh Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide a wide variety of real-world applications…from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.
Improved Introduction and Organization - For the seventh edition the first part of the book has been restructured to present core topics in a more efficient, more effective, and more flexible way.
Exercises and Worked Examples – There are over 3800 exercises and 750 examples in the text, from straightforward problems that develop basic skills to a large number of intermediate and challenging exercises. Exercise sets also contain special discussions that develop new concepts not covered in the text, enabling students to discover new ideas through their own work.
**Answers to ODD numbered problems are in the back of the book. WORKED OUT SOLUTIONS for these ODD numbered problems are in the PRINTED Student's Solutions Guide (0-07-7353501). Complete SOLUTIONS for the EVEN NUMBERED PROBLEMS are available for the Instructor ONLY in the Instructor's Resource Guide link under the Instructor Resources.
Historical Information, Biographies, and Updates on Latest Discoveries – The background of many topics are succinctly described in the text using historical footnotes and brief biographies of more than 65 mathematicians and computer scientists who were (and are) important contributors to discrete mathematics.
Clarity and Precision – Rosen’s writing style is direct and pragmatic. Precise mathematical language is used without excessive formalism and abstraction. Care has been taken to balance the mix of notation and words in mathematical statements.
More Flexible Organization – The dependence of chapters on previous material has been minimized to allow instructors flexibility to pick and choose topics. Each chapter is divided into sections of approximately the same length, and each section is divided into subsections that form natural blocks of material for teaching. Instructors can easily pace their lectures using these blocks. Separate chapters on Algorithms and Number Theory and Cryptography.
Accessibility – This text has proven to be easy to read and understand by beginning students. There are no mathematical prerequisites beyond college algebra for almost all of this text, and the few places in the book where calculus is referred to are explicitly noted.
* An updated Web Resources Guide containing new links to hundreds of external websites relevant to the text material.
* An updated Exploring Discrete Mathematics with Maple guide featuring new material tied to the text and full compatibility with Maple 10
* An updated Applications of Discrete Mathematics supplement containing in-depth explorations of applications, with exercises and projects
* Additional instructor resources for in-class use, such as printable tests, image banks, lecture notes, and materials donated by our community of users
Expanded Coverage of Logic and Sets - helps students better understand these fundamental concepts using well known examples like Sudoku and Hilbert's Grand Hotel.
New and Enhanced Features in the Text - The seventh edition offers improvements that make the text easier and more rewarding to use. Margin notes, added explanation and detail, revision of examples and problems, and Bourbaki's "dangerous bend" symbol to alert students to topics that require extra attention have been added to keep students on track.
|About the author|
Kenneth H. Rosen is a Distinguished Member of the Technical Staff at AT&T Laboratories in Middletown, New Jersey. His current assignment involves the assessment of new technology and the creation of new services for AT&T. Dr. Rosen has written several leading textbooks and many articles. Rosen received his Ph.D. from MIT.
|Table of contents|
Chapter 1: The Foundations: Logic and Proofs
Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, Matrices
Chapter 3: Algorithms
Chapter 4: Number Theory and Cryptography
Chapter 5: Induction and Recursion
Chapter 6: Counting
Chapter 7: Discrete Probability
Chapter 8: Advanced Counting Techniques
Chapter 9: Relations
Chapter 10: Graphs
Chapter 11: Trees
Chapter 12: Boolean Algebra
Chapter 13: Modeling Computation