Nguồn ngoài
Discrete Mathematics for Computer Science
- Tác giả
- Jin He
- Nhà xuất bản
- Fresno City College
- Nguồn
- LibreTexts
- Giấy phép
- CC BY-NC-SA
- Ngôn ngữ
- EN
- Danh mục
- Công nghệ thông tin
Mục lục· 46 mục
- 01: Introduction to Propositional Logic
- 1.01: Propositions
- 1.02: Predicates
- 1.03: Proving an Implication
- 1.04: Proving an If and Only If
- 1.05: Proof by Cases
- 1.06: Proof by Contradiction
- 1.07: Propositions from Propositions
- 1.08: Propositional Logic in Computer Programs
- 1.09: Equivalence and Validity
- 1.10: The Algebra of Propositions
- 1.11: Predicate Formulas
- 02: Sets and Set Operations
- 2.01: Sets and Set Notations
- 2.02: Set Operations
- 2.03: Set Difference and Set Complement
- 03: Functions and Binary Relations
- 3.01: Functions
- 3.02: Binary Relations
- 3.03: Reverse Relations and Images
- 3.04: Cardinality and Power Set
- 04: Mathematical Induction
- 4.01: Introduction to Mathematical Induction
- 4.02: Proof by Using Mathematical Induction
- 4.03: Loop Invariant
- 05: Algorithms
- 5.01: Introduction to Algorithm
- 5.02: More Examples of Algorithms
- 06: Cardinality Rules
- 6.01: Counting One Thing by Counting Another
- 6.02: Counting Sequences
- 6.03: The Generalized Product Rule
- 6.04: The Division Rule
- 6.05: Counting Subsets
- 6.06: Sequences with Repetitions
- 6.07: Counting Practice - Poker Hands
- 6.08: The Pigeonhole Principle
- 6.09: Inclusion-Exclusion
- 6.10: Combinatorial Proofs
- 07: Graph Theory
- 7.01: Introduction
- 7.02: Path and Cycles
- 08: Trees
- 8.01: Introduction and Huffman Codes
- 8.02: Terms and Characterizations of Trees
- 8.03: Binary Trees and Binary Search Trees