Publisher's Synopsis
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 answers at the back of the book (detailed solutions being supplied for difficult problems).
