This is a first-year course in discrete mathematics requireing no calculus or computer programming experience.
The approach stresses finding efficient algorithms, rather than existential results. 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. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).
The approach stresses finding efficient algorithms, rather than existential results. 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. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).
Title Discrete Mathematics with Algorithms
Author(s) M. O. Albertson and J. P. Hutchinson
Publisher: John Wiley & Sons; 1st Updated edition (July 22, 1988)
Hardcover 560 pages
Language: English
ISBN-10/ASIN: 0471849022
ISBN-13: 978-0471849025
eBook: http://www.macalester.edu/~hutchinson/book/book.html
Author(s) M. O. Albertson and J. P. Hutchinson
Publisher: John Wiley & Sons; 1st Updated edition (July 22, 1988)
Hardcover 560 pages
Language: English
ISBN-10/ASIN: 0471849022
ISBN-13: 978-0471849025
eBook: http://www.macalester.edu/~hutchinson/book/book.html
No comments:
Post a Comment