MARC Record from harvard_bibliographic_metadata

LEADER: 02247cam a2200361 a 4500
001 013367753-2
005 20140301020753.0
008 120201s2012 flua b 000 0 eng
010 $a 2011052562
016 7 $a016015651$2Uk
020 $a9781466504998 (hardcover : acid-free paper)
020 $a1466504994 (hardcover : acid-free paper)
035 0 $aocn754730101
040 $aDLC$beng$cDLC$dYDX$dBTCTA$dUKMGB$dOCLCO$dYDXCP$dBWX$dCDX
042 $apcc
050 00 $aQA39.3$b.B385 2012
082 00 $a511/.1$223
084 $aCOM046000$aMAT000000$aMAT036000$2bisacsh
100 1 $aBelcastro, Sarah-Marie.
245 10 $aDiscrete mathematics with ducks /$cSarah-Marie Belcastro.
260 $aBoca Raton, FL :$bCRC Press,$cc2012.
300 $axli, 538 p. :$bill. ;$c24 cm.
500 $a"An A K Peters book."
520 $a"Suitable for an introductory course in discrete mathematics, this textbook has few mathematical prerequisites and does not assume any prior exposure to proofwriting. Still, it covers the standard and practical topics required in a discrete mathematics course and fits the curriculum as outlined in the SIGCSE guidelines, focusing on content rather than technique. Particularly amenable to discovery- or inquiry-based learning, the text includes many exercises and classroom activities, and the author has incorporated instructor's notes at the end of every chapter"--Provided by publisher.
504 $aIncludes bibliographical references.
505 0 $aTheme: the basics. Counting and proofs -- Sets and logic -- Graphs and functions -- Induction -- Algorithms with ciphers -- Theme: combinatorics. Binomial coefficients and Pascal's triangle -- Balls and boxes and PIE: counting techniques -- Recurrences -- Cutting up food: counting and geometry -- Theme: graph theory. Trees -- Euler's formula and applications -- Graph traversals -- Graph coloring -- Other material. Probability and expectation -- Fun with cardinality.
650 0 $aMathematics$vTextbooks.
650 0 $aComputer science$xMathematics.
650 7 $aCOMPUTERS / Operating Systems / General.$2bisacsh
650 7 $aMATHEMATICS / General.$2bisacsh
650 7 $aMATHEMATICS / Combinatorics.$2bisacsh
988 $a20121003
906 $0DLC