For one- or two-term introductory courses in discrete mathematics. An accessible introduction to the topics of discrete math, this best-selling text also works to expand students' mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topics serves to reinforce understanding. The text models various problem-solving techniques in detail, then provides opportunity to practice these techniques. The text also builds mathematical maturity by emphasizing how to read and write proofs. Many proofs are illustrated with annotated figures and/or motivated by special Discussion sections. The side margins of the text now include "tiny URLs" that direct students to relevant applications, extensions, and computer programs on the textbook website.
This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics.
The first edition was widely well received, with its whimsical writing style and numerous exercises and materials that engaged students at all levels. The new, expanded edition continues to facilitate effective and active learning.
This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.
Praise for the German edition ... This book is a well-written introduction to discrete mathematics and is highly recommended to every student ofmathematics and computer science as well as to teachers of these topics.
Applications are included throughout the text and are sourced from a variety of disciplines, including biology, economics, music, and more.
Discrete Mathematics and its Applications, Sixth 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.
Graph study is discussed, including Euler and Hamilton cycles and trees. This is a vehicle for some easy proofs, as well as serving as another example of a data structure. Matrices and vectors are then defined.
The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction.
The text is designed to motivate and inspire the reader, encouraging further study in this important skill.
&Quot;Essentials of Discrete Mathematics is the ideal text for a one-term discrete mathematics course to serve computer science majors as well as students from a wide range of other disciplines.