Discrete Structure

TUTORIAL MANUAL

SUBJECT:

DISCRETE STRUCTURE CLASS: (Computer / I.T) Semester III

Discrete Structure

Sr No. 1 2 3 4 5 6 7 8 9 10 11 12 SET THEORY

Name 3,4 5,6 SET THEORY AND LOGIC RELATIONS RELATIONS LATTICES TYPES OF LATTICES FUNCTION GROUP GRAPHS RINGS AND FIELDS ENCODING DECODING,PIGEONHOLE PRINCIPLE

Page No

7,8,9 10,11 12,13 14,15 16 17,18 19,20, 21 22,23 24,25 26,27

Discrete Structure

TUTORIAL NO 1
TITLE :-SET THEORY OBJECTIVE:-To study set theory. REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PREREQUISITE:1>Sets,Venn diagram,set membership table 2>Laws of set theory. 3>Partitions of set. 4>Power set. TUTORIAL QUESTIONS:Q1>State true/false with reasons E=[{ 1,2,3} ,{2,3},{a,b}], F= [{ a,b},{1,2}] a> { } b>{}={{}} c> subset of d>{a,b} e> F
   

Q2>Define following terms . Draw Venn diagrams. Shade the region under consideration. a>Proper subset. b>Complement of set A with respect to universal set. c>Complement of set A with respect to set B. d>Symmetric difference. e>Partition of a set. Q3>Find PP{{a,b}}
  

