Ebook Info
- Published: 2011
- Number of pages: 256 pages
- Format: PDF
- File Size: 1.57 MB
- Authors: Edward A. Bender
Description
Discrete mathematics is fundamental to computer science, and interesting, challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, artificial intelligence, theoretical computer science, and elsewhere. This up-to-date text prepares undergraduates with four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Each unit is divided into four sections, and each section contains a selection of problems that vary in difficulty. Solutions to these problems are given at the end of the text.Multiple-choice questions for review appear at the end of each unit. The text offers students the mathematical language and sophistication to recognize and articulate the ideas behind these questions and to answer questions similar in concept and difficulty. Those who master the necessary ideas and mathematical language to understand these review questions gain the ability to formulate, in the neutral language of mathematics, the problems that arise in various applications of computer science–a skill that enables them to discuss problems in discrete mathematics with other computer scientists and with mathematicians.
User’s Reviews
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐Great book that covers the full range of the necessary mathematics for Computer Science and various Engineering disciplines. Being complimentary, it sits between my desktop bookends next to another great book, Concepts in Modern Mathematics. This book eschews monotonous discussion of abstract proofs for a more example based approach. The diagrams are very concise and directly illustrative of the concepts that are being discussed. No extraneous digression. Extremely good as a reference or a primer. Were I an instructor in programming, I would make this one of the several required reads. SADLY, still no Kindle version exists.Originally posted in Jan of 2013. — Edited in Oct 2017 to clean up the grammar and complain about continuing lack of Kindle version.
⭐There is an unfortunate division between computer science theory, and actual programming practice. Most programmers who are self-taught, pick up some theory through immersion. But what works well for natural language is not necessarily optimal for technical and scientific disciplines. The technical vocabulary of computer science and engineering is heavily mathematical, and this book provides a good introduction to the vocabulary, concepts, and methods of a rigorous approach to computing. Mastery of the concepts are essential for reliable programs in the “real” world.
Keywords
Free Download Mathematics for Algorithm and Systems Analysis (Dover Books on Mathematics) in PDF format
Mathematics for Algorithm and Systems Analysis (Dover Books on Mathematics) PDF Free Download
Download Mathematics for Algorithm and Systems Analysis (Dover Books on Mathematics) 2011 PDF Free
Mathematics for Algorithm and Systems Analysis (Dover Books on Mathematics) 2011 PDF Free Download
Download Mathematics for Algorithm and Systems Analysis (Dover Books on Mathematics) PDF
Free Download Ebook Mathematics for Algorithm and Systems Analysis (Dover Books on Mathematics)