# Analysis of Algorithms 2.1

Home > Preview

The flashcards below were created by user eaavendano on FreezingBlue Flashcards.

1. Inductive Reasoning
Drawing a conclusion based on experience.
2. Deductive Reasoning
To verify the truth of falsity of a conjecture.
3. Counterexample
To disprove a conjecture, such as "P implies Q" where in this case P is True but Q is False.
4. Factorial
The products of 1 up to and including a given integer.
5. Proof by Exhaustion
A situation in which all possible cases have been exhausted.
6. Direct Proof
In a conjecture such as "P implies Q," assume the hypotheses P and deduce the conclusion Q.
7. Even Number
A number that is an integral multiple of 2.
8. Odd Number
A number 1 more than an integral multiple of 2.
9. Contrapositive
In a conjecture such as "P implies Q," would be "not Q implies not P."
10. Proof by Contraposition
To prove a conjecture in the form of "P implies Q" by doing a direct proof of "not Q implies not P."
11. Proof by Cases
A form of exhaustive proof.

### Card Set Information

 Author: eaavendano ID: 121773 Filename: Analysis of Algorithms 2.1 Updated: 2011-12-08 06:06:08 Tags: proof techniques Folders: Description: Proof Techniques Show Answers:

Home > Flashcards > Print Preview