Discrete Mathematics for Computer Science
Home > Mathematics and Science Textbooks > Mathematics > Discrete mathematics > Discrete Mathematics for Computer Science
Discrete Mathematics for Computer Science

Discrete Mathematics for Computer Science


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Written exclusively with computer science students in mind, Discrete Mathematics for Computer Science provides a comprehensive treatment of standard course topics for the introductory discrete mathematics course with a strong emphasis on the relationship between the concepts and their application to computer science. The book has been crafted to enhance teaching and learning ease and includes a wide selection of exercises, detailed exploration problems, examples and problems inspired by wide-ranging applications of computer science and handy quick reference guides for key technical topics throughout. Discrete Mathematics for Computer Science  provides a lucidly written introduction to discrete mathematics with abundant support for learning, including over 450 examples, thorough chapter summaries, simple quizzes, and approximately 1600 homework exercises of widely varying difficulty. Each chapter  begins with motivational content that relates the chapter topic to computer science practice and the book also includes over fifty "Computer Science Connections" which discuss applications to computer science such as Rotation Matrices; Game Trees, Logic, and Winning Tic-Tac(-Toe); Moore's Law; Secret Sharing; The Enigma Machine and the First Computer; Bayesian Modeling and Spam Filtering; and Quantum Computing.

Table of Contents:
1 On the Point of this Book 101 2 Basic Data Types 201 2.1 Why You Might Care 202 2.2 Booleans, Numbers, and Arithmetic 203 2.3 Sets: Unordered Collections 222 2.4 Sequences, Vectors, and Matrices: Ordered Collections 237 2.5 Functions 253 2.6 Chapter at a Glance 270 3 Logic 301 3.1 Why You Might Care 302 3.2 An Introduction to Propositional Logic 303 3.3 Propositional Logic: Some Extensions 317 3.4 An Introduction to Predicate Logic 331 3.5 Predicate Logic: Nested Quantifiers 349 3.6 Chapter at a Glance 362 4 Proofs 401 4.1 Why You Might Care 402 4.2 Error-Correcting Codes 403 4.3 Proofs and Proof Techniques 423 4.4 Some Examples of Proofs 441 4.5 Common Errors in Proofs 458 4.6 Chapter at a Glance 469 5 Mathematical Induction 501 5.1 Why You Might Care 502 5.2 Proofs by Mathematical Induction 503 5.3 Strong Induction 521 5.4 Recursively Defined Structures and Structural Induction 533 5.5 Chapter at a Glance 546 6 Analysis of Algorithms 601 6.1 Why You Might Care 602 6.2 Asymptotics 603 6.3 Asymptotic Analysis of Algorithms 617 6.4 Recurrence Relations: Analyzing Recursive Algorithms 631 6.5 Recurrence Relations: The Master Method 647 6.6 Chapter at a Glance 657 7 Number Theory 701 7.1 Why You Might Care 702 7.2 Modular Arithmetic 703 7.3 Primality and Relative Primality 717 7.4 Multiplicative Inverses 734 7.5 Cryptography 745 7.6 Chapter at a Glance 756 8 Relations 801 8.1 Why You Might Care 802 8.2 Formal Introduction 803 8.3 Properties of Relations: Reflexivity, Symmetry, and Transitivity 818 8.4 Special Relations: Equivalence Relations and Partial/Total Orders 833 8.5 Chapter at a Glance 850 9 Counting 901 9.1 Why You Might Care 902 9.2 Counting Unions and Sequences 903 9.3 Using Functions to Count 926 9.4 Combinations and Permutations 944 9.5 Chapter at a Glance 965 10 Probability 1001 10.1 Why You Might Care 1002 10.2 Probability, Outcomes, and Events 1005 10.3 Independence and Conditional Probability 1021 10.4 Random Variables and Expectation 1041 10.5 Chapter at a Glance 1067 11 Graphs and Trees 1101 11.1 Why You Might Care 1102 11.2 Formal Introduction 1103 11.3 Paths, Connectivity, and Distances 1129 11.4 Trees 1147 11.5 Weighted Graphs 1164 11.6 Chapter at a Glance 1177 12 Index 1201

About the Author :
David Liben-Nowell (PhD from MIT) is a Professor and Chair of Computer Science at Carleton College.  His research interests are focused on computational social sciences, particularly the structure and evolution of social networks and computational modeling of spoken-word recognition.


Best Sellers


Product Details
  • ISBN-13: 9781119397199
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: Standards Information Network
  • Language: English
  • ISBN-10: 1119397197
  • Publisher Date: 19 Oct 2017
  • Binding: Digital (delivered electronically)
  • No of Pages: 688


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Discrete Mathematics for Computer Science
John Wiley & Sons Inc -
Discrete Mathematics for 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.

Discrete Mathematics for 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

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!