Bloomsbury Home
- Home
- ACADEMIC
- Computer & Information Science
- Discrete Mathematics for Computing
Inspection copy added to basket
This title is available for inspection copy requests
Choose your preferred format. EU customers: we regret we cannot currently supply print inspection copies via the website but ebooks are available.
Please note ebook inspection copies are fulfilled by VitalSource™.
Buy from Bloomsbury eTextBooks
You are now leaving the Bloomsbury Publishing website. Your eBook purchase will be with our partner https://www.vitalsource.com.
Your credit card statement will show this purchase originating from VitalSource Technologies. They will also provide any technical assistance you might require.
You must sign in to add this item to your wishlist. Please sign in or create an account
Description
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.
Table of Contents
Introduction to Algorithms
Bases and Number Representation
Computer Representation and Arithmetic
Logic
Sets and Relations
Functions
Induction and Recursion
Boolean Algebra and Digital Circuits
Combinatorics
Introduction to Graph Theory
Trees
Number Theory
Algorithms and Computational Complexity.
Product details
Published | 16 Sep 2017 |
---|---|
Format | Ebook (PDF) |
Edition | 3rd |
Extent | 328 |
ISBN | 9780230374058 |
Imprint | Red Globe Press |
Publisher | Bloomsbury Publishing |