Discrete Mathematics for Computer Science
eBook - ePub

Discrete Mathematics for Computer Science

An Example-Based Introduction

  1. 260 pages
  2. English
  3. ePUB (mobile friendly)
  4. Available on iOS & Android
eBook - ePub

Discrete Mathematics for Computer Science

An Example-Based Introduction

About this book

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees.

Features



  • Designed to be especially useful for courses at the community-college level


  • Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics


  • Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking


  • Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers


  • Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode


  • Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers

Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Discrete Mathematics for Computer Science by Jon Pierre Fortney in PDF and/or ePUB format, as well as other popular books in Mathematics & Computer Science General. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Cover
  2. Half Title
  3. Title Page
  4. Copyright Page
  5. Contents
  6. Preface
  7. CHAPTER 1 â–ª Introduction to Algorithms
  8. CHAPTER 2 â–ª Number Representations
  9. CHAPTER 3 â–ª Logic
  10. CHAPTER 4 â–ª Set Theory
  11. CHAPTER 5 â–ª Boolean Algebra
  12. CHAPTER 6 â–ª Functions
  13. CHAPTER 7 â–ª Counting and Combinatorics
  14. CHAPTER 8 â–ª Algorithmic Complexity
  15. CHAPTER 9 â–ª Graph Theory
  16. CHAPTER 10 â–ª Trees
  17. APPENDIX A â–ª Basic Circuit Design
  18. APPENDIX B â–ª Graph Theory
  19. Index