Discrete Mathematics with Algorithms
by M. O. Albertson, J. P. Hutchinson
Publisher: J. Wiley 1988
ISBN/ASIN: 0471849022
ISBN-13: 9780471849025
Number of pages: 550
Description:
This first-year course in discrete mathematics requires 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.
Download or read it online for free here:
Download link
(14MB, PDF)
Similar books
Exploring Discrete Mathematics Using Mapleby Kenneth H. Rosen - Mcgraw-Hill College
This is a guide to help you explore concepts in discrete mathematics using the computer system Maple. It is designed to be accessible to those who are complete novices with Maple and with computer programming, but it has much to offer even experts.
(9049 views)
Discrete Math for Computer Science Studentsby Ken Bogart, Cliff Stein - Dartmouth College
It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
(9852 views)
A Spiral Workbook for Discrete Mathematicsby Harris Kwong - Open SUNY Textbooks
This textbook covers the standard topics in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics. It explains and clarifies the unwritten conventions in mathematics.
(7276 views)
Discrete Structuresby Vladlen Koltun - Stanford University
Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.
(12202 views)