000 01640cam a22003497a 4500
999 _c30694
_d30694
001 17402530
005 20201006140648.0
008 120726t20132013enka 000 0 eng d
010 _a 2012945303
020 _a9781447140689 (alk. paper)
020 _a1447140680 (alk. paper)
020 _a9781447140696 (ebk.)
035 _a(OCoLC)ocn785073096
040 _aBTCTA
_beng
_cBTCTA
_dCDX
_dOCLCO
_dYDXCP
_dBWX
_dIOG
_dAHS
_dOCLCF
_dZWZ
_dOCLCQ
_dDLC
042 _alccopycat
050 0 0 _aQA76.9.M35J46 2012
100 1 _aJenkyns, T. A.
_q(Tom A.)
245 1 0 _aFundamentals of discrete math for computer science :
_ba problem-solving primer /
_cTom Jenkyns ; Ben Stephenson.
300 _axii, 416 pages :
_billustrations ;
_c24 cm.
490 1 _aUndergraduate topics in computer science.
505 0 _aAlgorithms, numbers, and machines -- Sets, sequences, and counting -- Boolean expressions, logic, and proof -- Searching and sorting -- Graphs and trees -- Relations: especially on (integer) sequences -- Sequences and series -- Generating sequences and subsets -- Discrete probability and average-case complexity -- Turing machines.
650 0 _aComputer science
_xMathematics.
650 7 _aComputer science
_xMathematics.
_2fast
650 7 _aInformatique
_xMathématiques.
_2ram
650 7 _aAlgorithmes.
_2ram
700 1 _aStephenson, Ben
_q(Benjamin David)
830 0 _aUndergraduate topics in computer science.
906 _a7
_bcbc
_ccopycat
_d2
_eepcn
_f20
_gy-gencatlg
942 _2lcc
_cBOOKS