Discrete Structures for Computer Science: Counting, Recursion, and Probability
Overview & Synopsis
This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures. It starts with a chapter on sets and goes on to provide examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Discrete Structures for Computer Science: Counting, Recursion, and Probability |
|---|---|
| Author / Organization | Michiel Smid |
| Subject & Discipline | Discrete and Finite Mathematics, Algorithms and Data Structures, Computer Programming, Introduction to Computer Science |
| Categories | Discrete and Finite Mathematics |
| Publication Year | 2019 |
| License / Rights | Creative Commons License (CC) |
| Resource Verification | Verification pending |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-95894 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |