Discrete mathematics / by Richard Johnsonbaugh
Material type: TextPublication details: New Delhi : Pearson, 2013Edition: 6th edDescription: xvi, 672 p. : ill. ; 28 cmISBN: 9788131712870 (pbk)Subject(s): Diskrete MathematicsDDC classification: 510
Contents:
1. Logic and proofs
2. The Language of Mathematics
3. Relations
4. Algorithms
5. introduction to Number theory
6. Counting Methods and The pigeonhole
7. Recurrence Relations
8. Graph Theory
9. Trees
10. Network Models
11. Boolean Algebras and Combinatorial
12. Automata, Grammars and Languages
13. Computational Geometry
Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Books | Namal Library Mathematics | 510 JOH-D 2013 1112 (Browse shelf (Opens below)) | 1 | Available | 1112 | ||
Books | Namal Library Mathematics | 510 JOH-D 2013 1113 (Browse shelf (Opens below)) | 2 | Available | 1113 | ||
Books | Namal Library Mathematics | 510 JOH-D 2013 4193 (Browse shelf (Opens below)) | 3 | Available | 0004193 |
Total holds: 0
Browsing Namal Library shelves, Shelving location: Mathematics Close shelf browser (Hides shelf browser)
510 HON-N 1989 5117 New additional mathematics : | 510 HON-N 1989 7178 New additional mathematics : | 510 JOH-D 2013 1112 Discrete mathematics / | 510 JOH-D 2013 1113 Discrete mathematics / | 510 JOH-D 2013 4193 Discrete mathematics / | 510 KAR-M 1982 4098 Mathematical methods in continuous and discrete systems / | 510 KIN-A 2006 5285 The art of mathematics / |
1. Logic and proofs
2. The Language of Mathematics
3. Relations
4. Algorithms
5. introduction to Number theory
6. Counting Methods and The pigeonhole
7. Recurrence Relations
8. Graph Theory
9. Trees
10. Network Models
11. Boolean Algebras and Combinatorial
12. Automata, Grammars and Languages
13. Computational Geometry
There are no comments on this title.