Connecting Discrete Mathematics and Computer Science
2nd Edition
Published on 14. December 2022
978-1-009-17474-9 (ISBN)
Description
Computer science majors taking a non-programming-based course like discrete mathematics might ask 'Why do I need to learn this?' Written with these students in mind, this text introduces the mathematical foundations of computer science by providing a comprehensive treatment of standard technical topics while simultaneously illustrating some of the broad-ranging applications of that material throughout the field. Chapters on core topics from discrete structures - like logic, proofs, number theory, counting, probability, graphs - are augmented with around 60 'computer science connections' pages introducing their applications: for example, game trees (logic), triangulation of scenes in computer graphics (induction), the Enigma machine (counting), algorithmic bias (relations), differential privacy (probability), and paired kidney transplants (graphs). Pedagogical features include 'Why You Might Care' sections, quick-reference chapter guides and key terms and results summaries, problem-solving and writing tips, 'Taking it Further' asides with more technical details, and around 1700 exercises, 435 worked examples, and 480 figures.
Reviews / Votes
'Finally! I've spent years struggling to find a textbook that makes the topic of Discrete Structures relevant to Computer Science students, David Liben-Nowell has put forth a book that will make CS students invested in the material. He not only connects every topic to Computer Science but does so in a clear and entertaining way.' Dan Arena, Vanderbilt University 'Unlike most discrete math texts, here the computer science content and connections are woven extensively throughout, with "forward pointers" that can excite students about numerous computer science areas they will encounter in their future studies. In addition, the book is written TO students, not FOR faculty. It will be a joy to teach with!' Valerie Barr, Mount Holyoke College 'By foregrounding the connections between the fields, this outstanding textbook makes a compelling case for why computer science students should embrace the study of discrete mathematics. This is an approachable yet rigorous book, written with wit and verve, that I look forward to teaching from!' Raghuram Ramanujan, Davidson College 'David Liben-Nowell's Connecting Discrete Mathematics and Computer Science provides students with a beautifully motivated, clearly written, and accessible exploration of the mathematical foundations of computer science. The "Computer Science Connections" sections provide compelling applications of the mathematical content and the frequent "Taking in further" notes provide extra richness that add to the joy of the experience. This is a discrete math book that truly keeps the reader engaged!' Ran Libeskind-Hadas, Founding Chair of Integrated Sciences, Claremont McKenna College 'An inspired approach to the introductory discrete math course, illuminating the aesthetic appeal of the subject together with the profound and inextricable links that connect it to the core ideas of computing.' Jon Kleinberg, Cornell University 'The book is well-written and up-to-date.' Trung Nguyen, Winona State UniversityMore details
Edition
2nd Revised edition
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
Edition type
Revised edition
Illustrations
Worked examples or Exercises
File size
12,02 MB
ISBN-13
978-1-009-17474-9 (9781009174749)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
David Liben-Nowell
Connecting Discrete Mathematics and Computer Science
Book
08/2022
2nd Edition
Cambridge University Press
€74.50
Available immediately
Person
Content
1. On the point of this book; 2. Basic data types; 3. Logic; 4. Proofs; 5. Mathematical induction; 6. Analysis of algorithms; 7. Number theory; 8. Relations; 9. Counting; 10. Probability; 11. Graphs and trees; 12. Looking forward.
