Discrete mathematics with applications / Susanna S. Epp.
Material type:
TextPublisher: Boston, Massachusetts : Cengage Learning, 2020Edition: Fifth editionDescription: xxii, 871 [A-141, I-22] pages : illustrations ; 26 cmContent type: - text
- unmediated
- volume
- 9781337694193
- 510 Ep71d
- QA39.3 .E65 2020
| Item type | Current library | Shelving location | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Books
|
Main Library | Circulation Section | CIR 510 Ep71d 2020 (Browse shelf(Opens below)) | 1-3 | Available | 025168 | ||
Books
|
Main Library | Circulation Section | CIR 510 Ep71d 2020 (Browse shelf(Opens below)) | 2-3 | Available | 026213 | ||
Books
|
Main Library | Circulation Section | CIR 510 Ep71d 2020 (Browse shelf(Opens below)) | 3-3 | Available | 026214 |
Browsing Main Library shelves, Shelving location: Circulation Section Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| CIR 510 Ep71d 2020 Discrete mathematics with applications : metric version / | CIR 510 Ep71d 2020 Discrete mathematics with applications / | CIR 510 Ep71d 2020 Discrete mathematics with applications : metric version / | CIR 510 Ep71d 2020 Discrete mathematics with applications / | CIR 510 Ep71d 2020 Discrete mathematics with applications / | CIR 510 Ep71d 2020 Discrete mathematics with applications : metric version / | CIR 510 Ep71d 2020 Discrete mathematics with applications : metric version / |
Includes index.
Speaking mathematically -- The logic of compound statements -- The logic of quantified statements -- Elementary number theory and methods of proof -- Sequences, mathematical induction, and recursion -- Set theory -- Properties of functions -- Properties of relations -- Counting and probability -- Theory of graphs and trees -- Analysis of algorithm efficiency -- Regular expressions and finite-state automata.
There are no comments on this title.