Discrete mathematics for computer science / Gary Haggard, John Schlipf and Sue Whitesides.
Material type:
TextPublication details: New Delhi : Cengage Learning, 2009Description: xxiii, 600 p. ; 24 cm. +ISBN: - 9788131501214
- 510 22 H1452
Contents:
1. 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
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Books
|
UE-Central Library | 510 H1452 (Browse shelf(Opens below)) | Available | T9788 | ||
|
Books
|
UE-Central Library | 510 H1452 (Browse shelf(Opens below)) | Available | T9724 | ||
|
Books
|
UE-Central Library | 510 H1452 (Browse shelf(Opens below)) | Available | T10127 | ||
|
Books
|
UE-Central Library | 510 H1452 (Browse shelf(Opens below)) | Available | T10126 |
Browsing UE-Central Library shelves Close shelf browser (Hides shelf browser)
1. 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
There are no comments on this title.
Log in to your account to post a comment.
