Richard Johnsonbaugh

Discrete Mathematics, Global Edition (eBook, PDF)

• Format: PDF

Produktbeschreibung

The full text downloaded to your computer

With eBooks you can:

• search for key concepts, words and phrases
• make highlights and notes as you study
• share your notes with friends

eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps.

Upon purchase, you'll gain instant access to this eBook.

Time limit

The eBooks products do not have an expiry date. You will continue to access your digital ebook products whilst you have your Bookshelf installed.

For one- or two-term introductory courses in discrete mathematics.

With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topics serves to reinforce understanding. The text models various problem-solving techniques in detail, then provides opportunity to practice these techniques. The text also builds mathematical maturity by emphasising how to read and write proofs. Many proofs are illustrated with annotated figures and/or motivated by special Discussion sections.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Pearson HigherEducation
• Seitenzahl: 1
• Altersempfehlung: ab 18 Jahre
• Erscheinungstermin: 9. Oktober 2018
• Englisch
• ISBN-13: 9781292233727
• Artikelnr.: 56954877

Inhaltsangabe

1. Sets and Logic
2. Proofs
3. Functions, Sequences, and Relations
4. Algorithms
5. Introduction to Number Theory
6. Counting Methods and the Pigeonhole Principle
7. Recurrence Relations
8. Graph Theory
9. Trees
10. Network Models
11. Boolean Algebras and Combinatorial Circuits
12. Automata, Grammars, and Languages
13. Computational Geometry
Appendix
A. Matrices
B. Algebra Review
C. Pseudocode
References
Hints and Solutions to Selected Exercises
Index