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: Lecture Notes in Discrete MathematicsLecture Notes in Discrete Mathematics
by - Arkansas Tech University
This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in computer science, engineering, Business, and the sciences.
(13216 views)
Book cover: Applied Finite MathematicsApplied Finite Mathematics
by - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
(9748 views)
Book cover: Discrete Math for Computer Science StudentsDiscrete Math for Computer Science Students
by - 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.
(5884 views)
Book cover: Discrete StructuresDiscrete Structures
by - 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.
(8990 views)