Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.
Discrete Mathematics for Computer Science Free Download
You may also like
Higher Engineering Mathematics has helped thousands of students to succeed in their exams by developing problem-solving skills, It is supported by over 600...
This is an introductory text for beginners who have a basic knowledge of complex analysis, functional analysis and partial differential equations. Riemann and...
The purpose of this book is to present typical methods (including rescaling methods) for the examination of the behavior of solutions of nonlinear partial di...
Add Comment