MARC details
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
090603s2002 enka 001 0 eng |
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
LC control number |
2002029063 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780198507178 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780198507185 |
035 ## - SYSTEM CONTROL NUMBER |
System control number |
(Sirsi) u1670 |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
EG-CaNU |
Transcribing agency |
EG-CaNU |
Modifying agency |
EG-CaNU |
042 ## - AUTHENTICATION CODE |
Authentication code |
ncode |
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
004.0151 |
Edition number |
21 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Biggs, Norman. |
9 (RLIN) |
376 |
245 10 - TITLE STATEMENT |
Title |
Discrete mathematics / |
Statement of responsibility, etc. |
Norman L. Biggs. |
250 ## - EDITION STATEMENT |
Edition statement |
2nd ed. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Place of publication, distribution, etc. |
Oxford [England] ; |
-- |
New York : |
Name of publisher, distributor, etc. |
Oxford University Press, |
Date of publication, distribution, etc. |
2002. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xiv, 425 p. : |
Other physical details |
ill. ; |
Dimensions |
26 cm. |
500 ## - GENERAL NOTE |
General note |
Includes index. |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
Numbers 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 ## - SUMMARY, ETC. |
Summary, etc. |
Discrete 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 |
596 ## - |
-- |
1 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Computer science |
General subdivision |
Mathematics. |
9 (RLIN) |
2290 |