暨南大学离散数学dmathI-final-example.pdfVIP

Section I: Proofs 3 1. Show that if n is an integer and n +5 is odd, then n is even using a) a proof by contraposition. b) a proof by contradiction. Section II: Drawing/Calculation ̅ ̅ ̅̅̅ 1. Draw the Venn diagrams for the combination of the sets A, B, C : A ∪ (B ∩C) Section III: True/False 1. (A8E) = ( 101010001101 ) . 16 2 2. x R(x) ∨S(x) is means: x (R(x) ∨S(x )) 3. (¬p ∧(p ∨q))→q is a tautology. Section IV: Completion 1. An algorithm is called if it solves a problem by reducing it to an instance of the same problem with smaller input 2. Among 256 people there are at least who were born in the same month. Section V: Choices ( ) 1. Which is not one of the properties that algorithms generally share? A ．Definiteness B ．Finiteness C ．Generality D ．Comparability ( ) 2. Supposef: R→R has the rule and suppose g:R→R has the rule . Find A) 1 B) -1 C) 0 D) none of these.