Discrete Mathematics
Johnsonbaugh, Richard
Discrete Mathematics by Richard Johnsonbaugh - 5th ed. - London Prentice Hall 2001 - 766p.
Contents:
Logic and proofs
The language of mathematics
Algorithms
Counting methods and the pigeonhole principle
Recurrence relations
Graph theory
Trees
Network models
Boolean algebras and combinatorial circuits
Automata, grammars, and languages
Computational geometry
An accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques. This edition has woven techniques of proofs into the text as a running theme. Each chapter has a problem-solving corner that shows students how to attack and solve problems.
9780131593183
Mathematics
Combinatorial analysis
510 / J719D
Discrete Mathematics by Richard Johnsonbaugh - 5th ed. - London Prentice Hall 2001 - 766p.
Contents:
Logic and proofs
The language of mathematics
Algorithms
Counting methods and the pigeonhole principle
Recurrence relations
Graph theory
Trees
Network models
Boolean algebras and combinatorial circuits
Automata, grammars, and languages
Computational geometry
An accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques. This edition has woven techniques of proofs into the text as a running theme. Each chapter has a problem-solving corner that shows students how to attack and solve problems.
9780131593183
Mathematics
Combinatorial analysis
510 / J719D