Discrete Math, Kenneth Rosen
flashcards
Decks in class (44)
# Cards
-
The foundations: logic and proof147
-
Chapter one, Revision Examples.19
-
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices112
-
2.4 Sequences and Summations27
-
2.5 Cardinality of Sets19
-
2.6 Matrices29
-
9.1 Relations and their properties20
-
9.2 n-ary Relations and their Applications34
-
9.3 Representing Relations12
-
9.4 Closure Of Relations19
-
3.1 Algorithms33
-
Appendix 3 Pseudocode:8
-
3.2 The growth of functions26
-
3.3 Complexity Of Algorithms22
-
4.1 Divisibility and Modular Arithmetic17
-
4.2 Integer Representations and Algorithms14
-
4.3 Primes and Greatest Common Divisors34
-
4.4 Solving Congruences24
-
4.5 Applications of Congruences14
-
4.6 Cryptography29
-
5.1 Mathematical Induction17
-
6.1 The Basics Of Counting12
-
6.2 The Pigeonhole Principle10
-
6.3 Permutations and Combinations14
-
6.4 Binomial Coefficients and Identities14
-
6.5 Generalized Permutations and Combinations16
-
6.6 Generating Permutations and Combinations8
-
9.5 Equivalence Relations8
-
9.6 Partial Orderings2
-
10.1 Graphs and Graph Models13
-
10.2 Graph Terminology and Special Types of Graphs34
-
10.3 Representing Graphs and Graph Isomorphism12
-
10.4 Connectivity27
-
10.5 Euler and Hamilton Paths18
-
10.6 Shortest-Path Problems7
-
10.7 Planar Graphs13
-
10.8 Graph Coloring13
-
11.1 Introduction to trees23
-
11.2 Applications of Trees14
-
7.1 An intro to Discrete Probability7
-
7.2 Probability theory25
-
7.3 Baye's theorem7
-
7.4 Expected Value and Variance19
-
11.3 Tree traversal0