Q4>Find ((BU C)

Discrete Structure

Q5> Find |{

} U {{

}}|

Q6>Show order of evaluation using parenthesis A U B Dc U Ec Q7>Let Z be a set of integers,N be a set of natural numbers ,R is a set of real numbers,C is a set of complex numbers . Show the set containment. Q8> Find partition of a set containing different letters from word INSIDEINDIA. Q9> The students in a dormitory were asked whether they had a dictionary (D) or a thesaurus (T) in their rooms. The results showed that 650 students had a dictionary, 150 did not have a dictionary , 175 had a thesaurus, and 50 had neither a dictionary nor a thesarus. Find the number K of students who :a> live in the dormitory, b> have both a dictionary and a thesarus, and c> have only a thesarus Q10> Find symmetric difference between set A & set B.A is a set of vowels in English. B is a set of different letters in sentenceDiscrete paper is easy.

Discrete Structure

TUTORIAL NO 2
TITLE :-SET THEORY AND LOGIC OBJECTIVE:-To study set theory and logic REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PREREQUISITE:1>Sets,Venn diagram,set membership table 2>Laws of set theory. 3>Partitions of set. 4>Power set. TUTORIAL QUESTIONS:Q1>Write down statement in symbolic form Let p be the sam is rich and let q be sam be happy. (Assume sam is poor means sam is not rich , i.e. , ~p). a> sam is poor but happy. b>sam is neither rich nor haapy c> sam is either rich or unhappy. d>sam is poor or else the is rich and unhappy. Q2>Given that value of p->q is true,determine value of (pVq)->q. Q3>If p->q is false ,determine pV(p<->q).

Q4>Construct te truth table of (p---> q) ----> (p

q).

Discrete Structure Q6> U A I1 I4 I2 I7 I5 C I0 U is universal set ,A,B,C are subsets of U. Show complete intersection of U generated by A,B,C with the help of venn diagram. Given A B C 0.Give equations also.

B I3 I6

Discrete Structure

TUTORIAL NO:- 3
TITLE:-RELATIONS OBJECTIVE:-To study relations and properties possessed by relations REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PREREQUISITE:1.Relations. 2.Path 3.Diagraph TUTORIAL QUESTIONS:Q1>Find matrix & diagraph of of relation R on set A a>A={1,2,3,4,8,10,12} aRb if and only if a=b. b>A={1,2,3,4,8,9, 10 ,11,12} aRb if and only if a-b>=4 Q2>Let a={1,2,3,4} MR = 1001 1110 1001 1011 Give digraph. Q3>Find relation determined by a> 2 6

Discrete Structure

b>

1 2

5 Q4> 2

6 i>Draw digraph of R2 ii>Find MR2

Q5>Determine whether relation R whose digraph is given is equivalence a> 1 2 b> 1 2

Discrete Structure c> a b

Q6>Find partitions corresponding to R S Let A={1,2,3,4,5,6} R={(1,2),(1,1),(2,1),(2,2),(3,3),(4,4),(5,5),(6,6),(5,6),(6,5)} S={(1,1),(1,2),(1,3),(2,1),(2,2),(2,3),(3,1),(3,3),(3,2),(4,6),(4,4),(6,4),(6,6),(5,5)}

Discrete Structure

TUTORIAL NO :-4
TITLE:- RELATIONS OBJECTIVE:-1.To study Relations,Paths and Diagraphs. 2.To study Manipulation of Relations, Closures,Warshall's Algoritms. 3.To study Posets and Hasse Diagram REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PRE-REQUISITE:1.Properties of Relations. 2.Reflexive ,Transitive and Symmetric Closures 3.Posets (Pratial Order Set). 4.Hasse Diagram TUTORIAL QUESTION:Q1> Find Reflexive and Symmetric Closure on the Set A A={1,2,3,4,5} R={(2,1) (4,3) (2,4) (5,1) }

Q2> Find S

M=

0 1 1 0 0

1 1 1 1 1

0 0 1 0 0

1 0 0 0 1

0 1 0 0 0

Q3>Draw Hasse Diagram of Relation R on A. A={ 1,2,3,4,5} M= 1 1 1 1 1 0 1 1 1 1 0 0 1 1 1 0 0 0 1 1 0 0 0 0 1

10

Discrete Structure

Q4> Determine Matrix of Partial Order whose Hasse Diagram is 3 (a) 5 4 2

1 (b) 4 5

2 1

Q5> Draw Hasse Diagram of Poset whose Diagraph is a b d e c

11

Discrete Structure

TUTORIAL NO :-5
TITLE:-LATTICES OBJECTIVE:- 1.To study Lattice. REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PRE-REQUISITE:1.Lower Bound 2.Upper Bound 3.Least Upper Bound 4.Greatest Lower Bound 5.Posets 6.Hasse Diagram 7.Lattice TUTORIALQUESTIONS:Q1>Determine whether following diagram are Lattice. fig(1) a b c d e fig(2) g f h e d c i f h g

12

Discrete Structure a fig(3) g e d b a fig(4) f d g b a Q2> Is Poset (A,<=) under operation of divisibility a lattice. A={1,2,3,4,6,8,9,12,18,24} Q3> If L1 and L2 are Lattices, Draw Hasse Diagram for (L1 X L2). Q4>Find all Sub Lattices of D72 containing at least 5 elements. c e c f b

13

Discrete Structure

TUTORIAL NO :-6
TITLE:- TYPES OF LATTICES OBJECTIVE:- 1.To study Complemented Lattice. 2.To study Distributive Lattice REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PRE-REQUISITE:1.Complemented Lattice 2.Distributive Lattice TUTORIAL QUESTIONS:Q1> Find Complement of element c I c a O Q2> Find Complement of element b I d a o Q3> Find Complement of each element in D60 and D105 .Are they Complemented Lattices b c b

14

Discrete Structure

Q4> Which of the following Lattices are Distributive,complemented or both fig(1) e c b a fig(2) d c f e g f d

b a fig(3) a b c d e fig(4) e c a f g

15

Discrete Structure

TUTORIAL NO:- 7
TITLE :- FUNCTION OBJECTIVE:-To study functions and properties possessed by function REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PREREQUISITE:1.Definitions Of a>Function b>Domain c>Codomain d>Range e>Injective f>Surjective g>Bijective h>Composite Functions i>Inverse Function TUTORIAL QUESTIONS:Q1>State which of the following are functions & properties possessed by them Let A={a1,a2,a3} B={b1,b2,b3} C={c1,c2} D={d1,d2,d3,d4} f1 : A->B = {(a1,b2),(a2,b3),(a3,b1)} f2 : A->D = {(a1,d2),(a2,d1),(a3,d4)} f3 : D->B = {(d1,b1),(d2,b2),d3,b1)} Q2>Determine whether f-1 exists? Let f : :A->B, A={1,2,3,4} , B={a,b,c,d} i>f = {(1,a),(2,a),(3,c),(4,d)} ii>f = {(1,a),(2,c),(3,b),(4,d)} Q3>Let A be set of real numbers, B={0,1} & Z be set of integers. Let f : A-> B . Then for any real number a let f(a)=0 if a // Z & f(a)=1 if a Z State whether it is function or not? Q4>Determine whether function is one to one & onto. Let f : A->B a>Let set A->B=set of integers f(a)=a-1. b>Let set A=set of real numbers. B{x/x is real & x>=0} f(a)=|a| . Q5>Let f,g,h be functions from Z->Z where Z is set of integers. f(n)=n+5 g(n)=n-2 h(n)=n2 Find fog , f3, fogoh 16

