Author: Eric Gossett
Market_Desc: As a textbook for discrete mathematics courses at the sophomore and/or junior level for both mathematics and computer science majors; and academic libraries. A prerequisite for this book includes completion of the introductory calculus sequence. Special Features: · Emphasizes proof (combinatorial and non-combinatorial) throughout in the text and exercises, and homework problems have been designed to reinforce the book's main concepts· Contains many examples that are not present in most discrete mathematics books, including the deferred acceptance algorithm, the Boyer-Moore algorithm for pattern matching, Sierpinski curves, Persian rugs, adaptive quadrature, the Josephus problem, the five color theorem, and relational databases· Features of the new edition include an increased use of combinatorial proofs, many new exercises, an extended discussion on elementary number theory, a complete reorganization of the definitions and theorems, among others· Supplemented with an Instructor's Manual containing detailed solutions to every exercise (available upon request to the Publisher). Detailed solutions are also available in the back of the book for selected exercises.· Includes Quick Check problems at critical points in the reading, and it is intended for these problems to be solved before moving on to the next section in the chapter. Also, many worked examples can be found throughout, which are used to motivate the presented theorems and illustrate the conclusion of a theorem.· Features many important examples from the field of computer science, including the Halting problem, Shannon's mathematical model of information, XML, and Normal Forms in relational databases About The Book: Discrete mathematics has become increasingly popular in recent years due to its growing applications in the field of computer science. Discrete Mathematics with Proof, Second Edition continues to facilitate an up-to-date understanding of this important topic, exposing readers to a wide range of modern and technological applications. The book begins with an introductory chapter that provides an accessible explanation of discrete mathematics. Subsequent chapters explore additional related topics including counting, finite probability theory, recursion, formal models in computer science, graph theory, trees, the concepts of functions, and relations.In addition, approximately 500 examples and over 2,800 exercises are presented throughout the book to motivate ideas and illustrate the proofs and conclusions of theorems. Assuming only a basic background in calculus, Discrete Mathematics with Proof, Second Edition is an excellent book for mathematics and computer science courses at the undergraduate level. It is also a valuable resource for professionals in various technical fields who would like an introduction to discrete mathematics.