KEMBAR78
Sem-III Groups and Coding Theory. | PDF | Group (Mathematics) | Mathematical Concepts
0% found this document useful (0 votes)
303 views2 pages

Sem-III Groups and Coding Theory.

Uploaded by

Omkar Kumbhar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
303 views2 pages

Sem-III Groups and Coding Theory.

Uploaded by

Omkar Kumbhar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

S.Y. B.Sc.

[6055|-103
(COMPUTER SCIENCE)
MATHEMATICS (Paper -I)
MTC - 231: Groups and Coding Theory
(Semester-Ill) (2019 Pattern) (23221)
Time:2 Hours/ .Max. Marks : 35
nstructions to the candidates:
All questions are compulsory.
2) Figures to the right indicate full marks.
Non-programmable scientifie caleulator is allowed.

Q1) Attempt any Five of the following: (5 x 2= 10|


Prepare composition table for addition on Z,.

b State whether the following statement is True or False:


"Union of two subgroup is subgroup' Justify.

Check whether the permutation s-(1,7,2,5) is even or odd? Justify.

sh Find remainder after dividing 11|" by 2.


=H01 and y=0111
Find Hamming distance between x and y, where, x

alc.
Let a,b.c eZ, if alb and blc then show that

or False:
State whether the following statement is True
Justify.
'Every cyclic group is an abelian group'

P.
02) Attempt any Three of the following: |3 x5= 15)
aY Find ged of 687 and 819. Find integers m and n such that
(819,65)
-m(819) +n (687).

by if u =(2.3) (43: o(,3)(2,4): r- (12.3) (4,5) in S, then find


(ro.

c) State and pròve Euclids Lemma.

d) Using encoding function, f(x) =r+3 (mod 26)encode the word 'MATH.
e Lèta,b eZ. if the binary operation '*' is defined as a«b =atb-ab, then
show that G is an abelian group under operation "*
23) Attempt any One of the following: |1 x 10 = 10]
a) ) Let a,b,x.ye Z, ifa=b (mod uthen

prove that, I) ar=br (mod n)


in)
Let R be relation on Z detined as xRy if and only if 5x + 6v is
divisible by lI\Show that Ris an cquivaience relation on Z
b) Let p=ll.q-3. Using RSA method to encode the word 'CENTRE,
14
take
CAAPOLi691
e-7. 2023

190

236

10367.Is4

|6055|-103 2

You might also like