Book Description :-
This book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques with woven techniques of proofs into the text as a running theme. Each chapter has a problem-solving corner that shows students how to attack and solve problems. By taking advantage of readily available technology, the authors eliminate most of the specialized techniques for deriving formulas for solutions found in traditional texts and replace them with topics that focus on the formulation Discrete Mathematics. The topics are based upon the recommendations of various professional organizations, including those of the MAAs Panel on Discrete Mathematics in the First Two Years, the NCTMs Principles and Standards for School Mathematics, and the CBMSs recommendations for the mathematical education of teachers. Although designed for a one-semester course, the book contains more material then can be covered in either one semester or two quarters. Consequently, instructors will have freedom to choose topics tailored to the particular needs and interests of their students. The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deals with finite sets, particularly those areas relevant to business. The sequence of chapters allows considerable flexibility in teaching a course from this book. Although this book assumes only the familiarity with logic and proofs ordinarily gained in high-school geometry, Appendix A is provided for those who prefer a more formal treatment.
Book Details :-
Hardcover: 600 pages
Publisher: Addison Wesley; 4 edition (October 10, 2001)
Language: English
ISBN-10: 0321079124
ISBN-13: 978-0321079121
0 comments:
Post a Comment