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.

List of symbols
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

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 of mathematics courses for Computer Science students. He is based in Australia and currently works in industry, in the areas of mathematical modelling and software development.