Logo

Discrete Mathematics with Algorithms

Large book cover: Discrete Mathematics with Algorithms

Discrete Mathematics with Algorithms
by

Publisher: J. Wiley
ISBN/ASIN: 0471849022
ISBN-13: 9780471849025
Number of pages: 560

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.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Discrete Mathematics: An Open IntroductionDiscrete Mathematics: An Open Introduction
by - University of Northern Colorado
This book was written to be used as the primary text for introduction to proof, as well as an introduction to topics in discrete mathematics. Contents: Counting; Sequences; Symbolic Logic and Proofs; Graph Theory; Generating Functions; and more.
(2446 views)
Book cover: Discrete MathematicsDiscrete Mathematics
by - Macquarie University
Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.
(21768 views)
Book cover: Discrete Mathematics for Computer ScienceDiscrete Mathematics for Computer Science
by - arXiv
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.
(9288 views)
Book cover: Mathematics for Algorithm and Systems AnalysisMathematics for Algorithm and Systems Analysis
by - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(21608 views)