The widespread use of computers and the rapid growth in computer science have led to a new emphasis on discrete mathematics, a discipline which deals with calculations involving a finite number of steps. This book provides a well-structured introduction to discrete mathematics, taking a self-contained approach that requires no ancillary knowledge of mathematics, avoids unnecessary abstraction, and incorporates a wide rage of topics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization, and abstract algebra. Amply illustrated with examples and exercises.
Why buy from World of Books
Our excellent value books literally don't cost the earth
PART I: NUMBERS AND COUNTING: Integers; Functions and counting; Principles of counting; Subsets and designs; Partition, classification, and distribution; Modular arithmetic; PART II: GRAPHS AND ALGORITHMS: Algorithms and their efficiency; Graphs; Trees, sorting, and searching; Bipartite graphs and matching problems; Digraphs, networks, and flows; Recursive techniques; PART III: ALGEBRAIC METHODS: Groups; Groups of permutations; Rings, fields, and polynomials; Finite fields and some applications; Error-correcting codes; Generating functions; Partitions of a positive integer; Symmetry and counting; Answers to problems
Discrete Mathematics by Norman L. Biggs
Norman L. Biggs
Used - Very Good
Oxford University Press
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a used book - there is no escaping the fact it has been read by someone else and it will show signs of wear and previous use. Overall we expect it to be in very good condition, but if you are not entirely satisfied please get in touch with us.