
- 328 pages
- English
- PDF
- Available on iOS & Android
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
- 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.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Title
- Copyright
- Contents
- List of symbols
- Preface
- Chapter 1 Introduction to algorithms
- Chapter 2 Bases and number representation
- Chapter 3 Computer representation and arithmetic
- Chapter 4 Logic
- Chapter 5 Sets and relations
- Chapter 6 Functions
- Chapter 7 Induction and recursion
- Chapter 8 Boolean algebra and digital circuits
- Chapter 9 Combinatorics
- Chapter 10 Introduction to graph theory
- Chapter 11 Trees
- Chapter 12 Number theory
- Chapter 13 Algorithms and computational complexity
- Answers to exercises
- Index