000 00841cam a22002177a 4500
999 _c12023
_d12023
005 20200903112417.0
008 040921s2006 cau 001 0 eng d
020 _a9788131501214
040 _cPK
082 0 0 _a510
_222
_bH1452
100 1 _aHaggard, Gary.
245 1 0 _aDiscrete mathematics for computer science
_c/ Gary Haggard, John Schlipf and Sue Whitesides.
260 _aNew Delhi :
_bCengage Learning,
_c2009
300 _axxiii, 600 p. ;
_c24 cm. +
650 0 _aMathematics.
650 0 _aComputer science
_xMathematics.
700 1 _aSchlipf, John.
700 1 _aWhitesides, Sue H.,
942 _cBK
505 0 _a1. Sets, proof templates and induction 2. Formal logic 3. Relations 4. Functions 5. Analysis of algorithms 6. Graph theory 7. Counting and combinatorics 8. Discrete probability 9. Recurrence relations