000			03299cam a2200277 a 4500
008			090603s2002 enka 001 0 eng
010			_a2002029063
020			_a9780198507178
020			_a9780198507185
035			_a(Sirsi) u1670
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a004.0151 _2 21
100	1		_aBiggs, Norman. _9376
245	1	0	_aDiscrete mathematics / _c Norman L. Biggs.
250			_a2nd ed.
260			_aOxford [England] ; _a New York : _b Oxford University Press, _c 2002.
300			_axiv, 425 p. : _b ill. ; _c 26 cm.
500			_aIncludes index.
505	0		_aNumbers And Counting -- Integers -- Functions and counting -- Principles of counting -- Subsets and designs -- Partition, classification, and distribution -- Modular arithmetic -- Graphs And Algorithms -- Algorithms and their efficiency -- Graphs -- Trees, sorting, and searching -- Bipartite graphs and matching problems -- Digraphs, networks, and flows -- Recursive techniques -- 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
520			_aDiscrete mathematics is a compulsory subject for undergraduate computer scientists. This new edition includes new chapters on statements and proof, logical framework, natural numbers and the integers and updated exercises from the previous edition.Biggs' Discrete Mathematics has been a best-selling textbook since the first and revised editions were published in 1986 and 1990, respectively. This second edition has been developed in response to undergraduate course changes and changes in students' needs. New to this edition are chapters on statements and proof, logical framework, and natural numbers and the integers, in addition to updated chapters from the previous edition. The new chapters are presented at a level suitable for mathematics and computer science students seeking a first approach to this broad and highly relevant topic. Each chapter contains newly developed tailored exercises, and miscellaneous exercises are presented throughout, providing the student with over 1000 individual tailored exercises. This edition is accompanied by a website www.oup.com/mathematics/discretemath containing hints and solutions to all exercises presented in the text, providing an invaluable resource for students and lecturers alike. The book is carefully structured, coherent and comprehensive, and is the ideal text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory, coding theory and abstract algebra.The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, logical framework, natural numbers, and the integers, in addition to updated chapters from the previous edition
650		0	_aComputer science _x Mathematics. _92290
596			_a1
999			_c734 _d734