Discrete Final Study Guide - b n), where b > 1 p...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
~~P e Morgan’s Theorem (DeM) Q (~P v ~Q) ⋅ ≡ v Q (~P ~Q) ≡ ⋅ o mmutation (Com) v Q Q v P Q Q P ≡ ⋅ aterial Conditional (Cond) Q (~P v Q) aterial Biconditional (Bicond) Q) [P Q Q P] ≡ ≡ ⊃ ⋅ ⊃ Q) [P Q v ~P Q] ≡ ≡ ⋅ Hypothetical syllogism (HS) P Q Q R P R Disjunctive Syllogism (DS) P v Q ~P Q Addition (Add) P P v Q Simplification (Simp) P v Q P Conjunction (Conj) P Q PQ ll reals bers } |S|= 3 y (size) P(S)| = 2 |S| , ‘0’, ‘1’, ’01’} B= { a, b} A x B = {(1,a), (1,b), (2,a), (2,b)} Product ent in A is also in B (A A & ⊆ ) ϕ A n either A or B, or both n both A and B in A but not in B erything in the universe except A nt ogn) g arithmic complexity n ) ear complexity n logn) g n complexity n b) ynomial complexity
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b n), where b > 1 p onential complexity n !) torial complexity Arithmetic Sum Geometric Sum (r 1) =1ni = n+1n2 =0narj=a1-rn+11-r Growth of Functions O (O) er Bound Cgx whenever x>k e ga ( ) er Bound Cgx whenever x>k a ( ) t Bound s Ogx and fxis (gx) n ts / Combinations (order doesnt matter) ! =0 or j=k;j k 0Bj-1,k-1+Bj-1,k else of ways things can be arranged, order matters) in Reverse Order n Order ends on increments ist in Order ends on Pivots erfect Shuffle ny List ny List n y List n y List h h Math 224 Final Exam Cheat Sheet Math 224 Final Exam Cheat Sheet Math 224 Final Exam Cheat Sheet...
View Full Document

Page1 / 3

Discrete Final Study Guide - b n), where b > 1 p...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online