Gersting, Judith L. <br/><br/>
Mathematical structures for computer science / 
Judith L. Gersting. 
 - 5th edition. 
 - New York :  W.H. Freeman,  c2003. 
 - xix, 729 p. :  ill. ;  27 cm. 
<br/><br/> Table of content <br/>1:Formal logic<br/>1.1 statements, symbolic representation and tautologies<br/>1.2 propositional logic<br/>1.3 qualifiers, predicates and validity<br/>1.4  predicate logic<br/>1.5 logic programming<br/>1.6 proof of correctness<br/>2: proofs, recursion, and analysis of algorithms<br/>2.1 proof techniques<br/>2.2 induction<br/>2.3 more on proof of correctness<br/>2.4 recursion and recurrence relations<br/>2.5 analysis of algorithms<br/>3: sets, combinatorics and probability<br/>3.1 sets<br/>3.2 counting<br/>3.3 principles of inclusion and exclusion; pigeonhole principle<br/>3.4 permutations and combinations<br/>3.5 probability<br/>3.6 binomial theorem<br/>4: relations, functions and matrices<br/>4.1 relations<br/>4.2 topological sorting<br/>4.3 relations and database<br/>4.4 functions<br/>4.5 matrices<br/>5: graphs and tress<br/>5.1 graphs and their representation<br/>5.2 tress and their representation <br/>5.3 decision trees<br/>5.4 Huffman codes<br/>6:  graph algorithms<br/>6.1 directed graph and binary relations; warshall's algorithm<br/>6.2 Euler path and Hamiltonian circuit <br/>6.3 shortest path and minimal spanning tress<br/>6.4 traversal algorithms<br/>7: Boolean algebra and computer logic<br/>7.1 Boolean algebra structure<br/>7.2 logic networks<br/>7.3 minimisation <br/>8: modelling arithmetic, computation and languages<br/>8.1 algebraic structure <br/>8.2 finite-state machines<br/>8.3 turning machines<br/>8.4 formal languages 
<br/><br/>index: p710--729 
<br/><br/><label>ISBN: </label>0716743582 
<br/><br/><label>LCCN: </label>2002002589 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Mathematics.<br/>Mathematical models.<br/>Computer science--Mathematics.
<br/><br/><label>Dewey Class. No.: </label>004.0151  / GER