Midterm exam2 for Discrete Math
Topics for Midterm Exam 2
Midterm Exam 2 covers the material that we learned from Chapters 4, 6, and 7 of the textbook. This includes Sections 4.1-4.6, 6.1-6.2, 6.7-6.9, and 7.1-7.3.
Topics from Chapter 4:
- Functions: domain, target, range
- Arrow diagrams
- Floor and ceiling functions
- Injective, surjective, and bijective functions
- Inverses of functions
- Composition of functions
- Logarithms and exponents (but mainly logarithms)
Topics from Chapter 6:
- Binary relations on a set
- Examples of binary relations on graphs and trees
- Representing binary relations with arrow diagrams and matrices
- Properties of binary relations: reflexive, anti-reflexive, neither; symmetric, anti-symmetric, neither; transitive or not
- Order relations: partial vs. total, strict vs. non-strict
- Equivalence relations and equivalence classes
- Proving that a relation is (or is not) an order relation or an equivalence relation
Topics from Chapter 7:
- Asymptotic growth: f is O(g), f is Ω(g), f is Θ(g)
- Given a complicated function f, finding a simple function g for which f is Θ(g)
- Proving that f is or is not O(g)
- Proving that f is or is not Ω(g)
- Growth hierarchy of functions (e.g. 1.3n = Ω(n5))
- Computing asymptotic time complexity of algorithms, including algorithms with nested loops
Comments
Post a Comment