title: Essential Discrete Math for Computer Science
author:  Todd Feil 
description: This book introduces readers to the mathematics of computer science and prepares them for the math they will encounter in other college courses. It includes applications that are specific to computer science, helps learners to develop reasoning skills, and provides the fundamental mathematics necessary for computer scientists.  Chapter topics include sets, functions and relations, Boolean algebra, natural numbers and induction, number theory, recursion, solving recurrences, counting, matrices, and graphs.  For computer scientists and the enhancement of programming skills.
zlib_text:  
   
   
  
  Discrete Mathematics 
  i 
   
   
   
  About the Tutorial 
  Discrete Mathematics is a branch of mathematics involving discrete elements that uses 
  algebra and arithmetic. It is increasingly being applied in the practical fields of 
  mathematics and computer science. It is a very good tool for improving reasoning and 
  problem-solving capabilities. 
  This tutorial explains the fundamental concepts of Sets, Relations and Functions, 
  Mathematical Logic, Group theory, Counting Theory, Probability, Mathematical Induction 
  and Recurrence Relations, Graph Theory, Trees and Boolean Algebra. 
   
  Audience 
  This tutorial has been prepared for students pursuing a degree in any field of computer 
  science and mathematics. It endeavors to help students grasp the essential concepts of 
  discrete mathematics.   
   
  Prerequisites 
  This tutorial has an ample amount of both theory and mathematics. The readers are 
  expected to have a reasonably good understanding of elementary algebra and arithmetic.  
   
  Copyright