This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications—making this the ideal text for preparing students for advanced study.Table of Contents:PART 1) FUNDAMENTALS OF DISCRETE MATHEMATICS\nChapter 1: Fundamental Principles of CountingChapter \n2: Fundamentals of LogicChapter \n3: Set TheoryChapter \n4: Properties of the Integers - Mathematical InductionChapter \n5: Relations and FunctionsChapter \n6: Languages - Finite State MachinesChapter \n7: Relations - The Second Time AroundPART 2) FURTHER TOPICS IN ENUMERATIONChapter \n8: The Principle of Inclusion and ExclusionChapter \n9: Generating FunctionsChapter \n10: Recurrence RelationsPART 3) GRAPH THEORY AND APPLICATIONSChapter \n11: An Introduction to Graph TheoryChapter \n12: TreesChapter \n13: Optimization and MatchingPART 4) MODERN APPLIED ALGEBRAChapter \n14: Rings and Modular ArithmeticChapter \n15: Boolean Algebra and Switching FunctionsChapter \n16: Groups, Coding Theory, and Polya's Theory of EnumerationChapter \n17: Finite Fields and Combinatorial Designs.