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