Mathematics for Algorithm and Systems Analysis
Edward A. Bender, S. Gill Williamson
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.
Ссылка удалена правообладателем
----
The book removed at the request of the copyright holder.
