Mathematics for Algorithm and Systems Analysis
Overview & Synopsis
Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Document Information
| Document Title | Mathematics for Algorithm and Systems Analysis |
|---|---|
| Author / Organization | Edward A. Bender, and S. Gill Williamson |
| Subject & Discipline | Discrete and Finite Mathematics, Geometry, PostScript Programming, Tex, LaTeX and AMS-LaTeX, Algebra, Abstract Algebra, and Linear Algebra, Mathematics |
| Categories | Discrete and Finite Mathematics |
| Publication Year | 2011 |
| ISBN | 978-0486442501 |
| Resource Verification | External Reading Page / Repository |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-97465 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
Mathematics for Algorithm and Systems Analysis • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.