It balances combinatorial methods with algebraic structures and graph theory.
: Updated chapters from the previous edition include descriptions of algorithms that resemble real programming languages for easier implementation.
Additional chapters on statements and proof, the logical framework, natural numbers, and integers. Google Books Core Themes & Contents
The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, Amazon.com Discrete Mathematics, 2nd Edition: Biggs, Norman L. Google Books Core Themes & Contents The long-awaited
Q: What is the publisher of the book? A: The publisher of the book is Oxford University Press.
Many university libraries provide institutional, chapter-by-chapter PDF downloads through official Oxford University Press portals.
The 2002 release introduced several critical enhancements to the foundational text: networks and flows 19.
Availability and access options (legal and recommended)
Oxford University Press hosts official online solutions and lecturer guides that supplement the physical and digital copies of the textbook. Final Verdict
Sophisticated counting methods for overlapping sets. 4. Graph Theory Trees and Cycles: Basic definitions and properties. classification and distribution 13.
| Part | Title | Chapters Covered | | :--- | :--- | :--- | | | The Language of Mathematics | 1. Statements and proofs 2. Set notation 3. The logical framework 4. Natural numbers 5. Functions 6. How to count 7. Integers 8. Divisibility and prime numbers 9. Fractions and real numbers | | II | Techniques | 10. Principles of counting 11. Subsets and designs 12. Partition, classification and distribution 13. Modular arithmetic | | III | Algorithms and Graphs | 14. Algorithms and their efficiency 15. Graphs 16. Trees, sorting and searching 17. Bipartite graphs and matching problems 18. Digraphs, networks and flows 19. Recursive techniques | | IV | Algebraic Methods | 20. Groups 21. Groups of permutations 22. Rings, fields and polynomials 23. Finite fields and some applications 24. Error-correcting codes 25. Generating functions 26. Partitions of a positive integer 27. Symmetry and counting |
The book doesn’t just teach you how to solve a problem; it teaches you why the problem exists in a mathematical context. It bridges the gap between pure mathematics and the practical needs of a computer scientist.
Discrete Mathematics by Norman Biggs is a copyrighted publication of Oxford University Press [1]. Unauthorized PDF distribution violates intellectual property laws.
