Discrete Mathematics for Computing (Paperback)
  • Discrete Mathematics for Computing (Paperback)
zoom

Discrete Mathematics for Computing (Paperback)

(author)
£59.99
Paperback 328 Pages
Published: 16/12/2008
Free UK delivery on orders over £25
  • In stock

Usually dispatched within 1-2 days

Free UK delivery on orders over £25
  • This item has been added to your basket


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.

Publisher: Bloomsbury Publishing PLC
ISBN: 9780230216112
Number of pages: 328
Weight: 650 g
Dimensions: 246 x 189 mm
Edition: 3rd ed. 2008

You may also be interested in...

Probability Models
Added to basket
Paperback
£29.99
Concise Computer Mathematics
Added to basket
All of Statistics
Added to basket
Data Analysis with Open Source Tools
Added to basket
Post-Quantum Cryptography
Added to basket
MATLAB Demystified
Added to basket
Paperback
£26.99

Please sign in to write a review

Your review has been submitted successfully.