8/8/2019 14348_termpaper 3801

1/2

Roll No Topics

1 Applications of graph colouring.

2 Disuss the various distributions of continuous random variable.

3

Explain graph coloring and various methods to find outchromatic number of a graph and uses of graphcoloring in daily routine

4

Discuss Chinese postman problem and explain how to solve

the problem

5Explain the various algorithms to find out shortest path in agraph.

6What are the constraints in proving 4-coloring theormanalytically

7Explain the problem of Bridges of Konigsberg and methodadopted by Euler to solve it

8 Explain various algorithms to find out minimum spanning tree.

9Explain how graph colouring can be used in a variety ofdifferent models.

11 Discuss various discrete random variables and distributions.

12 Explain Baye's theorem and its applications.

13Discuss binomial distribution and poisson ditribution. Compareand differentiate.

14 Explain Random variables and probability mass function.

15Explain theorem of Total Probability and its applications ineveryday life.

16

Show that if n people attend a party and some shake handswith others (but not with themselves),then at the end, there are at least two people who have shakenhands with the samenumber of people.

17 Applications of graph colouring.

18 Disuss the various distributions of continuous random variable.

19

Explain graph coloring and various methods to find outchromatic number of a graph and uses of graphcoloring in daily routine

21Discuss Chinese postman problem and explain how to solvethe problem

22Explain the various algorithms to find out shortest path in agraph.

23What are the constraints in proving 4-coloring theormanalytically

24Explain the problem of Bridges of Konigsberg and methodadopted by Euler to solve it

25 Explain various algorithms to find out minimum spanning tree.

26Explain how graph colouring can be used in a variety ofdifferent models.

27 Discuss various discrete random variables and distributions.

28 Explain Baye's theorem and its applications.

29Discuss binomial distribution and poisson ditribution. Compareand differentiate.

30 Explain Random variables and probability mass function.

31Explain theorem of Total Probability and its applications ineveryday life.

32

Show that if n people attend a party and some shake handswith others (but not with themselves),then at the end, there are at least two people who have shakenhands with the samenumber of people.

33 Applications of graph colouring.

34 Disuss the various distributions of continuous random variable.

36Explain graph coloring and various methods to find outchromatic number of a graph and uses of graph

8/8/2019 14348_termpaper 3801

2/2

coloring in daily routine

37Discuss Chinese postman problem and explain how to solvethe problem

39Explain the various algorithms to find out shortest path in agraph.

40What are the constraints in proving 4-coloring theormanalytically

41

Explain the problem of Bridges of Konigsberg and method

adopted by Euler to solve it42 Explain various algorithms to find out minimum spanning tree.

43Explain how graph colouring can be used in a variety ofdifferent models.

44 Discuss various discrete random variables and distributions.

45 Explain Baye's theorem and its applications.

46Discuss binomial distribution and poisson ditribution. Compareand differentiate.

47 Explain Random variables and probability mass function.

48Explain theorem of Total Probability and its applications ineveryday life.

49

Show that if n people attend a party and some shake handswith others (but not with themselves),then at the end, there are at least two people who have shaken

hands with the samenumber of people.

50 Applications of graph colouring.

51 Disuss the various distributions of continuous random variable.

52

Explain graph coloring and various methods to find outchromatic number of a graph and uses of graphcoloring in daily routine

53Discuss Chinese postman problem and explain how to solvethe problem

54Explain the various algorithms to find out shortest path in agraph.

55What are the constraints in proving 4-coloring theormanalytically

56Explain the problem of Bridges of Konigsberg and methodadopted by Euler to solve it

57 Explain various algorithms to find out minimum spanning tree.

58Explain how graph colouring can be used in a variety ofdifferent models.

59 Discuss various discrete random variables and distributions.