Discrete Mathematics Using a Computer by John O'DonnellDiscrete Mathematics Using a Computer by John O'Donnell

Discrete Mathematics Using a Computer

byJohn O'Donnell

Paperback | July 19, 2006

Pricing and Purchase Info

$87.35 online 
$103.50 list price save 15%
Earn 437 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


Computer science abounds with applications of discrete mathematics, yet s- dents of computer science often study discrete mathematics in the context of purely mathematical applications. They have to ?gure out for themselves how to apply the ideas of discrete mathematics to computing problems. It is not easy. Most students fail to experience broad success in this enterprise, which is not surprising, since many of the most important advances in science and engineeringhavebeen, precisely, applicationsofmathematicstospeci?cscience and engineering problems. Tobesure,mostdiscretemathtextbooksincorporatesomeaspectsapplying discrete math to computing, but it usually takes the form of asking students to write programs to compute the number of three-ball combinations there are in a set of ten balls or, at best, to implement a graph algorithm. Few texts ask students to use mathematical logic to analyze properties of digital circuits or computer programs or to apply the set theoretic model of functions to understand higher-order operations. A major aim of this text is to integrate, tightly, the study of discrete mathematics with the study of central problems of computer science.
Title:Discrete Mathematics Using a ComputerFormat:PaperbackDimensions:441 pagesPublished:July 19, 2006Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:1846282411

ISBN - 13:9781846282416


Table of Contents

Programming and Reasoning with Equations.- to Haskell.- Equational Reasoning.- Recursion.- Trees.- Logic.- Propositional Logic.- Predicate Logic.- Set Theory.- Set Theory.- Inductively Defined Sets.- Relations.- Functions.- Applications.- The AVL Tree Miracle.- Discrete Mathematics in Circuit Design.