Discrete mathematics for computer science / by Gary Haggard, John Schlipf and Sue Whitesides.
Material type: TextPublication details: New Delhi : Cengage Learning, 2009Description: vii, 600 p. ; 24 cmISBN: 8131501213(pbk); 9788131501214(pbk)Subject(s): Mathematics | Computer science -- MathematicsDDC classification: 510Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Books | Namal Library Mathematics | 510 HAG-D 2009 3908 (Browse shelf (Opens below)) | Available | 0003908 |
Includes index.
1. Sets, Proof Templates, and Induction
2. Formal Logic
3. Relation
4. Function
5. Analysis of Algorithm
6. Graph theory
7. Counting and Combinatorics
8. Discrete Probability
9. Recurrence Relation
PC: Windows 98, ME, 2000, XP (not NT); Pentium II 233 MHrz; 32 MB RAM (64 recommended); 800 x 600, 16-bit high-color display; 16-bit sound card; spearkers or headphones; 8x CD-ROM drive.
Mac: MAC OS 8.6 or later; PowerPC processor or later; 64 MB RAM; 800 x 600, 16-bit high-color display; 16-bit sound card; spearkers or headphones; 8x CD-ROM drive.
There are no comments on this title.