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: 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

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.
(19093 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.
(12490 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.
(10236 views)
Book cover: Topics in Discrete MathematicsTopics in Discrete Mathematics
by - Harvey Mudd College
This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.
(14206 views)