Mathematics for Computer Science
This is a comprehensive textbook, covering some fundamental mathematical 
concepts underlying computer science. It starts with basic proofs, induction, 
and recursion; it proceeds to infinite sets, number theory, and graph theory. 
Further, it outlines the practical usage in the area of communication networks, 
along with some aspects of probability theory involving random variables and 
random walks. This merge of mathematical theory with computer science 
applications provides an excellent framework upon which students can base their 
study of algorithms, data structures, and other computational concepts.
Author(s): Eric Lehman, F. Thomson Leighton, Alberty R. 
Meyer
 427 Pages
427 Pages