John Dossey,
John A. Dossey,
Albert Otto,
Albert D. Otto,
Lawrence Spence,
Lawrence E. Spence,
Charles Vanden Eynden
e.a.
Pearson Education
e druk, 2017
9780134689562
Discrete Mathematics (Classic Version)
Specificaties
Paperback, blz.
|
Engels
Pearson Education |
e druk, 2017
ISBN13: 9780134689562
Rubricering
Onderdeel van serie
Pearson Modern Classics for Advanced Mathematics Series
Levertijd ongeveer 8 werkdagen
Samenvatting
This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price.
An ever-increasing percentage of mathematic applications involve discrete rather than continuous models. Driving this trend is the integration of the computer into virtually every aspect of modern society. Intended for a one-semester introductory course, the strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.
Specificaties
Inhoudsopgave
<ul> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 1: An Introduction to Combinatorial Problems and Techniques </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 2: Sets, Relations, and Functions </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 3: Coding Theory </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 4: Graphs </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 5: Trees </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 6: Matching </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 7: Network Flows </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 8: Counting Techniques </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 9: Recurrence Relations and Generating Functions </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> 10: Combinatorial Circuits and Finite State Machines </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> Appendix A: An Introduction to Logic and Proof </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> Appendix B Matrices </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> Historical Notes </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> Appendix C The Algorithms in This Book </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> Bibliography </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> Answers to odd-numbered exercises </div> </li> <li> <div style="MARGIN: 0in 0in 0pt; mso-layout-grid-align: none" sonormal=""> Index </div> </li> </ul>