Scribd Logo
Upload

Welcome to Scribd!

  • 47 views

    Axiom: Course Title: Discrete Mathematics

    Uploaded by

    hammo
    This document appears to be a final exam for a discrete mathematics course covering topics like sets, relations, functions, proofs, and number theory. It contains 7 questions testing knowledge of concepts like axioms, theorems, proofs by contradiction and induction, properties of relations, subsets and power sets, and proving statements about odd and even numbers. The exam is out of 50 total marks and covers chapters 5 through 10 and 12 through 13 of the course material.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Axiom: Course Title: Discrete Mathematics

    Uploaded by

    hammo
    47 views4 pages
    This document appears to be a final exam for a discrete mathematics course covering topics like sets, relations, functions, proofs, and number theory. It contains 7 questions testing knowledge of concepts like axioms, theorems, proofs by contradiction and induction, properties of relations, subsets and power sets, and proving statements about odd and even numbers. The exam is out of 50 total marks and covers chapters 5 through 10 and 12 through 13 of the course material.

    Original Title

    SWEN_2308_22017_f.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document appears to be a final exam for a discrete mathematics course covering topics like sets, relations, functions, proofs, and number theory. It contains 7 questions testing knowledge of concepts like axioms, theorems, proofs by contradiction and induction, properties of relations, subsets and power sets, and proving statements about odd and even numbers. The exam is out of 50 total marks and covers chapters 5 through 10 and 12 through 13 of the course material.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    47 views4 pages

    Axiom: Course Title: Discrete Mathematics

    Uploaded by

    hammo
    This document appears to be a final exam for a discrete mathematics course covering topics like sets, relations, functions, proofs, and number theory. It contains 7 questions testing knowledge of concepts like axioms, theorems, proofs by contradiction and induction, properties of relations, subsets and power sets, and proving statements about odd and even numbers. The exam is out of 50 total marks and covers chapters 5 through 10 and 12 through 13 of the course material.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 4

    Course No: TECH 1301 University of Palestine Dr.

    Naji Shukri Alzaza


    Course Title: Discrete Mathematics Department Software Engineering
    Faculty of Applied Engineering &
    Date: Wednesday 30/05/2018 Urban Planning
    No. of Questions: (7)
    Time: 2 Hours Student Name: _______________
    Final Exam
    Total Grade: ( 50 ) Marks nd
    2 Semester 2017/2018 Student No.: ________________
    CH 05-10 + 12-13
    ANSWER ALL QUESTIONS
    QUESTION 1: identify the proper term for each statement/definition: (14 Marks)
    1. ____________________ any mathematical statement that serves as a starting point from which other
    statements are logically derived. However, it not need be proved.
    axiom
    2. _____________________ a general proposition not self-evident but proved by a chain of reasoning;
    a truth established by means of accepted truths.
    theorem
    3. ______________________ is a valid argument in which the theorem is the conclusion.
    proof
    4. ______________________ is a mathematical proof technique, most commonly used to establish a given
    statement for all natural numbers. It can be used to prove statements about any well-ordered set.
    Mathematical induction
    5. Let A and B be two sets. A _____________________ f from A to B, written f : A → B, is a rule which
    associates to each a ∈ A a unique element f (a) ∈ B.
    function
    6. In an _______________ function no two elements of the domain have the same image in the co-domain.
    injective

    7. Given any set A, the set consisting of all subsets of A is called the ______________________.
    power set of A
    QUESTION 2: Let A = {a, b, c, d} and a R a is R = {(a, a), (a, b), (a, c), (b, a), (b, b), (b, c),(b, d), (d, d)}.
    check and identify R satisfy reflexive, symmetric, anti-symmetric, or transitive. (4 Marks)

    R is not reflexive since c R c; therefore it is not true that x R x for every x ∈ A;


    R is not symmetric since, for example, a R c but c R a;
    R is not anti-symmetric since a R b and b R a but a ≠ b;
    R is not transitive since a R b and b R d but a R d.

    1/4
    QUESTION 3: Prove that the sum of two consecutive integers is odd. (4 Marks)
    Suppose x and y are consecutive integers with x < y. Then
    y=x+1
    ⇒x+y=x+x+1
    ⇒ = 2x + 1
    x + y is odd.

    QUESTION 4: Name the proper methods of mathematical proofs as shown in the table below. (8 Marks)

    Method of proof Assume Deduce


    P; background knowledge Q
    Direct proof of P → Q

    -Q; background knowledge -P


    Proof of P → Q using the contrapositive

    -P; background knowledge A contradiction, f


    Proof of P by contradiction

    (a) P; background knowledge Q


    Proof of the biconditional P ↔ Q and
    (b) Q; background knowledge P

    2/4
    QUESTION 5: Check and identify the properties of relations for the following directed graph of a relation
    R on the set A = {a, b, c, d, e}. (8 Marks)

    a
    b
    e

    c d
    From this diagram we can see that:
    (i) R is not reflexive, since there is no arrow from c to itself, for example.
    (ii) R is symmetric, but not anti-symmetric, since every arrow connecting distinct points is bidirectional.
    (iii) R is not transitive since there are arrows from a to d, and from d to b, but not from a to b.

    QUESTION 6: Let A ={1, 2,3} and B = {1,2}. Determine True or False for the following: (8 Marks)

    1. ∅ ⊆ 𝒫 (A) T 2. ∅ ∈ 𝒫 (A) T

    3. { {1}, B } ⊆ 𝒫 (A) T 4. B ⊆ 𝒫 (A) F

    5. A ⊆ 𝒫 (A) F 6. A ∈ 𝒫 (A) T

    7. B ∈ A F 8. B ∈ 𝒫 (A) T

    3/4
    QUESTION 7: Prove by Contradiction, if 3n+2 is odd, then n is odd. (4 Marks)

    ==================== BEST WISHES ====================

    4/4

    You might also like