14-Mathematical Induction & Recursive Algorithms

# 14-Mathematical Induction & Recursive Algorithms - EECS...

• Notes
• 47

This preview shows pages 1–9. Sign up to view the full content.

Mathematical Induction & Recursive Algorithms David O. Johnson EECS 210 (Fall 2016) 1 EECS 210 Discrete Structures David O. Johnson Fall 2016

This preview has intentionally blurred sections. Sign up to view the full version.

Reminders Exam 2: Thursday, October 20 More later Homework 4 due: Thursday, October 27 before your lecture Mathematical Induction & Recursive Algorithms David O. Johnson EECS 210 (Fall 2016) 2
Any Questions? Mathematical Induction & Recursive Algorithms 3 David O. Johnson EECS 210 (Fall 2016)

This preview has intentionally blurred sections. Sign up to view the full version.

Exam 2 Review 10% of your grade. Open book, open note, i.e., anything from the lectures or discussion groups plus any notes you have taken. You may use a laptop or phone to view your notes, slides, supplementary material, and e-book only. Remember: When defining sets, use {}, set builder notation, or capital letters to represent important sets (e.g., Z , ). Probably a little harder than Exam 1. Find the truth set for predicates where the domain is the set of integers (Section 2.1): 6 points Calculate the union, intersection, and difference of sets (Section 2.2): 8 points Calculate the composite of two relations (Section 9.1): 8 points Determine whether relations are reflexive, symmetric, antisymmetric, or transitive (Section 9.1): 8 points Draw a directed graph of a relation (Section 9.3): 8 points Find the transitive closures of a relation in the form of a zero-one matrix (Section 9.4): 8 points Mathematical Induction & Recursive Algorithms David O. Johnson EECS 210 (Fall 2016) 4
Exam 2 Review Determine whether or not relations represented by zero–one matrices are equivalence relations and why, e.g., it is not reflexive (Section 9.5): 6 points Find maximal elements, minimal elements, least element, greatest element, greatest lower bound, and least upper bound of a poset and subsets of the poset represented by a Hasse diagram (Section 9.6): 6 points Find the composite of two functions (Section 2.3): 8 points Find the value of sums, i.e., ∑ (Section 2.4): 8 points Given a sub-optimal greedy algorithm, show how it would not always produce an optimum solution (Section 3.1): 7 points Give a big-O estimate for a function (Section 3.2, Exercises 25 and 27): 6 points Give a big-O estimate for the number additions used in an algorithm (Section 3.3): 7 points Use mathematical induction to prove a statement P( n ) is true whenever n is a positive integer (Section 5.1): 6 points Mathematical Induction & Recursive Algorithms David O. Johnson EECS 210 (Fall 2016) 5

This preview has intentionally blurred sections. Sign up to view the full version.

Any Questions? Mathematical Induction & Recursive Algorithms 6 David O. Johnson EECS 210 (Fall 2016)
Strong Induction and Well-Ordering (Section 5.2) Strong Induction Example Proof using Strong Induction Well-Ordering Property Example Proof using Well-Ordering Property Mathematical Induction & Recursive Algorithms 7 David O. Johnson EECS 210 (Fall 2016)

This preview has intentionally blurred sections. Sign up to view the full version.

Strong Induction Last time, we discussed mathematical induction (Section 5.1) and showed how to use it to prove a variety of theorems.
This is the end of the preview. Sign up to access the rest of the document.
• Fall '12
• kato
• Mathematical Induction, Natural number, David O. Johnson EECS, O. Johnson EECS, David O. Johnson

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern