Discrete Mathematics
2nd Edition
Published in August 1989
Book
Hardback
494 pages
978-0-19-853426-6 (ISBN)
Description
Using a traditional deductive approach, this book looks into the fundamental ideas in discrete mathematics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization and abstract algebra. It can be approached by anyone with basic competence in arithmetic and experience of simple algebraic manipulations and students of computer science whose curriculum may now allow the study of many ancillary mathematics courses. The main changes to this new edition are to present descriptions of numerous algorithms on a form close to that of a real programming language. The aim is to enable students to develop practical programs from the design of algorithms.
More details
Edition
2nd Revised edition
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Oxford University Press
Target group
College/higher education
Edition type
Revised edition
Illustrations
120 line drawings, index
Dimensions
Height: 230 mm
Width: 150 mm
Weight
711 gr
ISBN-13
978-0-19-853426-6 (9780198534266)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Person
Content
Part 1 Numbers and counting: integers; functions and counting; principles of counting; subsets and designs; partition, classification and distribution; modular arithmetic. Part 2 Graphs and algorithms: algorithms and their efficiency; graphs; trees, sorting and searching; bipartite graphs and matching problems; digraphs, networks and flows; recursive techniques. Part 3 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.