书目名称 | Discrete Mathematics Using a Computer | 编辑 | John O’Donnell,Cordelia Hall,Rex Page | 视频video | | 概述 | Takes an entirely original approach to the teaching Discrete Mathematics, aimed at making it easier for students to learn difficult concepts.Uses a simple functional language, requiring no prior knowl | 图书封面 |  | 描述 | 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. | 出版日期 | Textbook 2006Latest edition | 关键词 | Computer; Correctness proofs; Discrete Mathematics; Formal Methods; Functional Programming; Induction; Mat | 版次 | 2 | doi | https://doi.org/10.1007/1-84628-598-4 | isbn_softcover | 978-1-84628-241-6 | isbn_ebook | 978-1-84628-598-1 | copyright | Springer-Verlag London 2006 |
The information of publication is updating
|
|