• Subjects Books
    • Login
    Showing: discrete structures • reset
    or   Classic search
    <prev • 123 results • page 1 of 5 • next >
    1
    vote
    2
    answers
    18k
    views
    2
    answers
    Prove that the set G = (1, 2, 3, 4, 5, 6) is an abelian group under multiplication modulo 7.
    mumbai university discrete structures updated 24 months ago by sukhi9699 • 0
    0
    votes
    2
    answers
    23k
    views
    2
    answers
    A survey of 500 television watchers produced the following information:
    mumbai university discrete structures updated 2.1 years ago by farooq2580saad • 0
    1
    vote
    2
    answers
    5.4k
    views
    2
    answers
    Consider the group G = (1,2,3,4,5,6) under multiplication modulo 7 a) Find multiplication table of G b) find Inverse of every element
    mumbai university discrete structures updated 2.3 years ago by mahithayadav3955 • 0
    0
    votes
    0
    answers
    951
    views
    0
    answers
    Question Paper: Discrete Structures : Question Paper May 2016 - Computer Engineering (Semester 3) | Mumbai University (MU)
    question paper computer engineering (semester 3) discrete structures mu updated 3.6 years ago by Team Ques10 ♣ 1.5k
    0
    votes
    0
    answers
    1.1k
    views
    0
    answers
    Question Paper: Discrete Structures : Question Paper Dec 2016 - Computer Engineering (Semester 3) | Mumbai University (MU)
    question paper computer engineering (semester 3) discrete structures mu updated 3.6 years ago by Team Ques10 ♣ 1.5k
    0
    votes
    1
    answer
    11k
    views
    1
    answer
    Define group, monoid, semigroup.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    1.1k
    views
    1
    answer
    Prove that the set A= {0,1,2,3,4,5} is a finite Abelian group under addition modulo 6.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    2.8k
    views
    1
    answer
    Show that the (2, 5) encoding function e: $B^2-> B^5$ defined by e(00) = 00000 e(01) = 01110 e (10) = 10101 e (11) = 11011 is a group code. How many errors will it detect and correct?
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    590
    views
    1
    answer
    Show that a group G is Ablian, if and only if $(ab)^2 = a^2 b^2$ for all elements a and b in G
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    607
    views
    1
    answer
    Let H= $\begin{bmatrix} 1&0&0 \\ 1&1&0 \\ 0&1&1 \\ 1&0&0 \\ 0&1&0 \\ 0&0&1 \end{bmatrix}$ be parity check matrix.Determine the group code $e_H: B^2->B^5$
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    645
    views
    1
    answer
    Let H= $\begin{bmatrix} 1&0&0 \\ 1&1&0 \\ 0&1&1 \\ 1&0&0 \\ 0&1&0 \\ 0&0&1 \end{bmatrix}$ be parity check matrix.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    612
    views
    1
    answer
    Let G={1, 2, 3, 4, 5, 6}. Prove that $(G, x_7)$ is a finite Abelian group with respect to multiplication modulo 7.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    1.2k
    views
    1
    answer
    Show that if every element in a group is its own inverse, then the group must be abelian.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    774
    views
    1
    answer
    Decode the following words relative to a maximum likelyhood decoding function. i)11001 ii) 01010 iii) 00111
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    691
    views
    1
    answer
    Prove that {G, *} is a group.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    574
    views
    1
    answer
    Let H= $\begin{bmatrix} 1&0&0 \\ 0&1&1 \\ 1&1&1 \\ 1&0&0 \\ 0&1&0 \\ 0&0&1 \end{bmatrix}$ be parity check matrix.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    1
    vote
    1
    answer
    5.0k
    views
    1
    answer
    Let G be the set of real numbers and let G be the set of real numbers and let a * b=ab/2. Show that (G, *) is a abelian group.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    4.7k
    views
    1
    answer
    Prove that the set G ={1, 2, 3, 4, 5, 6} is an abelian group under multiplication modulo 7.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    603
    views
    1
    answer
    prove that by mathematical induction
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    712
    views
    1
    answer
    Let G be the set of rational numbers other than 1.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    11k
    views
    1
    answer
    Show that if every element in a group is its own inverse, then the group must be abelian.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    900
    views
    1
    answer
    Is it possible to draw a tree with five vertices having degrees 1, 1, 2, 2, 4?
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    975
    views
    1
    answer
    What is the total number of vertices in a full binary tree with 20 leaves?
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    9.1k
    views
    1
    answer
    Prove that in a full binary tree with n vertices, the number of pendant vertices is (n+1)/2.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    0
    votes
    1
    answer
    1.1k
    views
    1
    answer
    Define isomorphic graphs. Show that the following two graphs are isomorphic.
    mumbai university discrete structures updated 4.1 years ago by Sayali Bagwe • 6.6k
    <prev • 123 results • page 1 of 5 • next >
    Top Members • All »
    Recent Awards • All »