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 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.
(13241 views)
Book cover: generatingfunctionologygeneratingfunctionology
by - A K Peters, Ltd.
The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.
(18924 views)
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.
(14665 views)
Book cover: Lists, Decisions, and GraphsLists, Decisions, and Graphs
by - University of California, San Diego
In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.
(5398 views)