http://www.makaut.

com

Name : …………………………………………….………………
Roll No. : …………………………………………...……………..
Invigilator’s Signature : ………………………………………..

CS/B.TECH(CSE/IT)(OLD)/SEM-4/M-401/2012

2012
MATHEMATICS
Time Allotted : 3 Hours Full Marks : 70

The figures in the margin indicate full marks.

Candidates are required to give their answers in their own words
as far as practicable.

GROUP – A
( Multiple Choice Type Questions )
1. Choose the correct alternatives for any ten of the following :
10 × 1 = 10
i) Let R be the relation on the set A = { a , b, c } where
R = { ( a , a ), ( b, b ), ( a , b ), ( b, a ) } . Then R is

a) an equivalence relation
b) reflexive, symmetric but not transitive
c) reflexive but not symmetric and transitive
d) symmetric, transitive but not reflexive.
ii) A semigroup ( G,* ) will be monoid if
a) associative law holds under ( * )
b) commutative law holds under ( * )
c) inverse element exists ∀a ∈ G
d) G contains an identity element.

4201(O) [ Turn over

CS/B.TECH(CSE/IT)(OLD)/SEM-4/M-401/2012

iii) The set of all residue class Z 6 contains

a) 6 elements b) 5 elements

c) 7 elements d) none of these.

iv) Solution of the recurrence relation an = 3an −1 , a 0 = 1

is an =

a) 3n b) 3n −1

c) 3n +1 d) none of these.

v) In a Boolean Algebra, ( a + b )′ + ( a + b ′ ) is

a) b b) a

c) a′ d) ab.

vi) In a lattice { 1, 5, 25, 125 }, the complement of 25 is

a) 1 b) 5

c) 25 d) 125.

vii) If a graph has 4 vertices and 7 edges, then the order of

Adjacency matrix is

a) 4×4 b) 4×7

c) 7×4 d) 7 × 7.

viii) A complete graph with n vertices has

a) ( n – 1 ) edges b) n ( n – 1 ) /2 edges

c) 2n edges d) n ( n + 1 )/2 edges.

ix) The degree of any vertex of a null graph is

a) 0 b) 1

c) 2 d) none of these.

4201(O) 2
 CS/B.TECH(CSE/IT)(OLD)/SEM-4/M-401/2012

x) The hamming distance between 11010 and 10101 is

a) 2 b) 3
c) 4 d) 0.
xi) The order of Dihedral Group D 4 is

a) 4 b) 6
c) 8 d) 64.
xii) If the cyclic group G contains 11 distinct elements, then
it has
a) 2 generators b) 7 generators
c) 9 generators d) 10 generators.
xiii) Which of the following sets is closed under
multiplication ?
a) { 1, – 1, 0, 2 } b) { 1, i }
c) { 1, ω, ω2 } d) { 1, ω } .
xiv) A tree contains at least
a) one vertex b) two vertices
c) three vertices d) four vertices.
xv) A ring with zero divisors is called an integral domain.
a) True b) False.
GROUP – B
( Short Answer Type Questions )
Answer any three of the following. 3 × 5 = 15

2. Show that centre of a group G, given by

Z ( G ) = { a ∈ G : ag = ga∀g ∈ G } is a normal subgroup of G.

⎡2α 0 ⎤
3. Show that the ring of matrices of the form ⎢ ⎥ , α, β ∈ Z
⎣ 0 2β⎦
contains divisors of zero. ( Z = set of all integers and the
operations are matrix addition and multiplication)

4201(O) 3 [ Turn over

CS/B.TECH(CSE/IT)(OLD)/SEM-4/M-401/2012

4. In a lattice ( L , ∧, ∨ ) prove that a ∧ b = a if and only if

a ∨ b = b, a , b ∈ L .
5. Express E = y ′ + z ( x ′ + y ) as a full disjunctive normal form.
6. Draw the graph whose incidence matrix is
⎡0 1 0 0 1 1⎤
⎢1 0 1 0 0 0⎥⎥
⎢
⎢1 0 0 0 0 1⎥
⎢ ⎥
⎢0 1 1 1 1 0⎥
⎢⎣0 0 0 1 0 0⎥⎦
7. Define a planer graph. If G be a connected planner graph
with nv vertices, ne edges and n f faces, then show that

nv − n e + n f = 2 .

GROUP – C
( Long Answer Type Questions )
Answer any three of the following. 3 × 15 = 45

8. a) Using generating function, solve the recurrence relation

an − 7an −1 + 10an − 2 = 0 for n > 1 and a 0 = 3 , a1 = 3 .

b) Show that the set of all roots of the equation x 4 = 1

forms a group under multiplication.
⎧ ⎛α 0⎞ ⎫
c) Show that the set of matrices s = ⎨ ⎜⎜ ⎟⎟ : α, β ∈ IR ⎬ is
⎩ ⎝ β 0⎠ ⎭
a left ideal but not a right ideal of 2 × 2 real matrices.
5+5+5
9. a) Show that for any two subgroups H and K of a group G,
H ∩ K is also a subgroup of G.
b) Show that the mapping f : ( Ժ, + ) → ( Ժ଺ , + ) defined by
6
f ( x ) = 5x , x ∈ Ժ଺ is a group homomorphism. Find the
ker f.

4201(O) 4
 CS/B.TECH(CSE/IT)(OLD)/SEM-4/M-401/2012

c) Prove that in a lattice ( L , ≤ ) , for any a , b, c ∈ L ,

if a ≤b ≤c ⇒ a ∨b =b ∧c and (a ∧ b ) ∨ (b ∧ c ) = b
= (a ∨ b ) ∧ (a ∨ c ) . 5+5+5

10. a) Applying Dijkstra's algorithm, find the shortest path

from v1 to v 4 in the following graph :

b) Prove that every cut set in a connected graph contains

at least one branch of every spanning tree of graph.

c) Define Isomorphic graph. Examine whether the

following two graphs are isomorphic or not.

6+4+5

4201(O) 5 [ Turn over

CS/B.TECH(CSE/IT)(OLD)/SEM-4/M-401/2012

11. a) Apply Prim's algorithm to find a minimal spanning tree

for the following weighted graph :

b) Show that if every element of a group is its own inverse,

then it is an Abelian group.

c) Show that f : R → R , f ( x ) = 2x + 3 is a bijective

mapping. 6+4+5

12. a) Show that a ring R satisfies cancellation law if and only

if R is without zero divisor. 5

b) A relation ρ is defined on Z by " a ρ b if and only if

a 2 − b 2 is divisible by 5" for a , b ∈ Z . Prove that ρ is an

equivalence relation on Z. Show that there are three

distinct equivalence classes. 3+2

4201(O) 6
 CS/B.TECH(CSE/IT)(OLD)/SEM-4/M-401/2012

c) Draw the dual of the following graph :

5
=============

4201(O) 7 [ Turn over