000 03544nam a22005175i 4500
001 978-1-84628-598-1
003 DE-He213
005 20161121230526.0
007 cr nn 008mamaa
008 100301s2006 xxk| s |||| 0|eng d
020 _a9781846285981
_9978-1-84628-598-1
024 7 _a10.1007/1-84628-598-4
_2doi
050 4 _aQA76.9.M35
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aO’Donnell, John.
_eauthor.
245 1 0 _aDiscrete Mathematics Using a Computer
_h[electronic resource] /
_cby John O’Donnell, Cordelia Hall, Rex Page.
250 _a2.
264 1 _aLondon :
_bSpringer London,
_c2006.
300 _aXIX, 441 p. 68 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aProgramming 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.
520 _aDiscrete 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/.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aHall, Cordelia.
_eauthor.
700 1 _aPage, Rex.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781846282416
856 4 0 _uhttp://dx.doi.org/10.1007/1-84628-598-4
912 _aZDB-2-SCS
950 _aComputer Science (Springer-11645)
999 _c500071
_d500071