Study
Explore
Login
Showing: discrete structures • reset
or   Classic search
<prev • 123 results • page 1 of 5 • next >
0
votes
2
answers
4.6k
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 written 2.3 years ago by Sayali Bagwe • 2.0k • updated 6 weeks ago by sukhi9699 • 0
0
votes
2
answers
11k
views
2
answers
A survey of 500 television watchers produced the following information:
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k • updated 12 weeks ago by farooq2580saad • 0
0
votes
2
answers
1.5k
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 written 2.3 years ago by Sayali Bagwe • 2.0k • updated 4 months ago by mahithayadav3955 • 0
0
votes
0
answers
616
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 written 21 months ago by Team Ques10 ♦♦ 400
0
votes
0
answers
767
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 written 21 months ago by Team Ques10 ♦♦ 400
0
votes
1
answer
3.8k
views
1
answer
Define group, monoid, semigroup.
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
608
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
1.0k
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
371
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
378
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
452
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
369
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
922
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
400
views
1
answer
Decode the following words relative to a maximum likelyhood decoding function. i)11001 ii) 01010 iii) 00111
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
389
views
1
answer
Prove that {G, *} is a group.
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
370
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
1.1k
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
2.8k
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
399
views
1
answer
prove that by mathematical induction
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
332
views
1
answer
Let G be the set of rational numbers other than 1.
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
5.5k
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
481
views
1
answer
Is it possible to draw a tree with five vertices having degrees 1, 1, 2, 2, 4?
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
404
views
1
answer
What is the total number of vertices in a full binary tree with 20 leaves?
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
3.7k
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 written 2.3 years ago by Sayali Bagwe • 2.0k
0
votes
1
answer
508
views
1
answer
Define isomorphic graphs. Show that the following two graphs are isomorphic.
mumbai university discrete structures written 2.3 years ago by Sayali Bagwe • 2.0k
<prev • 123 results • page 1 of 5 • next >
Top Members • All »
Recent Awards • All »