Here is a first-year course in discrete mathematics, requiring no calculus or computer programming experience, for students on computer science and mathematics courses. The approach stresses finding efficient algorithms, rather than existential results. It provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem solving. All algorithms are presented in English, in a format compatible with the PASCAL programming language. The text contains many exercises, with ...

Discrete Mathematics with Algorithms 1988, Wiley, New York, NY

ISBN-13: 9780471849025


Discrete Mathematics with Algorithms 1988, John Wiley and Sons (WIE), New York

ISBN-13: 9780471612780