• 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
• eBook PDF files
• Language: English
• ISBN-10/ASIN: 0471849022
• ISBN-13: 978-0471849025
• Share This:  

Book Description

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).

• N/A

• Amazon

• Discrete and Finite Mathematics
• Algorithms and Data Structures
• Computer Programming
• Introduction to Computer Science
• Functional Programming
• Computer and Programming Languages

• Discrete Mathematics with Algorithms (M. O. Albertson et al)

• A Spiral Workbook for Discrete Mathematics (Harris Kwong)
• Discrete Mathematics for Computer Science (Jean Gallier)
• Exploring Discrete Mathematics With Maple (Kenneth H. Rosen)
• Applied Discrete Structures (Ken Levasseur, et al)