Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 28 views

    Bachelor of Computer Application (B.C.A.) Semester-II (C.B.S.) Examination Discrete Mathematics-Ii Paper-IV

    Uploaded by

    Anmol
    This document contains a discrete mathematics exam with 5 questions covering topics like: 1) Sets, relations, and proofs involving sets and relations. 2) The pigeonhole principle, mathematical induction, and using induction to prove identities. 3) Group theory concepts like homomorphisms, kernels of functions, and properties of isomorphisms. 4) Graph theory definitions and proofs involving connected graphs, Euler paths, and Hamiltonian circuits. 5) Short questions on equivalence classes, permutations, groups vs semigroups, and tree definitions.

    Copyright:

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

    Bachelor of Computer Application (B.C.A.) Semester-II (C.B.S.) Examination Discrete Mathematics-Ii Paper-IV

    Uploaded by

    Anmol
    28 views3 pages
    This document contains a discrete mathematics exam with 5 questions covering topics like: 1) Sets, relations, and proofs involving sets and relations. 2) The pigeonhole principle, mathematical induction, and using induction to prove identities. 3) Group theory concepts like homomorphisms, kernels of functions, and properties of isomorphisms. 4) Graph theory definitions and proofs involving connected graphs, Euler paths, and Hamiltonian circuits. 5) Short questions on equivalence classes, permutations, groups vs semigroups, and tree definitions.

    Original Description:

    Yg v

    Original Title

    3(1)

    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 contains a discrete mathematics exam with 5 questions covering topics like: 1) Sets, relations, and proofs involving sets and relations. 2) The pigeonhole principle, mathematical induction, and using induction to prove identities. 3) Group theory concepts like homomorphisms, kernels of functions, and properties of isomorphisms. 4) Graph theory definitions and proofs involving connected graphs, Euler paths, and Hamiltonian circuits. 5) Short questions on equivalence classes, permutations, groups vs semigroups, and tree definitions.

    Copyright:

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

    Bachelor of Computer Application (B.C.A.) Semester-II (C.B.S.) Examination Discrete Mathematics-Ii Paper-IV

    Uploaded by

    Anmol
    This document contains a discrete mathematics exam with 5 questions covering topics like: 1) Sets, relations, and proofs involving sets and relations. 2) The pigeonhole principle, mathematical induction, and using induction to prove identities. 3) Group theory concepts like homomorphisms, kernels of functions, and properties of isomorphisms. 4) Graph theory definitions and proofs involving connected graphs, Euler paths, and Hamiltonian circuits. 5) Short questions on equivalence classes, permutations, groups vs semigroups, and tree definitions.

    Copyright:

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

    NKT/KS/17/5255

    Bachelor of Computer Application (B.C.A.) Semester—II (C.B.S.) Examination


    DISCRETE MATHEMATICS–II
    Paper–IV
    Time : Three Hours] [Maximum Marks : 50
    N.B. :— (1) ALL questions are compulsory and carry equal marks.
    (2) Draw neat and labelled diagram wherever necessary.
    EITHER
    1. (A) Explain the operation of set and its types with examples. 5
    (B) Prove that A – (A ∩ B) = A – B for the sets A and B. 5
    OR
    (C) Let A = {1, 2, 3, 4} and R is relation statement R = {(x, y)/ x > y} find MR and draw diagram.
    5
    (D) If A = {1, 2, 3, 4}
    R = {(1, 1), (1, 2), (2, 3), (2, 4), (3, 4), (4, 1), (4, 2)}.
    Find RR and R∞ . 5
    EITHER
    2. (A) State and prove the pigeonhole principle with example. 5

    5 n (n + 1)
    (B) Prove by Mathematical induction p(n) = 5 + 10 + 15 + ........ + 5n = . 5
    2
    OR
    (C) Let A1 , A2 ,....., An be any n sets. Show by Mathematical induction that :

    n n

    I
    i=1
    Ai = UA
    i =1
    i 5

    (D) Find sequence defined by the recurrence relation :


    cn = 4 cn – 1 + 5 cn – 2
    c1 = 2 & c2 = 6 5

    NXO—20512 1 (Contd.
    EITHER
    3. (A) If F is homorphism from commutative semigroup (5, *) onto semigroup (T, *) then (T, *–1 ) is also
    commutative. 5
    (B) Show that in a Boolean Algebra, for any a and b,
    ((a ∨ c) ∧ (b' ∨ c))' = (a' ∨ b) ∧ c'. 5
    OR
    (C) Let f : G → G–1 be a group of homomorphism prove that f is one to one if and only if
    ker (f) = {e}. 5
    (D) Let (S, *) and (T, *) be monoids with identities e and e', respectively. Let f : S → T be an
    isomorphism then prove f(e) = e'. 5

    EITHER

    4. (A) Define :

    (1) Graph

    (2) Subgraph

    (3) Quotient graph

    (4) Connected graph

    (5) Degree of the vertex. 5

    (B) Prove that if G is connected and has exactly two vertices of odd degree, there is an Euler Path
    in G. 5

    OR

    (C) Find the Hamiltonian circuit for the graph given below :
    D 2
    B 6
    3 G

    A
    2 5 6
    C
    E 3
    5 H
    4
    5
    F

    (D) Let L be a lattice, prove that a ∨ (b ∨ c) = (a ∨ b) ∨ c. 5

    NXO—20512 2 NKT/KS/17/5255
    5. Attempt ALL :

    (A) Explain equivalence classes with example. 2½

    (B) Determine, whether the permutation is even or odd :

    A = {1, 2, 3, 4, 5, 6, 7, 8}

    (1) (4, 8) (3, 5, 2, 1) (2, 4, 7, 1)

    (2) (6, 4, 2, 1, 5). 2½

    (C) Explain group and semigroup. 2½

    (D) Explain :

    (1) Trees.

    (2) Labelled trees. 2½

    NXO—20512 3 NKT/KS/17/5255

    You might also like