Discrete and Combinatorial Mathematics , 5e
Discrete and Combinatorial Mathematics , 5e is backordered and will ship as soon as it is back in stock.
Couldn't load pickup availability
Genuine Products Guarantee
Genuine Products Guarantee
We guarantee 100% genuine products, and if proven otherwise, we will compensate you with 10 times the product's cost.
Delivery and Shipping
Delivery and Shipping
Products are generally ready for dispatch within 1 day and typically reach you in 3 to 5 days.
Author: Ralph P. Grimaldi
Brand: PEARSON EDUCATION
Edition: Fifth
Features:
- Comprehensive Coverage: This book provides an in-depth exploration of compiler design principles and practices.
- Practical Approach: It combines theoretical concepts with real-world examples and practical applications.
- Structured Content: The content is organised into clear sections, covering topics like lexical analysis, syntax analysis, code generation, and optimisation.
- Suitable for Students: Ideal for undergraduate and postgraduate students studying compiler design.
- Valuable Resource: A valuable resource for professionals and researchers working in the field of compilers and programming languages.
Binding: Paperback
Number Of Pages: 1008
Release Date: 31-12-2014
model number: 9789353433055
Part Number: 9789353433055
Details: 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.
EAN: 9789353433055
Package Dimensions: 10.0 x 8.0 x 2.6 inches
Languages: English

