Free Discrete Mathematics, 2nd Edition Ebooks Online
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. Carefully structured, coherent and comprehensive, each chapter contains tailored exercises and solutions to selected questions, and miscellaneous exercises are presented throughout. This is an invaluable text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory and abstract algebra.
Paperback: 440 pages
Publisher: Oxford University Press; 2nd edition (2002)
Language: English
ISBN-10: 0198507178
ISBN-13: 978-0198507178
Product Dimensions: 9.6 x 1 x 7.4 inches
Shipping Weight: 15.2 ounces (View shipping rates and policies)
Average Customer Review: 3.1 out of 5 stars See all reviews (7 customer reviews)
Best Sellers Rank: #363,221 in Books (See Top 100 in Books) #60 in Books > Computers & Technology > Computer Science > AI & Machine Learning > Machine Theory #128 in Books > Science & Math > Mathematics > Pure Mathematics > Discrete Mathematics #697 in Books > Textbooks > Humanities > Linguistics
This was the required text in a course I just took in discrete mathematics, and it is very lacking. The descriptions are not detailed enough for first-time learners of the material. Biggs tries to cover very many topics, and as such, doesn't cover any given topic thoroughly. The book feels like random snapshots of various components of discrete mathematics, but not all of the snapshots are representative of the topics to which they belong.For one group of chapters, Biggs discusses things which are only really relevant or applicable in computer science (or, at the very least, given a computer). This is to be expected - discrete mathematics and computer science go hand in hand. Unfortunately, though, it does not appear that he is a practicing computer scientist - he omits the names behind some of the famous algorithms, i.e. Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm. He ditches the minimum spanning tree problem and proceeds to DFS without discussing Kruskal's algorithm. He also performs heap sort with a min order heap, sorting elements in ascending order, which, as most computer science students should be able to recognize, requirs linear-order extra space in order to copy the final array (as opposed to using a max-order heap, which requires only constant space). He uses a seemingly FORTRAN-based pseudocode, but omits symbols, adds more English words (as if FORTRAN didn't have enough), and uses no comments.All in all, avoid this book if possible. For introductory-level discrete mathematics, I would recommend
Advanced Mathematics: Precalculus With Discrete Mathematics and Data Analysis Essentials Of Discrete Mathematics (The Jones & Bartlett Learning Inernational Series in Mathematics) Discrete Mathematics, 2nd Edition Discrete Mathematics and Functional Programming An Introduction to Cryptography (Discrete Mathematics and Its Applications) Fundamentals of Information Theory and Coding Design (Discrete Mathematics and Its Applications) A Practical Handbook of Speech Coders (Discrete Mathematics and Its Applications) RSA and Public-Key Cryptography (Discrete Mathematics and Its Applications) Essentials of Discrete Mathematics Teaching Student-Centered Mathematics: Developmentally Appropriate Instruction for Grades 3-5 (Volume II) (2nd Edition) (Teaching Student-Centered Mathematics Series) Teaching Student-Centered Mathematics: Developmentally Appropriate Instruction for Grades Pre-K-2 (Volume I) (2nd Edition) (Teaching Student-Centered Mathematics Series) Signals and Systems: Continuous and Discrete (4th Edition) Fortran Codes for Mathematical Programming: Linear, Quadratic and Discrete Applied Algebra: Codes, Ciphers, and Discrete Algorithms Using Discrete Choice Experiments to Value Health and Health Care (The Economics of Non-Market Goods and Resources) Discrete Structures, Logic, And Computability Ramsey Theory for Discrete Structures How to Bake Pi: An Edible Exploration of the Mathematics of Mathematics The Birth of Mathematics: Ancient Times to 1300 (Pioneers in Mathematics) Practical Problems in Mathematics for Heating and Cooling Technicians (Practical Problems In Mathematics Series)
