External
Discrete Mathematics for Computer Science
In class materials for an introduction to logic, proof, enumeration, relations, and graph theory for lower division undergraduate students of computer science and computer systems engineering. These materials were designed to introduce concepts of logic and discrete mathematics via carefully picked problems that test understanding of definitions. Another source of exercises is required at this time.
- Author
- Mark A. Fitch
- Publisher
- University of Alaska Anchorage
- Source
- LibreTexts
- License
- GNU FDL
- Language
- EN
- Category
- Information Technology
Contents· 35 sections
- 01: Basics
- 1.01: Terminology
- 1.02: Sets
- 1.03: Set Operations
- 1.04: Sets in Relational Database
- 1.05: Combinatorics- First Counts
- 1.06: Sorting- Part 0
- 02: Logic
- 2.01: Formal Logic
- 2.02: Circuits
- 2.03: Predicate Logic
- 2.04: Mathematical Proof
- 03: Functions
- 3.01: Functions
- 3.02: Boolean Algebra
- 3.03: Modulo Arithmetic
- 3.04: Combinatorics- Second Counts
- 3.05: Proof by Contradiction
- 04: Relations
- 4.01: Example- Error Correcting Codes
- 4.02: Mathematical Relations
- 4.03: Equivalence Relations
- 4.04: Partially Ordered Sets
- 4.05: Combinatorics- Inclusion Exclusion
- 05: Graph Theory
- 5.01: Discovering Graphs
- 5.02: Properties of Graphs
- 5.03: Graph Isomorphism
- 5.04: Paths
- 5.05: Cycles
- 5.06: Trees
- 5.07: Linear Recurrence Relations
- 06: Appendix
- 6.01: A- University Database Example
- 6.02: B- Glossary