Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Gujarat Technological University

    Uploaded by

    Om Patel Patel
    This document appears to be an exam for a Discrete Mathematics course, consisting of 5 questions worth a total of 70 marks. Question 1 covers definitions related to discrete structures like functions, relations, and graphs. Question 2 involves quantifiers, logic, and relations. Question 3 covers partially ordered sets, lattices, and recurrence relations. Question 4 is about groups, subgroups, and cosets. Question 5 asks about graph theory concepts like isomorphic graphs, shortest paths, and binary prefix codes.

    Copyright:

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

    Gujarat Technological University

    Uploaded by

    Om Patel Patel
    22 views2 pages
    This document appears to be an exam for a Discrete Mathematics course, consisting of 5 questions worth a total of 70 marks. Question 1 covers definitions related to discrete structures like functions, relations, and graphs. Question 2 involves quantifiers, logic, and relations. Question 3 covers partially ordered sets, lattices, and recurrence relations. Question 4 is about groups, subgroups, and cosets. Question 5 asks about graph theory concepts like isomorphic graphs, shortest paths, and binary prefix codes.

    Original Description:

    2nd documents

    Original Title

    3140708 (3)

    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 an exam for a Discrete Mathematics course, consisting of 5 questions worth a total of 70 marks. Question 1 covers definitions related to discrete structures like functions, relations, and graphs. Question 2 involves quantifiers, logic, and relations. Question 3 covers partially ordered sets, lattices, and recurrence relations. Question 4 is about groups, subgroups, and cosets. Question 5 asks about graph theory concepts like isomorphic graphs, shortest paths, and binary prefix codes.

    Copyright:

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

    Gujarat Technological University

    Uploaded by

    Om Patel Patel
    This document appears to be an exam for a Discrete Mathematics course, consisting of 5 questions worth a total of 70 marks. Question 1 covers definitions related to discrete structures like functions, relations, and graphs. Question 2 involves quantifiers, logic, and relations. Question 3 covers partially ordered sets, lattices, and recurrence relations. Question 4 is about groups, subgroups, and cosets. Question 5 asks about graph theory concepts like isomorphic graphs, shortest paths, and binary prefix codes.

    Copyright:

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

    Seat No.: ________ Enrolment No.

    ___________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    BE - SEMESTER–IV (NEW) EXAMINATION – SUMMER 2021
    Subject Code:3140708 Date:07/09/2021
    Subject Name:Discrete Mathematics
    Time:02:30 PM TO 05:00 PM Total Marks: 70
    Instructions:
    1. Attempt all questions.
    2. Make suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.
    4. Simple and non-programmable scientific calculators are allowed.
    MARKS
    Q.1 (a) Among 100 people at least how many of them were born in the same 03
    month?
    (b) Prove that: (𝐴 ∪ 𝐵)′ ≡ 𝐴′ ∩ 𝐵 ′ . 04
    (c) Define the following: 07
    1) Composition of functions
    2) Monoid
    3) Existential Quantifier
    4) Partially Ordered Set
    5) Boolean Algebra
    6) Tree
    7) Complete Graph

    Q.2 (a) Explain types of a Relation with a suitable example. 03


    (b) Rewrite the following statements using quantifier variables and 04
    predicate symbols:
    1) All birds can fly.
    2) Some women are genius.
    3) There is a student who likes Discrete Mathematics but not Probability
    and Statistics.
    4) Each integer is either even or odd.
    (c) Determine the validity of the argument given: 07
    If I study, then I will not fail in Discrete Mathematics.
    If I do not play cricket, then I will study.
    But I failed in Discrete Mathematics.
    ----------------------------------------------------------
    Therefore I must have played cricket.
    OR
    (c) Find if the following is a tautology, contradiction or contingency. 07
    (𝑝 → (𝑞 → 𝑟)) → ((𝑝 → 𝑞) → (𝑝 → 𝑟))
    Q.3 (a) Define: Bounded, Distributive and Complemented Lattices. 03
    (b) Find the transitive closure of 04
    𝑅 = {(1,2), (3,4), (4,5), (4,1), (1,1)}. Where, 𝐴 = {1,2,3,4,5}.
    (c) Let 𝐴 be a set of factors of positive integer 𝑚 and relation is divisibility 07
    on 𝐴.
    For 𝑚 = 45, show that POSET (𝐴, ≤) is a Lattice.
    OR
    Q.3 (a) Draw the Hasse diagram of the set {1,3,9,18} under partial order relation 03
    ‘divides’ and indicate those which are chains.
    (b) Let 𝑋 = {1,2,3, … ,7} and 𝑅 = {(𝑥, 𝑦): 𝑥 − 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑏𝑙𝑒 𝑏𝑦 3}. Show 04
    that 𝑅 is an equivalence relation. Draw the graph of 𝑅.

    1
    (c) Solve the recurrence relation: 07
    𝑎𝑛+2 − 5𝑎𝑛+1 + 6𝑎𝑛 = 2.
    Q.4 (a) Define group with example. Give an example of a non-abelian group. 03
    (b) Let 𝐻 = {[0], [3]} in 𝑍6 under addition. Find left and right cosets in < 04
    𝑍6 , +6 >.
    (c) Prove that 𝐺 = {1,2,3,4,5,6} is a finite abelian group of order 6 with 07
    respect to multiplication modulo 7.
    OR
    Q.4 (a) Define subgroup and group Homomorphism. 03
    (b) Is addition a binary operation on {-1,0,1}? Justify. 04
    (c) Explain Cosets and Lagrange’s theorem. 07
    Q.5 (a) How many nodes are necessary to construct a graph with exactly 8 edges 03
    in which each node is of degree 2.
    (b) Find the shortest path between each pair of vertices for a simple digraph 04
    using Warshall’s Algorithm.

    (c) Define Isomorphic Graphs. Verify the following graphs are Isomorphic 07
    or not (Justify).

    OR
    Q.5 (a) Define Cyclic graph, Null graph and Strongly connected graph. 03
    (b) Draw a graph which is regular but not bipartite. 04
    (c) For the following set of weights construct an optimal binary prefix code. 07
    For each weight in the set, give corresponding code word.
    5, 7, 8, 15, 35, 40

    *************

    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