Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    March-2022

    Uploaded by

    Vishal Goud

    Copyright:

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

    March-2022

    Uploaded by

    Vishal Goud
    2 views1 page

    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
    2 views1 page

    March-2022

    Uploaded by

    Vishal Goud

    Copyright:

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

    Code No: 153CF R18

    JN
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
    B. Tech II Year I Semester Examinations, March - 2022
    DISCRETE MATHEMATICS
    (Common to CSE(AIML), CSE(DS), CSE(IOT))
    TU
    Time: 3 Hours Max. Marks: 75
    Answer any five questions
    All questions carry equal marks
    ---
    H
    1. Obtain the PDNF and PCNF of the following statement formula: (┐P V ┐Q) → (P ↔ Q).
    [15]
    U
    2.a) Show that (  x) (p(x) Λ (Q(x)  (  x) (p(x) Λ  (x) Q(x).
    se
    b) Symbolize the following argument and check for its validity:
    All men are giants.
    Not all birds can fly.
    dp
    Some babies are illogical.
    There is a student who likes maths, but not history. [7+8]

    3.a) Use a Venn diagram to illustrate the relationships A ⊂ B and A ⊂ C.


    ap
    b) Prove that the relation “congruence modulom” given by
    R={<x,y> / x-y is divisible by m} over
    the set of positive integers is an equivalence relation. [6+9]
    er
    4.a) Give the definition and examples of reflexive symmetric, anti symmetric and transitive
    relations.
    s
    b) What is meant by Poset? Draw the Hasse diagram for the Poset.
    <{2,4,5,10,12,20,25}/> and compute LUB and GLB. [7+8]
    M
    5.a) Conjecture a formula for the sum of the first n positive odd integers. Then prove your
    Conjecture using mathematical induction.
    ar
    b) Express the linear search algorithm as a recursive procedure and explain. [8+7]

    Prove that 2 divides n2+n whenever n is a positive integer, using mathematical


    c
    6.a)
    induction.
    h
    b) Give a recursive algorithm to compute the factorial of a number and explain. [8+7]

    7. Solve the recurrence relation an−7an−1+10an−2 = 0 where a0=10 and a1= 41. [15]
    20
    8.a) Find the degree sequence of k4 graph.
    b) What are the various ways of representing graphs? Explain them briefly with relevant
    22
    examples. [6+9]

    ---ooOoo---

    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