Discrete Mathematics for Computing
eBook - PDF

Discrete Mathematics for Computing

  1. 328 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Discrete Mathematics for Computing

About this book

Discrete Mathematics for Computing presents the essential mathematics needed for the study of computing and information systems. The subject is covered in a gentle and informal style, but without compromising the need for correct methodology. It is perfect for students with a limited background in mathematics. This new edition includes:
- An expanded section on encryption
- Additional examples of the ways in which theory can be applied to problems in computing
- Many more exercises covering a range of levels, from the basic to the more advanced This book is ideal for students taking a one-semester introductory course in discrete mathematics - particularly for first year undergraduates studying Computing and Information Systems. PETER GROSSMAN has worked in both academic and industrial roles as a mathematician and computing professional. As a lecturer in mathematics, he was responsible for coordinating and developing mathematics courses for Computing students. He has also applied his skills in areas as diverse as calculator design, irrigation systems and underground mine layouts. He lives and works in Melbourne, Australia.

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 Computing by Peter Grossman in PDF and/or ePUB format, as well as other popular books in Computer Science & Data Processing. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Cover
  2. Title
  3. Copyright
  4. Contents
  5. List of symbols
  6. Preface
  7. Chapter 1 Introduction to algorithms
  8. Chapter 2 Bases and number representation
  9. Chapter 3 Computer representation and arithmetic
  10. Chapter 4 Logic
  11. Chapter 5 Sets and relations
  12. Chapter 6 Functions
  13. Chapter 7 Induction and recursion
  14. Chapter 8 Boolean algebra and digital circuits
  15. Chapter 9 Combinatorics
  16. Chapter 10 Introduction to graph theory
  17. Chapter 11 Trees
  18. Chapter 12 Number theory
  19. Chapter 13 Algorithms and computational complexity
  20. Answers to exercises
  21. Index