Discrete and combinatorial Mathematics: An applied introduction Ed 5
Ralph P Grimaldi
Discrete and combinatorial Mathematics: An applied introduction Ed 5 - 5 - Uttar Pradesh Pearson India education services Pvt Ltd 2024 - 1008 p. PB 25x20 cm.
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 Chapter 1: Fundamental Principles of Counting Chapter 2: Fundamentals of Logic Chapter 3: Set Theory Chapter 4: Properties of the Integers - Mathematical Induction Chapter 5: Relations and Functions Chapter 6: Languages - Finite State Machines Chapter 7: Relations - The Second Time Around PART 2) FURTHER TOPICS IN ENUMERATION Chapter 8: The Principle of Inclusion and Exclusion Chapter 9: Generating Functions Chapter 10: Recurrence Relations PART 3) GRAPH THEORY AND APPLICATIONS Chapter 11: An Introduction to Graph Theory Chapter 12: Trees Chapter 13: Optimization and Matching PART 4) MODERN APPLIED ALGEBRA Chapter 14: Rings and Modular Arithmetic Chapter 15: Boolean Algebra and Switching Functions Chapter 16: Groups, Coding Theory, and Polya's Theory of Enumeration Chapter 17: Finite Fields and Combinatorial Designs
9789353433055
Mathematics
511 / GRID
Discrete and combinatorial Mathematics: An applied introduction Ed 5 - 5 - Uttar Pradesh Pearson India education services Pvt Ltd 2024 - 1008 p. PB 25x20 cm.
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 Chapter 1: Fundamental Principles of Counting Chapter 2: Fundamentals of Logic Chapter 3: Set Theory Chapter 4: Properties of the Integers - Mathematical Induction Chapter 5: Relations and Functions Chapter 6: Languages - Finite State Machines Chapter 7: Relations - The Second Time Around PART 2) FURTHER TOPICS IN ENUMERATION Chapter 8: The Principle of Inclusion and Exclusion Chapter 9: Generating Functions Chapter 10: Recurrence Relations PART 3) GRAPH THEORY AND APPLICATIONS Chapter 11: An Introduction to Graph Theory Chapter 12: Trees Chapter 13: Optimization and Matching PART 4) MODERN APPLIED ALGEBRA Chapter 14: Rings and Modular Arithmetic Chapter 15: Boolean Algebra and Switching Functions Chapter 16: Groups, Coding Theory, and Polya's Theory of Enumeration Chapter 17: Finite Fields and Combinatorial Designs
9789353433055
Mathematics
511 / GRID
