Scribd Logo
Upload

Welcome to Scribd!

  • 73 views

    Assignment # 04: Discrete Structures Husnain Haider Deadline: Friday, 04 Feb 2022

    Uploaded by

    SAYYAM SHAHID
    The document contains 6 problems regarding discrete structures: 1) Writing negations of conditional statements. 2) Writing converses and contrapositives of conditional statements. 3) Constructing truth tables for compound propositions. 4) Analyzing statements from 3 suspects to determine the murderer using logic. 5) Solving a logic puzzle about knights and knaves on an island. 6) Using quantifiers and predicates to represent statements, and rewriting statements with negations only in predicates.

    Copyright:

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

    Assignment # 04: Discrete Structures Husnain Haider Deadline: Friday, 04 Feb 2022

    Uploaded by

    SAYYAM SHAHID
    73 views2 pages
    The document contains 6 problems regarding discrete structures: 1) Writing negations of conditional statements. 2) Writing converses and contrapositives of conditional statements. 3) Constructing truth tables for compound propositions. 4) Analyzing statements from 3 suspects to determine the murderer using logic. 5) Solving a logic puzzle about knights and knaves on an island. 6) Using quantifiers and predicates to represent statements, and rewriting statements with negations only in predicates.

    Original Description:

    Discrete Structure

    Original Title

    Assignment 04

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 6 problems regarding discrete structures: 1) Writing negations of conditional statements. 2) Writing converses and contrapositives of conditional statements. 3) Constructing truth tables for compound propositions. 4) Analyzing statements from 3 suspects to determine the murderer using logic. 5) Solving a logic puzzle about knights and knaves on an island. 6) Using quantifiers and predicates to represent statements, and rewriting statements with negations only in predicates.

    Copyright:

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

    Assignment # 04: Discrete Structures Husnain Haider Deadline: Friday, 04 Feb 2022

    Uploaded by

    SAYYAM SHAHID
    The document contains 6 problems regarding discrete structures: 1) Writing negations of conditional statements. 2) Writing converses and contrapositives of conditional statements. 3) Constructing truth tables for compound propositions. 4) Analyzing statements from 3 suspects to determine the murderer using logic. 5) Solving a logic puzzle about knights and knaves on an island. 6) Using quantifiers and predicates to represent statements, and rewriting statements with negations only in predicates.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Discrete Structures Husnain Haider

    Deadline: Friday, 04 Feb 2022

    Assignment # 04

    Problem 1
    Write NEGATION of the following statements (Careful, NEGATION is not the same as INVERSE)
    a) If P is a square, then P is a rectangle.
    b) If n is prime, then n is odd or n is 2.
    c) If Aangloo is Meena's father, then Baangloo is her uncle and Bingli is her Aunt.
    d) A positive integer is prime only if it has no divisors other than 1 and itself.
    e) Being divisible by 3 is a necessary condition for this number to be divisible by 9.
    Problem 2
    Part 1: Write CONVERSE of the following statements.
    a) If P is a square, then P is a rectangle.
    b) If n is prime, then n is odd or n is 2.
    c) If Aangloo is Meena's father, then Baangloo is her uncle and Bingli is her Aunt.
    d) A positive integer is prime only if it has no divisors other than 1 and itself.
    e) Being divisible by 3 is a necessary condition for this number to be divisible by 9.

    Part 2: Write CONTRPOSITIVE of the following statements.

    a) If P is a square, then P is a rectangle.


    b) If n is prime, then n is odd or n is 2.
    c) If Aangloo is Meena's father, then Baangloo is her uncle and Bingli is her Aunt.
    d) A positive integer is prime only if it has no divisors other than 1 and itself.
    e) Being divisible by 3 is a necessary condition for this number to be divisible by 9.
    Part 3: Construct a truth table for each of these compound propositions.

    Problem 3

    Problem 4
    The police have three suspects for the murder of Janab Chaudary AllahDitta (Ch AD): Mr Chaloosak, Mr Maloosak and Mr
    Kabacha.
    Chaloosak, Maloosak and Kabacha each declare that they did not kill Ch AD.
    Chaloosak also states that Ch AD was a friend of Maloosak and that Kabacha disliked him.
    Maloosak also states that he did not know Ch AD and that he was out of town the day Ch AD was killed.
    Kabacha also states that he saw both Chaloosak and Maloosak with Ch AD the day of the killing and that either
    Chaloosak or Maloosak must have killed him.
    Can you determine who the murderer was if we know that:

    a) One of the three men was guilty, the two innocent men are telling the truth, but the statement of guilty man may or may
    not be true?

    b) Innocent men do not lie?


    Hint: Translate the statements into logical expressions and reasoning from these expressions using the truth tables.

    Problem 5 - (Puzzle of Knights and Knaves)


    In an island, there live two types of people: KNIGHTS, who always tell the truth, and KNAVES, who always lie.
    You visit the island and meet a group of six natives, who speak to you as follows:
    U says: None of us is a knight.
    V says: At least three of us are knights.
    W says: At most three of us are knights.
    X says: Exactly five of us are knights.
    Y says: Exactly two of us are knights.
    Z says: Exactly one of us is a knight.
    Which are knights and which are knave?

    Problem 6

    Part 1: Express the following statements using quantifiers, variables, and the predicates, with following information:
    𝐷 is set of all students
    𝑀(𝑠): 𝑠 is a math major student
    𝐶(𝑠): 𝑠 is a computer science major student
    𝐸(𝑠): 𝑠 is an engineering major student
    a) There is an engineering student who is a math major.
    b) Every computer science student is an engineering student.
    c) No computer science students are engineering student.
    d) Some computer science students are also math majors.
    e) Some computer science students are engineering students and some are not.
    Part 2: Translate each of these nested quantifications into an English statement that expresses a mathematical fact. The domain
    in each case consists of all real numbers.
    a) ∃𝑥 ∀𝑦 (𝑥𝑦 = 𝑦)
    b) ∀𝑥 ∀𝑦 ( ( (𝑥 < 0) ∧ (𝑦 < 0) ) → (𝑥𝑦 > 0) )
    c) ∃𝑥 ∃𝑦 ( (𝑥2 > 𝑦) ∧ (𝑥 < 𝑦) )
    d) ∀𝑥 ∀𝑦 ∃𝑧 (𝑥 + 𝑦 = 𝑧)

    Part 3: Rewrite each of these statements so that negations appear only within predicates (that is, so that no negation is outside a
    quantifier or an expression involving logical connectives).
    a) ￢∃𝑦 ∃𝑥 𝑃(𝑥, 𝑦)
    b) ￢∀𝑥 ∃𝑦 𝑃(𝑥, 𝑦)
    c) ￢∃𝑦 ( 𝑄(𝑦) ∧ ∀𝑥￢𝑅(𝑥, 𝑦) )
    d) ￢∃𝑦 ( ∃𝑥 𝑅(𝑥, 𝑦) ∨ ∀𝑥 𝑆(𝑥, 𝑦) )
    e) ￢∃𝑦 (∀𝑥 ∃𝑧 𝑇 (𝑥, 𝑦, 𝑧) ∨ ∃𝑥 ∀𝑧 𝑈(𝑥, 𝑦, 𝑧) )

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy