Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    234094.97.106 17YBS304 - Discrete Mathematics and Logic

    Uploaded by

    Keshav Kumar

    Copyright:

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

    234094.97.106 17YBS304 - Discrete Mathematics and Logic

    Uploaded by

    Keshav Kumar
    24 views4 pages

    Original Title

    234094.97.106 17YBS304– Discrete Mathematics and Logic

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    234094.97.106 17YBS304 - Discrete Mathematics and Logic

    Uploaded by

    Keshav Kumar

    Copyright:

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

    Sr.

    No: 234094/97/106

    PRN

    DEGREE EXAMINATION, MAY 2023


    (Regulations 2017)

    17YBS304 – DISCRETE MATHEMATICS AND LOGIC

    Time: Three Hours Maximum Marks: 100

    Instructions to the candidate:


     Figures to the right indicate full marks.
     Usage of non-programmable calculator is permitted.
     Draw neat sketches and diagram wherever is necessary.
     Part C is compulsory.
    ___________________________________________________________
    PART A - (10 x 2 = 20 Marks)
    Answer All Questions

    1. List the different types of set. (2) K1 CO1

    2. Define proper subset, power set, and subset. (2) K3 CO1

    3. Construct the truth table for p -> ~ (p˅ q). (2) K2 CO2

    4. If p: A circle is a conic, q: 5 is a real number, r: (2) K1 CO2

    Exponential series is convergent. Express the


    compound propositions p→(q⋁ r), p ∧ (∼ q) in
    words.
    5. Define sub graph and multi graph. (2) K2 CO3

    6. Define chain and anti-chain (2) K2 CO3

    7. Define graph and tree. (2) K2 CO4

    8. Define the cut sets. (2) K1 CO4

    9. Define Lattice. (2) K4 CO5

    10. Define Tree (2) K1 CO5

    Page 1 of 4
    PART B - (4 x 15 = 60 Marks)

    11. (a) (i) Explain the different operations on set with (8) K1 CO1

    the suitable example and venn diagram.


    (ii) Prove the following preposition using (7) K2 CO1

    mathematical induction.
    P(n)= 1+4+7+…..+(3n-2)=n(3n-1)/2
    (OR)
    (b) (i) Explain the principle of Inclusion and (8) K3 CO1

    Exclusion using venn diagram.


    (ii) Let A={a,b,c,d} and R={(a,d), (b,a), (b,d), (7) K2 CO1

    (c,b), (c,d),(d,c)}. Find the transitive closure


    of R by warshall’s algorithm.

    12. (a) (i) Among 100 students , 32 study Maths , 20 (8) K1 CO2

    study physics , 45 study biology , 15 study


    Maths and biology ,7 study Maths and
    physics, 10 study physics and biology , 30
    do not study any of the three subjects,
    1) Find the number of students studying
    all the three subjects.
    2) Find the number of students studying
    exactly one of the three subjects.
    (ii) If X= {4,6,8,10, 12} and R= {(x ,y) /x<y} (7) K4 CO2

    Draw the graph of ‘R’ and also give its


    matrix.
    (OR)

    Page 2 of 4
    (b) (i) Let A={1,2,3,4} and R={(1,1),(1,2),(2,2),(2,4) (8) K1 CO2

    ,(1,3),(3,3),(3,4),(1,4),(4,4)}. Show that R is a


    partial order relation and draw its Hasse
    diagram.. Determine chain and anti chain.
    (ii) Let A={1,2,3,4} and R={(1,2), (2,1), (2,3), (7) K1 CO2

    (3,4)}. Find the transitive closure of R by


    wars hall’s algorithm.

    13. (a) (i) Draw the Hasse diagram representing the (8) K2 CO3

    positive divisors of 36.


    (ii) Write a short note on functions. (7) K1 CO3

    (OR)
    (b) (i) Write a short note on : (8) K3 CO3

    1) Spanning Tree
    2) Representation of graph
    (ii) Explain the Isomorphism and (7) K2 CO3

    automorphism graph in details.

    14. (a) (i) Explain the different tree traversal in (8) K2 CO4

    details with suitable example.


    (ii) Draw the binary search tree for input data (7) K4 CO4

    200,100,300,50,150,250,400.10,75,125,17
    5 write a root , leaf node.
    (OR)
    (b) (i) Explain the Prim’s algorithm to find out the (8) K4 CO4

    minimum spanning tree with suitable


    example.

    Page 3 of 4
    (ii) Explain the prefix code in detail. (7) K1 CO4

    PART C – Compulsory (1 x 20 = 20 Marks)

    15. (i) Let g be the set of all non zero real numbers (10) K1 CO5

    and let a*b=ab/2. Show that (G,*) is an


    abelian group.
    (ii) Explain the binary operations in detail. (10) K1 CO5

    Page 4 of 4

    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