< Back


Discrete Mathematics for Computing

Discrete Mathematics for ComputingBy Rod Haggarty
Review by Josh (Computer Science)

Discrete Mathematics for Computing presents the essential mathematics needed for the study of computing. Most of the content is covered in a gentle and informal style, and each chapter is complemented by a lavish set of exercises to be completed by the reader (I know that was your favourite bit). All seriousness aside, this book is awesome! It drip-feeds you the basics of discrete maths, and will prove beneficial when you come to study computer science at degree level. This may sound very daunting, but the author assumes very little knowledge of maths (basically just your simple arithmetic)! So, it really is accessible for anyone to read.

This book will get you thinking about the utility of maths in computer science, and kicks off with an apt chapter which aims to teach you how computers handle numbers! It’s definitely not the way we handle them (and there might be a subtle hint on the cover of the book as to how they might). From then on, every chapter links to the other and it soon becomes an inexorable tumble into the field of discrete mathematics.

The content is very concise, which I preferred whilst reading it. It still remained friendly, and, even though it was relatively short, it still took a long while to read! It’s not the sort of book you can read in a day, and I certainly wouldn’t advise reading it in a week!

Penultimately, the book served well as an encouragement to extrapolate my interests and research further into some topics that arise – ones which I found particularly interesting (logic is cool)!

Discrete Mathematics for Computing by Rod Haggarty
ISBN-10: 0230216110
ISBN-13: 978-0230216112

Try checking the availability of this book at your school or local library or explore second hand bookshops and websites. You may also wish to purchase from either Amazon or Blackwell’s.

Explore Univ on social media

University College Oxford

Contact Univ

If you have any questions or need more information, just ask: