An edition of Discrete Maths for Computing (2002)

Discrete Maths for Computing

1st edition
  • 6 Want to read
Locate

My Reading Lists:

Create a new list

  • 6 Want to read

Buy this book

Last edited by ImportBot
July 31, 2020 | History
An edition of Discrete Maths for Computing (2002)

Discrete Maths for Computing

1st edition
  • 6 Want to read

This work doesn't have a description yet. Can you add one?

Publish Date
Language
English
Pages
304

Buy this book

Edition Availability
Cover of: Discrete Maths for Computing
Discrete Maths for Computing
January 15, 2002, Addison Wesley, Addison-Wesley
Paperback in English - 1st edition

Add another edition?

Book Details


Table of Contents

Preface
Page viii
List of symbols
Page x
1. Introduction
Page 1
1.1. Modelling
Page 1
1.2. Pseudocode
Page 5
Exercise set 1
Page 9
Chapter summary
Page 12
2. Logic and proof
Page 14
2.1. Propositions and logic
Page 14
2.2. Predicates and quantifiers
Page 19
2.3. Methods of proof
Page 21
2.4. Mathematical induction
Page 23
Exercise set 2
Page 26
Chapter summary
Page 28
Application: Correctness of algorithms
Page 29
3. Set theory
Page 34
3.1. Sets and set operations
Page 34
3.2. The algebra of sets
Page 40
3.3. Further properties of sets
Page 42
Exercise set 3
Page 47
Chapter summary
Page 49
Application: Knowledge-based systems
Page 51
4. Relations
Page 56
4.1. Binary relations
Page 56
4.2. Properties of relations
Page 61
4.3. Equivalence relations and partial orders
Page 64
Exercise set 4
Page 68
Chapter summary
Page 70
Application: Database management systems
Page 71
5. Functions
Page 77
5.1. Inverse relations and composition of relations
Page 77
5.2. Functions
Page 82
5.3. Inverse functions and composition of functions
Page 87
5.4. The pigeonhole principle
Page 90
Exercise set 5
Page 93
Chapter summary
Page 96
Application: Functional programming languages
Page 97
6. Combinatorics
Page 101
6.1. The addition and multiplication principles
Page 101
6.2. Counting formulae
Page 103
6.3. The binomial expansion
Page 109
Exercise set 6
Page 113
Chapter summary
Page 115
Application: Efficiency of algorithms
Page 116
7. Graphs
Page 121
7.1. Graphs and terminology
Page 121
7.2. Hamiltonian graphs
Page 127
7.3. Trees
Page 131
Exercise set 7
Page 137
Chapter summary
Page 141
Application: Sorting and searching
Page 143
8. Directed graphs
Page 149
8.1. Directed graphs
Page 149
8.2. Paths in digraphs
Page 153
8.3. Shortest paths
Page 157
Exercise set 8
Page 161
Chapter summary
Page 164
Application: Communications networks
Page 165
9. Boolean algebra
Page 170
9.1. Boolean algebra
Page 170
9.2. Karnaugh maps
Page 175
9.3. Logic circuits
Page 179
Exercise set 9
Page 182
Chapter summary
Page 185
Application: Designing a 2-bit adder
Page 186
Solutions
Page 191
Further reading
Page 232
Index
Page 233

Classifications

Library of Congress
QA76.9.M35H34 2002, QA76.9.M35 H34 2002

The Physical Object

Format
Paperback
Number of pages
304
Dimensions
9.1 x 6.7 x 0.6 inches
Weight
14.9 ounces

Edition Identifiers

Open Library
OL10169091M
ISBN 10
0201730472
ISBN 13
9780201730470
LCCN
2001032889
LibraryThing
4108518
Goodreads
28790

Work Identifiers

Work ID
OL4776268W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON
July 31, 2020 Edited by ImportBot import existing book
July 1, 2019 Edited by MARC Bot import existing book
April 28, 2010 Edited by Open Library Bot Linked existing covers to the work.
December 10, 2009 Created by WorkBot add works page