Phu Xuan University Library
|
PXU E-LIB
Sign in
Discrete Mathematics for Computer Science

External

Discrete Mathematics for Computer Science

Engineering
Author
Jin He
Publisher
Fresno City College
Source
LibreTexts
License
CC BY-NC-SA
Language
EN
Category
Information Technology
Read online Download PDF (open licence)
Contents· 46 sections
  1. 01: Introduction to Propositional Logic
  2. 1.01: Propositions
  3. 1.02: Predicates
  4. 1.03: Proving an Implication
  5. 1.04: Proving an If and Only If
  6. 1.05: Proof by Cases
  7. 1.06: Proof by Contradiction
  8. 1.07: Propositions from Propositions
  9. 1.08: Propositional Logic in Computer Programs
  10. 1.09: Equivalence and Validity
  11. 1.10: The Algebra of Propositions
  12. 1.11: Predicate Formulas
  13. 02: Sets and Set Operations
  14. 2.01: Sets and Set Notations
  15. 2.02: Set Operations
  16. 2.03: Set Difference and Set Complement
  17. 03: Functions and Binary Relations
  18. 3.01: Functions
  19. 3.02: Binary Relations
  20. 3.03: Reverse Relations and Images
  21. 3.04: Cardinality and Power Set
  22. 04: Mathematical Induction
  23. 4.01: Introduction to Mathematical Induction
  24. 4.02: Proof by Using Mathematical Induction
  25. 4.03: Loop Invariant
  26. 05: Algorithms
  27. 5.01: Introduction to Algorithm
  28. 5.02: More Examples of Algorithms
  29. 06: Cardinality Rules
  30. 6.01: Counting One Thing by Counting Another
  31. 6.02: Counting Sequences
  32. 6.03: The Generalized Product Rule
  33. 6.04: The Division Rule
  34. 6.05: Counting Subsets
  35. 6.06: Sequences with Repetitions
  36. 6.07: Counting Practice - Poker Hands
  37. 6.08: The Pigeonhole Principle
  38. 6.09: Inclusion-Exclusion
  39. 6.10: Combinatorial Proofs
  40. 07: Graph Theory
  41. 7.01: Introduction
  42. 7.02: Path and Cycles
  43. 08: Trees
  44. 8.01: Introduction and Huffman Codes
  45. 8.02: Terms and Characterizations of Trees
  46. 8.03: Binary Trees and Binary Search Trees