Discrete And Combinatorial Mathematics

Ralph P. Grimaldi

ISBN 10: 9353433053 / ISBN 13: 9789353433055

Published by Pearson India, 2019

About this Item

ISBN:9789353433055,Territorial restriction maybe printed on the book. This is an Int'l edition, ISBN and cover may differ from US edition, Contents same as US edition.

Seller Inventory # 2436835

Bibliographic Details

• Title: Discrete And Combinatorial Mathematics
• Publisher: Pearson India
• Publication Date: 2019
• Language: English
• ISBN 10: 9353433053
• ISBN 13: 9789353433055
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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 MATHEMATICSChapter 1: Fundamental Principles of CountingChapter 2: Fundamentals of LogicChapter 3: Set TheoryChapter 4: Properties of the Integers - Mathematical InductionChapter 5: Relations and FunctionsChapter 6: Languages - Finite State MachinesChapter 7: Relations - The Second Time AroundPART 2) FURTHER TOPICS IN ENUMERATIONChapter 8: The Principle of Inclusion and ExclusionChapter 9: Generating FunctionsChapter 10: Recurrence RelationsPART 3) GRAPH THEORY AND APPLICATIONSChapter 11: An Introduction to Graph TheoryChapter 12: TreesChapter 13: Optimization and MatchingPART 4) MODERN APPLIED ALGEBRAChapter 14: Rings and Modular ArithmeticChapter 15: Boolean Algebra and Switching FunctionsChapter 16: Groups, Coding Theory, and Polya's Theory of EnumerationChapter 17: Finite Fields and Combinatorial Designs. 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 MATHEMATICSChapter 1: Fundamental Principles of CountingChapter 2: Fundamentals of LogicChapter 3: Set TheoryChapter 4: Properties of the Integers - Mathematical InductionChapter 5: Relations and FunctionsChapter 6: Languages - Finite State MachinesChapter 7: Relations - The Second Time AroundPART 2) FURTHER TOPICS IN ENUMERATIONChapter 8: The Principle of Inclusion and ExclusionChapter 9: Generating FunctionsChapter 10: Recurrence RelationsPART 3) GRAPH THEORY AND APPLICATIONSChapter 11: An Introduction to Graph TheoryChapter 12: TreesChapter 13: Optimization and MatchingPART 4) MODERN APPLIED ALGEBRAChapter 14: Rings and Modular ArithmeticChapter 15: Boolean Algebra and Switching FunctionsChapter 16: Groups, Coding Theory, and Polya's Theory of EnumerationChapter 17: Finite Fields and Combinatorial Designs.