Dr Bhim Rao Ambedkar University 2007 B.Tech Information Technology Data Structure - exam paper

Y-308
SECOND YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2007

DiscRETE MATHEMATICAL STRUCTURE

Total Marks: 100
Time: 3.00p.m. To 6.00p.m.

Instructions: 1) Attempt any 3 ques. from every part.

2) Figures to right indicate full marks.


SECTION-1

Q.1 a) what is function? provide various kinds of functions with examples. [Marks 8]

b) What is semi group? describe subsequent with respect to semi groups. [Marks8]

1. Isomorphism

2. Monomorphism

3. Homomorphism


Q.2 Write a short notes on:[Marks 16=8*2]

1) Algebraic systems

2) Normal and principal normal forms

Q.3 a) provide various kinds of operations on sets with example. [Marks 8]

b) provide the pointers and linked allocation of discrete structures. [Marks 8]



Q.4 a) provide the various properties of binary relations with definitions and examples. [Marks 8]

b) What is POSET? How they are represented? discuss with example.[Marks 8]


SECTION-2

Q.5 Write a short notes on:[Marks 18=6*3]

1) Partitions and covering of set

2) POSET and Hasse diagram

3) Normal and principal normal forms



Q.6 a) describe the lattices as a POSET. describe greatest lower bound and lowest upper bound with examples.[Marks 8]

b) describe group. describe and provide examples of various kinds of groups.[Marks 10]


Q.7 a) discuss about the recovery of single fault in group codes.[Marks 8]

b) discuss the linked representation of binary tree.[Marks 8]

Q.8 a) derives the reverse polish expression for the subsequent expressions: :[ Marks 8=4*2]

1) a + (b/c) *d

2) (a + b) (c + d/e) * f

Earning:   Approval pending.