Connecting Discrete Mathematics and Computer Science
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Connecting Discrete Mathematics and Computer Science
Connecting Discrete Mathematics and Computer Science

Connecting Discrete Mathematics and Computer Science


     0     
5
4
3
2
1



International Edition


X
About the Book

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.

Table of Contents:
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.

About the Author :
David Liben-Nowell is Professor of Computer Science at Carleton College, and earned degrees from Cornell, Cambridge, and MIT. His research focuses on computational social science, especially social networks. He teaches broadly, emphasizing introductory and theoretical computer science, and created and led a study-abroad program in England (History of Computing). He is on the ACM 202x curriculum subcommittee for what was previously called 'discrete structures', and is a member of the Liberal Arts CS (LACS) consortium. His awards and honors include NSF research funding, Kavli Fellow of the National Academy of Sciences, and Visiting By-Fellowship at Churchill College (at Cambridge). He has also published about 30+ crossword puzzles in the New York Times, Los Angeles Times, Wall Street Journal, Chronicle of Higher Education, and other outlets.

Review :
'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


Best Sellers


Product Details
  • ISBN-13: 9781009150491
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Edition: Revised edition
  • Language: English
  • Returnable: N
  • Returnable: N
  • Weight: 1770 gr
  • ISBN-10: 1009150499
  • Publisher Date: 04 Aug 2022
  • Binding: Hardback
  • Height: 260 mm
  • No of Pages: 690
  • Returnable: N
  • Spine Width: 38 mm
  • Width: 202 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Connecting Discrete Mathematics and Computer Science
Cambridge University Press -
Connecting Discrete Mathematics and Computer Science
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Connecting Discrete Mathematics and Computer Science

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!