http://www.makaut.

com

Name : ……………………………………………………………
Roll No. : ……………………………………………..…………..
Invigilator’s Signature : ………………………………………..
CS/B.Tech (CSE/IT-OLD)/SEM-4/M-401/2013
2013
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) Product of two permutations is commutative
a) True
b) False.
ii) A group contains 12 elements. Then the possible
number of elements in a subgroup is
a) 3 b) 5
c) 7 d) 11.
iii) A ring with zero divisors is called an integral domain
a) True
b) False.
iv) The generators of the cyclic group { 1, – 1, i, – i } with
respect to usual multiplication is
a) { 1, – 1 } b) { i, 1 }
c) { – 1, – i } d) { i, – i }.

4201 (O) [ Turn over

CS/B.Tech (CSE/IT-OLD)/SEM-4/M-401/2013

v) A vertex having no incident edge is called an isolated

vertex
a) True
b) False
"1
vi) If a is a generator of cyclic group then a is also a
generator of the group
a) True
!
b) False.
vii) A minimally connected graph is a
a) Binary tree b) Hamiltonian graph
c) Tree d) Regular graph.
viii) Tree contains at least
a) one vertex b) two vertex
c) three vertex d) four vertex.
ix) In the POset ( ( Z + , / ), Z + represents set of all positive
integers and / represents ‘divides’, which of the
following pairs are not comparable ?
!
a) ( 4,
!6 ) b) ( 5, 5 )
c) ( 2, 4 ) d) ( 3, 15 ).
x) In a Boolean Algebra ( B, + , . , ' , 0, 1 ), a + 1 = 1
a) True
b) False.
xi) Number of operations required in a Boolean Algebra is
a) 1 b) 2
c) 3 d) 4.
xii) The generating function of the following numeric
function 1, 1, 1, ..... is

a) (1 + x ) "1 b) (1 " x ) "1

c)! (1 " x ) 2 d) (1 + x ) 2 .
! !
4201 (O) 2
! !
 CS/B.Tech (CSE/IT-OLD)/SEM-4/M-401/2013

GROUP – B
( Short Answer Type Questions )
Answer any three of the following. 3 × 5 = 15

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

Z ( G ) = { a " G : ag = ga # g " G } is a normal subgroup of

G.
!
3. Show that the ring of matrices of the form
$ 2" 0 '
& ) , " , # * Z contains divisors of zero. ( Z = set of all
% 0 2# (

integers and the operations are matrix addition and

!
multiplication ).

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

a ∨ b = b, a, b ∈ L.

5. Express (
E = yl + z x l + y ) as a full disjunctive normal

form.
!
6. Show that the maximum number of edges in a simple graph
n ( n " 1)
with n vertices is .
2

7. Prove that the maximum degree of any vertex in a simple

!
graph with n vertices is ( n – 1 ).

4201 (O) 3 [ Turn over

CS/B.Tech (CSE/IT-OLD)/SEM-4/M-401/2013

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

8. a) Prove that in a simple graph with n ( ≥ 2 ) vertices must

have at least one pair of vertices whose degrees are

equal.

b) Applying Dijkstra’s algorithm find the shortest path

from the vertex v1 to v 4 in the following simple graph :

! !

c) Draw the graph whose incidence matrix is :

" e1 e2 e3 e4 e5 e6 %
$ '
$ v1 0 1 0 0 1 1 '
$v 1 0 1 0 0 0 '
$ 2 '
$v 1 0 0 0 0 0 '
$ 3 '
$v 4 0 1 1 1 1 0 '
$ '
#v5 0 0 0 1 0 0 &

4+6+5
!
4201 (O) 4
 CS/B.Tech (CSE/IT-OLD)/SEM-4/M-401/2013

9. a) Prove that there exists no graph with four edges having

vertices of degree 4, 3, 2, 1.

b) Find by Kruskal’s algorithm a minimal spanning tree for

the following graph :

c) If a simple regular graph has n vertices and 24 edges,

find all possible values of n. 5+5+5

10. a) Prove that a ring R is commutative if and only if

( a + b ) 2 = a 2 + 2 ab + b 2 ∀ a, b ∈ R

b) If two operations ✳ and o on the set Z of integers are

! defined as follows :

a ✳ b = a + b – 1, a o b = a + b – ab

Prove that ( Z, ✳, o )is a commutative ring with unit

element.

c) Prove that ( Z, +,  ) is not an ideal of ( Q, +,  ) where +

and  are usual addition and multiplication respectively.

[ Q = set of all rational numbers ]. 5+7+3

4201 (O) 5 [ Turn over

CS/B.Tech (CSE/IT-OLD)/SEM-4/M-401/2013

11. a) Show that “is congruent to” on the set of all triangles in
a plane is an equivalence relation.

b) Let S be the set of all real n × n non-singular matrices A,

with det A = 1 and G be the group of all n × n real non-
singular matrices. Prove that ( S,  ) is a normal
subgroup of ( G,  ) where  denotes matrix
multiplication.

l
c) Let f be a homomorphism from a group G to G . Let
l
f ( G ) be the set of homomorphic images of G in G .
l
Prove that f ( G ) is a subgroup of G . ! 5+5+5

12. a)
!
A light in a room is to be controlled by 3 switches
!
located at three entrances. Design a simple series-
parallel switching circuit, such that flicking any one of
the switches will change the state of the light.

b) Construct the Boolean function and simplify it given the

following table :
x y z f ( x, y, z )
1 1 1 0
1 1 0 1
1 0 1 1
1 0 0 0
0 1 1 0
0 1 0 1
0 0 1 1
0 0 0 0

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

c) Let S = { 1, 2, 3, 4, 6, 8, 9, 12, 18, 24 } be a set and ‘/’

be a relation defined in S such that a/b mean b is

divisible by a. Draw the Hasse diagram. 5+5+5

13. a) For any Boolean algebra B, prove that

( a + b ) ( b + c ) ( c + a ) = ab + bc + ca ∀ a, b, c ∈ B.

b) Consider the lattice L = { 1, 2, 3, 4, 6, 12 } ordered by

divisibility ( / ). Find the lower and upper bound of L. Is

L a complemented lattice ?

l l
c) Express the Boolean expression z ( x y ) in a complete

sum of product form. 5+5+5

! !

4201 (O) 7 [ Turn over