|
|
|
|
| LEADER |
02985nmm a2200337 u 4500 |
| 001 |
EB000367214 |
| 003 |
EBX01000000000000000220266 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9781846285981
|
| 100 |
1 |
|
|a O'Donnell, John
|
| 245 |
0 |
0 |
|a Discrete Mathematics Using a Computer
|h Elektronische Ressource
|c by John O'Donnell, Cordelia Hall, Rex Page
|
| 250 |
|
|
|a 2nd ed. 2006
|
| 260 |
|
|
|a London
|b Springer London
|c 2006, 2006
|
| 300 |
|
|
|a XIX, 441 p. 68 illus
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Discrete mathematics
|
| 700 |
1 |
|
|a Hall, Cordelia
|e [author]
|
| 700 |
1 |
|
|a Page, Rex
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 028 |
5 |
0 |
|a 10.1007/1-84628-598-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/1-84628-598-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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/
|