Norman Biggs Discrete Mathematics Oxford University Press -2002- Pdf _top_ May 2026
The second edition of Norman L. Biggs' "Discrete Mathematics," published by Oxford University Press in 2002, is a foundational textbook covering logic, combinatorics, graph theory, and abstract algebra for undergraduates. This 440-page edition, featuring over 1,000 exercises, added new material on mathematical reasoning and algorithm structure to better align with computer science curriculum needs. For more details, visit Oxford University Press . Discrete Mathematics - Norman Biggs - Google Books
: Covers fundamental concepts including statements and proofs, set notation, the logical framework, natural numbers, functions, and prime numbers. Techniques The second edition of Norman L
New Content
: This edition added specific chapters on statements and proof, logical framework, and natural numbers. Functions and Relations: Injections
"Discrete Mathematics" by Norman Biggs is a comprehensive textbook that covers the fundamental concepts of discrete mathematics. The book provides a clear and concise introduction to the subject, including topics such as: and equivalence relations. Logic: Propositional logic
- Networks and Algorithms: Shortest paths (Dijkstra), minimal spanning trees (Prim/Kruskal).
- Coding Theory: Error-detecting and error-correcting codes.
- Latin Squares and Finite Geometries: A taste of design theory.
Functions and Relations:
Injections, surjections, and equivalence relations. Logic: Propositional logic, truth tables, and quantifiers. 2. Number Theory and Algebra
Techniques:
Mathematical induction, counting (combinatorics), and recursion.
- A.1 Sets and Functions
- A.2 Relations and Partitions
- A.3 Groups
- A.4 Graphs