Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    W2020-3140708-APY Material

    Uploaded by

    tregan Empire
    This document appears to be an exam for a Discrete Mathematics course, consisting of 8 questions worth a total of 56 marks. The questions cover topics like sets, relations, functions, graphs, groups, matrices and logic. Students are instructed to attempt any 4 questions out of the 8 provided. Each question has multiple parts requiring definitions, proofs, calculations and drawings related to discrete mathematical concepts.

    Copyright:

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

    W2020-3140708-APY Material

    Uploaded by

    tregan Empire
    18 views2 pages
    This document appears to be an exam for a Discrete Mathematics course, consisting of 8 questions worth a total of 56 marks. The questions cover topics like sets, relations, functions, graphs, groups, matrices and logic. Students are instructed to attempt any 4 questions out of the 8 provided. Each question has multiple parts requiring definitions, proofs, calculations and drawings related to discrete mathematical concepts.

    Original Description:

    its

    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 8 questions worth a total of 56 marks. The questions cover topics like sets, relations, functions, graphs, groups, matrices and logic. Students are instructed to attempt any 4 questions out of the 8 provided. Each question has multiple parts requiring definitions, proofs, calculations and drawings related to discrete mathematical concepts.

    Copyright:

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

    W2020-3140708-APY Material

    Uploaded by

    tregan Empire
    This document appears to be an exam for a Discrete Mathematics course, consisting of 8 questions worth a total of 56 marks. The questions cover topics like sets, relations, functions, graphs, groups, matrices and logic. Students are instructed to attempt any 4 questions out of the 8 provided. Each question has multiple parts requiring definitions, proofs, calculations and drawings related to discrete mathematical concepts.

    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 – WINTER 2020
    Subject Code:3140708 Date:17/02/2021
    Subject Name:Discrete Mathematics
    Time:02:30 PM TO 04:30 PM Total Marks:56
    Instructions:
    1. Attempt any FOUR questions out of EIGHT questions.
    2. Make suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.

    Marks
    Q.1 (a) Find the power sets of (i)a , (ii)a, b, c. 03
    (b) If f ( x)  2 x, g ( x)  x 2 , h( x)  x  1 then find (fog)oh and fo(goh). 04
    (c) (i) Let N be the set of natural numbers. Let R be a relation in N defined 03
    by xRy if and only if x  3 y  12 . Examine the relation for (i) reflexive
    (ii) symmetric (iii) transitive.
    (ii) Draw the Hasse diagram representing the partial ordering {(a,b)/ a 04
    divides b} on {1,2,3,4,6,8,12}.

    Q.2 (a) Let R be a relation defined in A={1,2,3,5,7,9} as R={(1,1), (1,3), (1,5), 03


    (1,7), (2,2), (3,1), (3,3), (3,5), (3,7), (5,1), (5,3), (5,5), (5,7), (7,1), (7,3),
    (7,5), (7,7), (9,9)}. Find the partitions of A based on the equivalence
    relation R.
    (b) In a box there are 5 black pens, 3 white pens and 4 red pens. In how 04
    many ways can 2 black pens, 2 white pens and 2 red pens can be
    chosen?
    (c) Solve the recurrence relation a n  4a n1  4an2  n  3n using 07
    undetermined coefficient method.

    Q.3 (a) Define self-loop, adjacent vertices and a pendant vertax. 03


    (b) Define tree. Prove that if a graph G has one and only one path between 04
    every pair of vertices then G is a tree.
    (c) (i) Find the number of edges in G if it has 5 vertices each of degree 2. 03
    (ii) Define complement of a subgraph by drawing the graphs. 04

    Q.4 (a) Show that the algebraic structure (G,*) is a group, where 03
    G  {(a, b) / a, b  R, a  0} and * is a binary operation defined by
    (a, b) * (c, d )  (ac , bc  d ) for all (a, b), (c, d )  G.
    (b) Define path and circuit of a graph by drawing the graphs. 04
    (c) (i) Show that the operation * defined by x * y  x y on the set N of 03
    natural numbers is neither commutative nor associative.
    (ii) Define ring. Show that the algebraic system (Z 9 , 9 ,9 ) , where 04
    Z 9  {0,1,2,3,...,8} under the operations of addition and multiplication
    of congruence modulo 9, form a ring.

    1
    Q.5 (a) Define subgraph. Let H be a subgroup of (Z,+), where H is the set of 03
    even integers and Z is the set of all integers and + is the operation of
    addition. Find all right cosets of H in Z.
    (b) Define adjacency matrix and find the same for 04

    (c) (i) Draw the composite table for the operation * defined by x*y=x, 03
    x, y  S  {a, b, c, d }.
    (ii) Show that an algebraic structure (G ,) is an abelian group, where 04
    1 0   1 0 1 0 
    G={A,B,C,D}, A    ,B    ,C   ,
    0 1  0 1 0  1
     1 0 
    D  and  is the binary operation of matrix multiplication.
     0  1

    Q.6 (a) Define indegree and outdegree of a graph with example. 03


    (b) Prove that the inverse of an element is unique in a group (G,*). 04
    (c) (i) Does a 3-regular graph with 5 vertices exist? 03

    (ii) Define centre of a graph and radius of a tree. 04

    Q.7 (a) Check the properties of commutative and associative for the operation 03
    * defined by x*y=x+y-2 on the set Z of integers.
    (b) Define group permutation. Find the inverse of the permutation 04
    1 2 3 4
      .
    3 1 4 2 
    (c) (i) Show that  p  q   p  q is a tautology. 03
    (ii) Obtain the d.n.f. of the form ( p  q)  (p  q). 04

    Q.8 (a) Find the domain of the function f ( x )  16  x 2 . 03


    (b) Define lattice. Determine whether POSET 1,2,3,4,5;| is a lattice. 04
    (c) Show that the propositions ( p  q ) and p  q are logically 07
    equivalent.

    ********

    You might also like