Discrete Structure

TUTORIAL 8
TITLE :-GROUP OBJECTIVE :-To study groups & properties of groups REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PREREQUISITE:1>Monoids, Semigroup,Groups 2>Product and quotients of algebraic structures 3>Isomorphism, homomorphism, automorphism 4>Normal subgroup TUTORIAL QUESTIONS :Q1>Consider binary operation * defined on the set A = {a,b,c,d} by the following table a a b c d b c d b b a a d c a c

a c d a c d d b

Compute a> c*d & d*c b>b * d & d*b c>a*(b*c) & (a*b)*c d>Is * commutative? Is * associative? Q2>Let A={a,b} which of the following tables define a semigroup on A?Which define a monoid on A? a b a b a b a a b a a b a b b b

17

Discrete Structure a a b a b b a b a b a b b b a a

Q3> Let R+ be the set of all positive real numbers. Show that the function f : R+->R defined by f(x)=ln(x) is an isomorphism of semigroup (R+,*) to the semigroup (R,+) where * & + are ordinary multiplication & addition respectively. Q4>Determine whether the set together with binary operation is a group. If it is a group ,determine if it is abelian ,specify the identity & inverse. i>The set of odd integers under operation of multiplication. ii>Q ,the set of all rational numbers under operation of addition. Q5>Let G be a group of integers under operation g addition & let H={3*K / K Z} Where Z is set of integers. Is H subgroup of G? Q6>Prove that function f(x)=|x| is a homomorphism from group G of nonzero real numbers under multiplication to group G' of positive real numbers unde multilication. Q7>Let Q be set of positive rational numbers which can be expressed in the form 2a3b where a & b are integers. Prove that algebraic structure (Q,*) is a group. Q8>Let s={x/x is a real number; x 0,1} Consider following functions .fi : S->S, i=1,2,3,4,5,6 f1(x)=x f2(x)=1-x f3(x)=1/x f4(x)=1/(1-x)

f5(x)=1-(1/x) f6(x)=x/(x-1) Show that G={f1,f2,f3,f4,f5,f6} is group under operation of composition . Give operation table of (G,*). Q9>Let G={e,a,a2,a3,a4,a5} be a group under operation ai aj= ar where i+j=r (mod 6). Prove that G & Z6 are isomorphic.

18

Discrete Structure

TUTORIAL NO :-9
TITLE:- GRAPHS OBJECTIVE:1.To study graph concepts 2.To study paths and curcuits :(Eulerian, Hamiltonian)

REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross, Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PRE-REQUISITE:1.Notation and Definition 2.Paths and Connectivity 3.Types of Graphs 4.Subgraphs 5.Isomorphic Graphs 6.Homomorphic Graphs 7.Representation of graphs 8.Eulerian and Hamiltonian Graphs TUTORIAL QUESTION:Q1>Determine whether following graphs have Euler's and Hamiltonian path, Circiut. Give reason. Fig(1) a e c Fig(2) d b

19

Discrete Structure Fig(3)

Fig(4)

Fig(5)

n Q2> Verify i=1 Fig(1)

deg(Vi) = 2|E| if graph is planar

Fig(2)

20

Discrete Structure

Fig(3)

Q3>Which of the undirected graphs in fig's have an Euler circiut ? Write Euler circuit and path in each of the graphs fig(1) a e d fig(2) a e d fig(3) a c d b e c b c b

Q4> Determine graph G and H shown in figure are isomorphic or not ? Justify your answer u1 u2 u4 u6 u3 u5 v2 v4 v6 v1 v3 v5

21

Discrete Structure

