Name: Sudeep Sharma

Roll Number: 510818304

Learning Centre: 2882
Subject : Discrete Mathematics
Assignment No.: MC0063 02
Date of Submission at the learning centre:

31/05/2008
Faculty Signature:

MC0063-02

DISCRETE MATHEMATICS
Question 1. Draw the state diagram for the finite automation M = (I,Q, q 0, )
where I={a,b} , Q= {q0 ,q1 , q2 } F={q0, q1},
: Q* I Q defined by

q0

q0

q1

q1

q0

q2

q2

q2

q2

Verify whether or not the strings aaab and bbaa are acceptable to M .
Ans:
(a)- Consider the string : aaab
Now
(q0 , aaab ) = ( ( q0,a), aab)
= (q0, aab)
=
( ( q0, a),ab)
=
(q0, ab)
= ( (q0,a) ,b)
=
(q0,a)
= q2 F.
Therefore the string aaab is accepted by M.
(b)- Consider the string ; bbaa
Now (q0, bbaa) = ( (q0,b), baa)
= (q1, baa)
= ( (q1 , b), aa)
= (q2,aa)
= ( (q2, a) , a)
= (q2, a)
= q2 F
Therefore bbaa is not accepted by M.

State Diagram:
b

Start

q1

q0

a
b
q2
a,b
Question . 2- Write short note on Coset decoding in your own words.
Ans:
Coset Decoding- A linear code C is a sub group of Z n2 . Coset or
standard decoding uses the coset of C in Zn2 to
implement maximum likelihood decoding. Suppose that C is an (n,
m) linear code. A coset C
of Zn2 is written in the form x+c , where x Zn2 .
Question .3- If G is a tree ( with minimum two vertices), then there exists at
least two pendant vertices.
Ans:
Let G be the tree with |V| 2.
Let v0e1v1e2v2e3..vn- 1envn be a longest path in G (since G is
finite graph, it is possible to find a longest path).
Now we show that d (v0) = 1 = d(Vn).
If d (v0 ) > 1 , then there exist at least one edge e with end point v 0
such that e e1. If e { e1, e , en}, then e= ei for some
i1.
So either vi-1 = v0 or vi = v0 v0 repeated in the path , a
contradiction.
Therefore e ( e1, e2, ab
e3,.en} and so e, e1, e2, e3, ..en is a
path of length n+1 , a contradiction.
Thus d( v0 )= 1. In a similar way, we can show that d ( vn ) = 1.
Hence v0, vn are two pendant vertices.

Question 4. Write an expression for the Fibonacci numbers using characteristic

equation.
Ans:

We can write a difference equation for Fibonacci numbers as:

Fn =Fn-1 + Fn-2 ,n 2
With two boundary conditions
F0=0, F1=1

Question 5. Let a and b be two elements in a lattic (L , ). Show that a ^ b = b if

and only if a V b = a.
Ans:
Part ( a)Suppose a ^ b = b . Now
a = a V ( a ^ b)
(by absorption law)
=a Vb
(supposition)
Part ( b )- Suppose a V b = a
Now
b= b ^ ( b V a )
(by absorption)
= b ^ (a V b )
( by commutative)
=b^ a
( supposition )
= a ^b
( by commutative )
Question 6. Prove that if G is a finite group and H is a subgroup of G ,then O
(H) is a divisor of O (G).
Ans:
Let the order of < G , * > = n
And order of < H , * > = m
Since G is a finite group , there are a finite number of left ( right )
cosets of H in G.
Let there be k distinct cosets of H in G a1H , a2 H akH
The number of elements ai H is same as of elements in H.
( because distinct elements of H contribute to distinct elements in ai H)
therefore every coset ai H has exactly m elements .
Now ,
G = ( a1 H ) U (a2 H ) U . U ( ak H )
Therefore O ( G) = O ( a1 H ) + O ( a2 H ) + .+ O ( ak H )
n= m+m +m ++ m ( k times)
n= k m
= m divides n
= O ( H ) divides O ( G) .