Amazon.com: Discrete Mathematics Using a Computer (9781846282416): John O'Donnell, Cordelia Hall, Rex Page: Books
Discrete Mathematics Using a Computer and over one million other books are available for Amazon Kindle. Learn more


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Discrete Mathematics Using a Computer
 
 
Start reading Discrete Mathematics Using a Computer on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Discrete Mathematics Using a Computer [Paperback]

John O'Donnell (Author), Cordelia Hall (Author), Rex Page (Author)
3.0 out of 5 stars  See all reviews (2 customer reviews)

List Price: $64.95
Price: $52.25 & this item ships for FREE with Super Saver Shipping. Details
You Save: $12.70 (20%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Want it delivered Monday, February 27? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $47.02  
Paperback $52.25  

Book Description

July 10, 2006 1846282411 978-1846282416 2nd
This book offers a "hands-on" approach to teaching Discrete Mathematics. Using software that is freely available on Mac, PC & Unix platforms, the functional language Haskell allows students to experiment with mathematical notations & concepts -- a practical approach that provides students with instant feedback & allows lecturers to monitor progress easily. This 2nd edition contains additional material on the applications of formal methods to practical programming problems. There are more examples of induction proofs on small programs, & a new chapter showing how a mathematical approach can be used to motivate AVL trees, a complex data structure. Designed for 1st & 2nd year undergraduates, the book is also well suited for self-study. No prior knowledge of functional programming is required. Complete with an instructor's guide, via the web, this book is intended as the primary teaching text for Discrete Mathematics courses, but will also provide useful reading for Conversion Masters & Formal Methods courses.

Frequently Bought Together

Customers buy this book with The Haskell Road to Logic, Maths and Programming (Texts in Computing) $22.29

Discrete Mathematics Using a Computer + The Haskell Road to Logic, Maths and Programming (Texts in Computing)
Price For Both: $74.54

One of these items ships sooner than the other. Show details



Editorial Reviews

From the Back Cover

Discrete Mathematics Using a Computer offers a new, "hands-on" approach to teaching Discrete Mathematics. Using software that is freely available on Mac, PC and Unix platforms, the functional language Haskell allows students to experiment with mathematical notations and concepts -- a practical approach that provides students with instant feedback and allows lecturers to monitor progress easily. This second edition of the successful textbook contains significant additional material on the applications of formal methods to practical programming problems. There are more examples of induction proofs on small programs, as well as a new chapter showing how a mathematical approach can be used to motivate AVL trees, an important and complex data structure. Designed for 1st and 2nd year undergraduate students, the book is also well suited for self-study. No prior knowledge of functional programming is required; everything the student needs is either provided or can be picked up easily as they go along. Key features include: • Numerous exercises and examples • A web page with software tools and additional practice problems, solutions, and explanations, as well as course slides • Suggestions for further reading Complete with an accompanying instructor's guide, available via the web, this volume is intended as the primary teaching text for Discrete Mathematics courses, but will also provide useful reading for Conversion Masters and Formal Methods courses. Visit the book’s Web page at: http://www.dcs.gla.ac.uk/~jtod/discrete-mathematics/

Product Details

  • Paperback: 460 pages
  • Publisher: Springer; 2nd edition (July 10, 2006)
  • Language: English
  • ISBN-10: 1846282411
  • ISBN-13: 978-1846282416
  • Product Dimensions: 9.2 x 6.1 x 0.9 inches
  • Shipping Weight: 1.4 pounds (View shipping rates and policies)
  • Average Customer Review: 3.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #1,586,257 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

2 Reviews
5 star:
 (1)
4 star:    (0)
3 star:    (0)
2 star:    (0)
1 star:
 (1)
 
 
 
 
 
Average Customer Review
3.0 out of 5 stars (2 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

9 of 9 people found the following review helpful:
5.0 out of 5 stars From maths to software: elegant and clever, August 7, 2007
This review is from: Discrete Mathematics Using a Computer (Paperback)
Discrete Mathematics Using a Computer is the best book I have seen so far when studying how to use the elegance of discrete mathematics (for example: list comprehension, recursion, sets, relations, trees) in programming. The book is exceptional in showing how you can transform mathematical thoughts into the functional programming language HASKELL without loosing the expressiveness of the mathematical formulation. The book shows how to write two- ore three-liners of compact, readable code that implements algorithms (like tree traversal) that usually takes at least a page or two of ugly "for-if-loop-code" in languages like C++ or Java. There are chapters on important applications of the proposed concepts for the design of digital circuits and for

AVL Trees. The text clearly shows the strengths of functional programming compared to imperative programming (Java, C, ...) for many programming tasks and it helps the programmer to better choose his tools.

Finally, the book contains clever and helpfull exercises with many answers. The book has a website providing dedicated code (HASKELL) for the examples.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


5 of 32 people found the following review helpful:
1.0 out of 5 stars Pitiful excuse for a textbook, October 15, 2001
By A Customer
This book purports to be a college text for discrete math. It is terrible. There aren't nearly enough examples in the book. Explanations are woefully brief, giving one sentence to the definition of a set intersection, for example. Many new concepts sneak up on you without ever being discussed. In one instance it started using a point by point proof method without ever introducing that method. The rules given in some proofs are not defined earlier, leaving the reader to wonder what the authors are doing in their proof. The use of Haskel is another downside. There is no way to check your proofs aside from the proof checker software included which will drive a person to complete insanity. The software is so terribly picky in its syntax, you take more time verifying your proof than actually coming up with it. When there are errors with your syntax, it doesn't give a meaningful message. This is more the fault of Haskel, however. Nevertheless, it is the fault of the authors to choose this terrible method for teaching. Garbage.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
concat xss, using tree induction, data item parameter, properly functioning computer, data recursion, extremal clause, using equational reasoning, desktop method, poset diagram, equational model, list comprehension, inductive case, list induction, proper subtree, ripple carry adder, left subtree, symmetric closure, tallest part, quasi order, proof checker, right subtree, induction case, carry input, extensional equality, carry output
Key Phrases - Capitalized Phrases (CAPs): (learn more)
False True, False False, Modus Ponens, Nub Nub, Review Exercises Exercise, Proof Prop, Bool Exercise, Tip Tip, Halting Problem, Leaf Leaf, Ratio Integer, Modus Tollens, Succ Zero, True Inductive Case, Zero Zero
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




What Other Items Do Customers Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums



So You'd Like to...

Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject