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 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

Скачать книгу бесплатно (pdf, 1.94 Mb)

---

Читать «Mathematics for Algorithm and Systems Analysis»