SØG - mellem flere end 8 millioner bøger:
Viser: Discrete Mathematics (Classic Version)
Discrete Mathematics (Classic Version)
John Dossey, Albert Otto, Lawrence Spence og Charles Vanden Eynden
(2017)
Sprog: Engelsk
Pearson Education
1.168,00 kr.
ikke på lager, Bestil nu og få den leveret
om ca. 10 hverdage
om ca. 10 hverdage
Detaljer om varen
- 5. Udgave
- Paperback: 696 sider
- Udgiver: Pearson Education (Marts 2017)
- Forfattere: John Dossey, Albert Otto, Lawrence Spence og Charles Vanden Eynden
- ISBN: 9780134689562
This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price. Please visit www.pearsonhighered.com/math-classics-series for a complete list of titles.
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.
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.
1: An Introduction to Combinatorial Problems and Techniques
2: Sets, Relations, and Functions
3: Coding Theory
4: Graphs
5: Trees
6: Matching
7: Network Flows
8: Counting Techniques
9: Recurrence Relations and Generating Functions
10: Combinatorial Circuits and Finite State Machines Appendix A: An Introduction to Logic and Proof Appendix B Matrices Historical Notes Appendix C The Algorithms in This Book Bibliography Answers to odd-numbered exercises Index
2: Sets, Relations, and Functions
3: Coding Theory
4: Graphs
5: Trees
6: Matching
7: Network Flows
8: Counting Techniques
9: Recurrence Relations and Generating Functions
10: Combinatorial Circuits and Finite State Machines Appendix A: An Introduction to Logic and Proof Appendix B Matrices Historical Notes Appendix C The Algorithms in This Book Bibliography Answers to odd-numbered exercises Index
De oplyste priser er inkl. moms
Butikker og åbningstid
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Polyteknisk Boghandel og Forlag A/S - Anker Engelundsvej 1 - 2800 Lyngby
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927