Discrete mathematics for computing

Peter Grossman0333981111, 9780333981115, 9781403907349

Written with a clear and informal style “Discrete Mathematics for Computing” is aimed at first-year undergraduate computing students with very little mathematical background. It is a low-level introductory text which takes the topics at a gentle pace, covering all the essential material that forms the background for studies in computing and information systems. This edition includes new sections on proof methods and recurrences, and the examples have been updated throughout to reflect the changes in computing since the first edition.

---

Table of contents :
Cover……Page 1
Title……Page 2
Copyright……Page 3
Contents……Page 4
List of symbols……Page 8
Preface……Page 12
1 Introduction to algorithms……Page 16
2 Bases and number representation……Page 29
3 Computer representation and arithmetic……Page 43
4 Logic……Page 59
5 Sets and relations……Page 87
6 Functions……Page 109
7 Induction and recursion……Page 125
8 Boolean algebra and digital circuits……Page 153
9 Combinatorics……Page 178
10 Introduction to graph theory……Page 189
11 Trees……Page 215
12 Number theory……Page 232
13 Algorithms and computational complexity……Page 257
Answers to exercises……Page 281
Index……Page 312