Poised Solutions Tech Library

Discrete Mathematics for Computing

Discrete Mathematics for Computing Author: John E Munro Publisher: Chapman and Hall Published: 1992 Pages: 306

Discrete Mathematics for Computing

Discrete Mathematics for Computing Chapters

Discrete Mathematics for Computing Chapters

1. Algorithms for Integers
   • Integer Division
   • Primes
   • Greatest Common Divisor
   • Exercises
2. Numbers in Different Bases; Real Numbers
   • Integers in Different Bases
   • Real Numbers
   • Exercises
3. Sets Functions and Relations
   • Sets
   • Function
   • Relations
   • Sequences
   • Exercises
4. Logic
   • Compound Propositions and Truth Tables
   • Reasoning From Logical Assumptions
   • Predicates and Quantifiers
   • Exercises
5. Proof
   • Patterns of Proof
   • Mathematical Induction
   • Induction and Well Ordering
   • Exercises
6. Recursion
   • Recursive Thinking
   • Recursion and Lists
   • Recursion and Sequences
   • Exercises
7. Analysis of Algorithms
   • Slow Algorithms
   • Comparing Algorithms
   • Applications
   • Exercises
8. Graphs and Trees
   • Graphs
   • Trees
   • Spanning Trees
   • Exercises
9. Counting
   • Techniques of Counting
   • Combinatorial Reasoning
   • The Binomial and Multinomial Theorems
   • Algorithms
   • Exercises
10. Algebraic Structures
    • Algebras
    • Ordered Structures
    • Finite Fields
    • Exercises
11. Reasoning and Correctness
    • Natural Deduction
    • Correctness of Algorithms
    • Exercises

Discrete Mathematics for Computing Appendices

1. Writing Algorithms
2. Answers to Exercises
3. Bibliography
4. index