Taylor's Library Banner
Image from Google Jackets

Discrete and combinatorial mathematics : an applied introduction / Ralph P. Grimaldi

By: Publication details: Reading, Mass. : Addison-Wesley, c1999Edition: 4th edDescription: xix, 791, [138] p. : ill. ; 25 cmISBN:
  • 0201199122
Subject(s): DDC classification:
  • 510 GRI
Contents:
Pt. 1. Fundamentals of discrete mathematics. 1. Fundamental principles of counting. 2. Fundamentals of logic. 3. Set theory. 4. Properties of the integers : mathematical induction. 5. Relations and functions. 6. Languages : finite state machines. 7. Relations : the second time around. - Pt. 2. Further topics in enumeration. 8. The principle of inclusion and exclusion. 9. Generating functions. 10. Recurrence relations. - Pt. 3. Graph theory and applications. 11. An introduction to graph theory. 12. Trees. 13. Optimization and matching. - Pt. 4. Modern applied algebra. 14. Rings and modular arithmetic. 15. Boolean algebra and switching functions. 16. Groups, Coding theory, and Polya's method of enumeration. 17. Finite fields and combinatorial designs. - Appendix 1. Exponential and logarithmic functions. - Appendix 2. Matrices, matrix operations, and determinants. - Appendix 3. Countable and uncountable sets. - Solutions. - Index.
Holdings
Cover image Item type Current library Home library Collection Shelving location Shelf location Call number Materials specified Vol info Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Main Collection Taylor's Library-TU

Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 2

 510 GRI (Browse shelf(Opens below)) 1 Available SOCIT,15010,03,GR 5000030477

"Reprinted with corrections, April 2000" - T.p. verso

Pt. 1. Fundamentals of discrete mathematics. 1. Fundamental principles of counting. 2. Fundamentals of logic. 3. Set theory. 4. Properties of the integers : mathematical induction. 5. Relations and functions. 6. Languages : finite state machines. 7. Relations : the second time around. - Pt. 2. Further topics in enumeration. 8. The principle of inclusion and exclusion. 9. Generating functions. 10. Recurrence relations. - Pt. 3. Graph theory and applications. 11. An introduction to graph theory. 12. Trees. 13. Optimization and matching. - Pt. 4. Modern applied algebra. 14. Rings and modular arithmetic. 15. Boolean algebra and switching functions. 16. Groups, Coding theory, and Polya's method of enumeration. 17. Finite fields and combinatorial designs. - Appendix 1. Exponential and logarithmic functions. - Appendix 2. Matrices, matrix operations, and determinants. - Appendix 3. Countable and uncountable sets. - Solutions. - Index.