Discrete Mathematics Using a Computer

O'Donnell, John

ISBN 10: 1846282411 / ISBN 13: 9781846282416

Edité par Springer, 2006

A propos de cet article

This is a pre-loved book that shows moderate signs of wear from previous reading. You may notice creases, edge wear, or a cracked spine, but it remains in solid, readable condition.Please note:-May include library or rental stickers, stamps, or markings.-Supplemental materials e.g., CDs, access codes, inserts are not guaranteed.-Box sets may not come with the original outer box. If it does, the box will not be in perfect condition. -Sourced from donation centers; authenticity not verified with publisher. Your satisfaction is our top priority! If you have any questions or concerns about your order, please donâ t hesitate to reach out. Thank you for shopping with us and supporting small businessâ happy reading!

N° de réf. du vendeur STM.ML

Détails bibliographiques

• Titre: Discrete Mathematics Using a Computer
• Éditeur: Springer
• Date de parution: 2006
• Langue: anglais
• ISBN à 10 chiffres: 1846282411
• ISBN à 13 chiffres: 9781846282416
• Reliure: Couverture souple
• Édition: 2ème Édition
• État de l'article: good

A propos de ce titre

Synopsis

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.