TUTORIAL NO :-10
TITLE:- RINGS AND FIELDS OBJECTIVE:1.To study Rings and Fields concepts 2.To study Ring isomorphism and homomorphism REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross,Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PRE-REQUISITE:Definitions:1.Rings 2.Fields 3.Integral Domain 4..Ring Isomorphic TUTORIAL QUESTION:Q1> Let G={e,a,a2,a3,a4,a5} be a group under operation aiaj =ar where i+j=r(mod 6) Prove that G & Z6 are isomorphic. Q2> Let Z be a group of integers under addition and Let H be a Subgroup of Z consisting of the multiples of 5. Show that H is normal Subgroup of Z and find quotient group Z/H. Q3> Show that Ring Z29 of integers modulo 29 ia an Integral Domain Where Ring Z105 of integers modulo 105 is not an Integral Domain Q4>Let R={ 0,2,4,6,8} Show that R is Commutative Ring under + and X modulo 10. Verify whether it is an Integral Domain or Field or both Q5>Show that the set R={x |x = a+b 2 ; a,b are integers } is a Ring with ordinary addition and multiplication Q6>Show that (I, + ,.) is a commutative Ring identify where the operations + and . are defined as follows:- a+ b= a+b -1 a.b=a+b-ab

22

Discrete Structure

Q7> Let R= {0,2,4,6,8} Show that R is Commutative Ring under addition and multiplication modulo 10. 0 2 4 6 8 0 0 2 4 6 8 2 2 4 6 8 0 4 4 6 8 0 2 6 6 8 0 2 4 8 8 0 2 4 6

23

Discrete Structure

TUTORIAL NO:-11
TITLE:-ENCODING OBJECTIVE:-To study encoding function. REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross, Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PREREQUISITE:1.Hamming distance. 2.Group codes. 3.Encoding using parity check matrix. TUTORIAL QUESTIONS:Q1>Find distance between x & y. a> x=1100010 y=1010011 b> x=0110110 y=0011010 Q2>Consider the (2,6) encoding function e : B2->B6 defined by e(00)=000000 e(10)=101010 e(01)=011110 e(11)=111000 i>Find minimum distance of e. ii>How many errors will e detect. Q3>Show that (2,5) encoding function e : B2->B5 defined by e(00)=00000 e(01)=01110 e(10)=10101 e(11)=11011 is a group code.

24

Discrete Structure

Q4> Let 011 011 100 010 001 be a parity check matrix. Determine the (2,5) group code function e : B2->B5 Q5>Let H= 100 011 111 100 010 001 H=

be a parity check matrix. Determine the (3,6) group code function e : B3->B6

25

Discrete Structure

TUTORIAL NO:- 12
TITLE:-DECODING,PIGEONHOLE PRINCIPLE OBJECTIVE:-To study maximum likelihood principle,pigeonhole principle, permutation functions. REFERENCE:1.Discrete mathematical structures by Kolman ,Busby and Ross, Fourth Edition. 2.2000 Solved problems in discrete mathematics ,Schaum's series , McGraw Hill publication , International edition 1992. 3.Previous Questions Papers. PREREQUISITE:1. Maximum likelihood principle. 2. Pigeon hole principle. 3. Permutation functions. TUTORIAL QUESTIONS Q1>Consider (3,6) group encoding function e : B3->B6 defined by e(000)=000000 e(100)=1000101 e(001)=000110 e(101)=100011 e(010)=010010 e(110)=110111 e(011)=010100 e(111)=110001 Decode the following words relative to maximum likelihood decoding function a>011110 b>101011 c>110010 Q2>Consider (3,8) encoding function e:B3->B8 defined by e(000)=00000000 e(100)=10100100 e(001)=10111000 e(101)=10001001 e(010)=00101101 e(110)=00011100 e(011)=10010101 e(111)=00110001 & let d be (8,3) maximum likelihood decoding function associated with e. How many errors can (e,d) correct? Q3>Show that if any 5 numbers from 1 to 8 are chosen ,then two of them will add to 9.

26

Discrete Structure Q4> Show that if 4 numbers from 1 to 7 are chosen , then two of them will add to 8. Q5> Show that at least 2 people out of 13 must have their birthday in same month when they are assembled in the same room. Q6> Let A={1,2,3} Let f : A-> A .f(a)=a. a>Find all permutations of A. b>Compute P4-1 Where P4 is 4th permutation of A. c>Compute P3oP2 Where P3 & P2 are 3rd & 2nd permutations of A.

27