07072

Printed Pages-4

Roll No.

. (,0\)/ TCS-301

(Following Paper ill and Roll No. to be filled in your Answer Book)

B.Tech. THIRD SEMESTEREXAMINATION, 2005-2006 DISCRETE STRUCtURE

;

Time: 3 Hours Note: (i) (ii) (iii)

Total Marks: 100

Answer ALL questions., : i

Make suitable assumptio1;l for missing data, if any and state assumption made. Be precise in your answer.

1.

Attempt any four of the following' questions: (5x4=20) (a) Draw a Venn diagram of sets A,B,e where (i) A and B have elements in common, Band e have elements in common, but A and e are disjoint (ii) ACB, set A and e are disjoint, but Band e have elements in common. (b) Let R be a reflexive and transitive relation on a set A. Define a new relation E on A as -

E= { <a,b>
(c)

I<a,b> ERA <b,a> E R }

Prove that E is an equivalence relation oh A. Let X={l, 2, 3, 4} and R={<x,y> Ix>y} (i) Give the ordered pairs of R. (ii) Draw the Graph of R (iii) Give the relation matrix of R.

TCS-301

[Turn Over

'"""'

,. (d)

Let f: R ~ R and g : R ~ R, where R is the set real

numbers. Find fog and gof, where f (x)=~-2 and g (x) = x + 4. State where these functions are injective, surjective and bijective.

(e) (f)

What is meant by a recursively defined function? Give the recursive definition of factorial function. State and prove the pigeon hole principle.

2.

Attempt any four of the following q~estions : (a) Let ({p.q}, *) be a sem.igroup Where p*q =q, show that (i) (ii) (b) P* q = q* P q * q = q. '. (5x4=20)

Find all the sub groups of. (i) (ii) <Z12' + 12> <Z,51 + 5>

(c)

Define a group. Let S = {O, I, 2, 3, 4, 5, 6, 7} and * denote" multiplication modulo 8" that is x*y=(xy) mod 8 prove that ({O,l}, *) is not a group.

(d)

Given a homomorphism (i)

(ii)

f: G~G';

show that J

f (e) = el, where e and e1 are the identity elements.

f (a -1)

= (f (a -1 for any element am G.

(e) (f)

Show that the system (, +, .) of even integers is a ring under ordinary addition and multiplication. Define the symmetric group of degree n, denoted by Sn, 2

TCS- 301

3.

Attempt any foUT of the following questions: (5x4=20) (a) Define a Poset. Show that IIless than or equal to" relation on set of real number is partial ordering. (b) Let A be the set of factors of a particular positive integer m and let::;; be the relation divides
::;;

= {<x,y>IxEA

A yEA A (x divides

y)}

Draw Hasse diagram for m =30 (c) Show that the elements of the lattice (N,::;;), where N is the set of positive integers and a::;; b if and

'-

,,--.. (d)
(e)

only if II a divides b" satisfy -the destributive

property.
,
\

Define boolean function. for a,ny x and y in a

- -

boolean algebra, show that XAY = X y Y Write the following Boolean expressions in an equivalent sum of products canonical form in three variables xl' x2 and x3' (i) xl * x2 (ii) xl $ x2 ,Prove that a binary tree ~th n nodes has exactly . n + 1 null branches.

(f)

4.

Attempt any two of the following questions: (10x2=20) (a) (i) Define the statement formula and well formed formula. Give some examples of each. (ii) Construct the truth table of the following formula.
'I {PY (Q A R

"-'"

~({PY Q) A (PY R

(b)

When a statement A is said to tautologically imply a statement B ? Verify the following implications

(i)
(ii)

P A {P-?Q)=>Q
'IQA (P-?Q)=> 'IP.

TCS-301

[Turn Over

(c)

(i) (ii)

Show that. ((Pv '1Q) /\ ('1Pv '1Q v Q is a tautology. Show that.

('1 P /\ Q) ~ (Q~ P) is not a tautology.

5.

Attempt any two of the following questions: (a) (i) Solve the recurrence relation ar - 2ar-l-3ar-2

(lOx2=20)

=0, r~ 2

(ii)

by the generating function method with initial conditions ao 3 and al = 1. Solve the followIllg recurrence relation

"

an+l-1.5an (b) (i) (ii) (c)

= 0, n~ O.
what can be

If G and G are bipartite, concluded about G?

Show that a Hamiltonian path is a spanning tree.

Write short notes on any two of the following (i) (ii) (ill) Eular Graphs. Graph Coloring Isomorphism graphs. -000and Homomorphism of ,-...
~

TCS-301