Washburn, Sherwood <br/><br/>
Discrete Mathematics 

 - New York    Addison Wesley Longman\  2002 
 - 370 p.  Includes index 
<br/><br/> The discrete mathematics course is looked to more and more as a resource for dealing with them. One such case: Computer science students often do not have room in their curriculum  for a logic course, so the learn it in discrete math.In the discrete mathematics course, the student learns essential topics: induction and recursion, combinatorics, graph theory, and proofs and logic. Some of these topics are treated in more depth in the upper-division course. 
<br/><br/><label>ISBN: </label>981-4119-67-9 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Discrete Mathematics
<br/><br/><label>Dewey Class. No.: </label>C 511.2 W27d