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
Lecture Notes in Discrete Mathematicsby Marcel B. Finan - 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.
(17734 views)
Discrete Mathematicsby W W L Chen - 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.
(31022 views)
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.
(10347 views)
Lists, Decisions, and Graphsby Edward A. Bender, S. Gill Williamson - 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.
(8907 views)