Discrete mathematical structures : theory and application / D.S. Malik, M.K. Sen.
Material type: TextPublication details: Boston, Mass. : Course Technology, 2004Description: xiv, 905 p + CD-ROMISBN:- 0619212853 (pbk.)
- QA 76.9.M35 M34D 2004
Contents:
Foundations : sets, logic and algorithms--Integers and mathematical induction--Relations and posets--Matrices and closures of relations--Functions--Congruences--Counting principles--Recurrence relations--Algorithms and time complexity--Graph theory--Trees and networks--Boolean algebra and combinatorial circuits--Finite automata and languages
Item type | Current library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|---|---|
CD/DVD (Accompanying Material) | SPU Library, Bangkok (Main Campus) | CD/DVD Accompanying Materials | Floor 5: CD/DVD Accompany | QA 76.9.M35 M34D 2004 (Browse shelf(Opens below)) | CD.No.1077 | Available | FCD056387 |
Total holds: 0
Browsing SPU Library, Bangkok (Main Campus) shelves Close shelf browser (Hides shelf browser)
QA 76.9.M35 F67P 2018 Probability and statistics for computer science / | QA 76.9.M35 H33D 2006 Discrete mathematics for computer science / | QA 76.9.M35 H33D 2006 Discrete mathematics for computer science / | QA 76.9.M35 M34D 2004 Discrete mathematical structures : | QA 76.9.M35 M34D 2004 Discrete mathematical structures : | QA 76.9.M35 M64M 2013 Modelling computer systems : mathematics of computer science / | QA 76.9.M35 O23A 2018 Analysis for computer scientists : foundations, methods, and algorithms / |
Includes index.
Foundations : sets, logic and algorithms--Integers and mathematical induction--Relations and posets--Matrices and closures of relations--Functions--Congruences--Counting principles--Recurrence relations--Algorithms and time complexity--Graph theory--Trees and networks--Boolean algebra and combinatorial circuits--Finite automata and languages
There are no comments on this title.
Log in to your account to post a comment.