Skip to main content

Discrete Mathematics Using a Computer

  • Textbook
  • © 2006

Overview

  • 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 knowledge of Functional Programming
  • All the material needed to use the book will be available for download via ftp
  • Includes an Instructors Guide, available via the Worldwide Web

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Programming and Reasoning with Equations

  2. Logic

  3. Set Theory

  4. Applications

Keywords

About this book

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.

Authors and Affiliations

  • Computing Science Department, University of Glasgow, Glasgow, UK

    John O’Donnell, Cordelia Hall

  • School of Computer Science, University of Oklahoma, Norman, USA

    Rex Page

Bibliographic Information

Publish with us