Mathematics for the IB diploma higher level topic 11 discrete mathematics / Stan Dolan, Hugh Neill and Douglas Quadling.
By: Dolan, Stan.
Contributor(s): Quadling, D. A | Neill, Hugh.
Series: Cambridge learning. Publisher: Cambridge : Cambridge University Press, 2008Description: 124 p. : ill. ; 25 cm.ISBN: 9780521714655 (pbk.).Subject(s): Mathematics | Mathematics -- Problems, exercises, etcDDC classification: 510
Contents:
1. Integers. 2. Linear diophantine equations. 3. Modular arithmetic. 4. Fermat's little theorem. 5. Integers in different bases. 6. Graphs. 7. Isomorphic graphs. 8. Minimun spanning tree. 9. The shortest path. 10. The chinese postman algorithm. 11. The travelling salesperson problem.
Item type | Current location | Call number | Copy number | Status | Notes | Date due | Barcode | Remark |
---|---|---|---|---|---|---|---|---|
Main Collection | TC External Storage | 510 DOL (Browse shelf) | 1 | Available | IBDxx,32000,03,CL | 5000089026 | Please fill up online form at https://taylorslibrary.taylors.edu.my/services/external_storage1 |
Browsing TC External Storage Shelves Close shelf browser
510 DEC Decision mathematics 1 / | 510 DEV The language of mathematics : | 510 DIS Discrete mathematics / | 510 DOL Mathematics for the IB diploma higher level topic 11 | 510 EMA Pure mathematics 1 / | 510 EMA Pure mathematics 1 / | 510 EMA Pure mathematics 1 / |
1. Integers. 2. Linear diophantine equations. 3. Modular arithmetic. 4. Fermat's little theorem. 5. Integers in different bases. 6. Graphs. 7. Isomorphic graphs. 8. Minimun spanning tree. 9. The shortest path. 10. The chinese postman algorithm. 11. The travelling salesperson problem.
Mathematics : BL-MAT-S