COURSE INFORMATION

Course Code: M 401

Course Name:  Mathematics – 3

Contacts: 3L + 1T + 0P

Credits: 4

 

COURSE OUTCOME

At the end of this course, the incumbent will be able to:

  1. Remembering:Recite concept of permutation and combination, set theory, concept of statistics and Graph Theory.
  2. Understanding: Discuss the concept probability distribution, statistical inference, graphical algorithm and logical structure.
  3. Applying:Demonstrate computational modeling of biological phenomena and applies techniques from areas such as artificial intelligence, data base, software engineering, machine learning, image processing.
  4. Analyzing:Illustrate physical scenarioand classify them to recognize the best fit physical and logical models.
  5. Evaluating:Compare different mathematical results during the process of problem analysis.
  6. Creating: Design models to demonstrate industrial problem for emerging trend in information technology. 

PREREQUISITES

 

To understand this course, the incumbentmust have idea of:

§ Permutation and Combination, Probability  

§ Set Theory, Basic concept of graph theory 

 

SYLLABI

Note 1: The whole syllabus has been divided into five modules.

Note 2: Structure of the question paper

There will be three groups in the question paper. In Group A, there will be one set of multiple choice type questions spreading the entire syllabus from which 10 questions (each carrying one mark) are to be answered. From Group B, three questions (each carrying 5 marks) are to be answered out of a set of questions covering all the five modules. Three questions (each carrying 15 marks) are to be answered from Group C. Each question of Group C will have two or three parts covering not more than two modules. Sufficient questions should to be set covering the whole syllabus for alternatives.

Module I : Theory of Probability: Axiomatic definition of probability. Conditional probability, Independent events and related problems. Bayes theorem (Statement only) & its application, One dimensional random variable. Probability distributions-discrete and continuous. Expectation, Binomial, Poisson, Uniform, Exponential, Normal distributions and related problems. t, χ2 and F-distribution (Definition only). Transformation of random variables. Central Limit Theorem, Law of large numbers (statement only) and their applications. Tchebychev inequalities (statement only) and its application.                                                                                       (14L)

 

Module II:  Sampling theory: Random sampling. Parameter, Statistic and its Sampling distribution. Standard error of statistic. Sampling distribution of sample mean and variance in random sampling from a normal distribution (statement only) and related problems.

Estimation of parameters: Unbiased and consistent estimators. Point estimation. Interval estimation. Maximum likelihood estimation of parameters (Binomial, Poisson and Normal). Confidence intervals and related problems.                                                                                     (7L)

 

Module III: Testing of Hypothesis: Simple and Composite hypothesis. Critical region. Level of significance. Type I and Type II errors. One sample and two sample tests for means and proportions. χ2 - test for goodness of fit.                                                                             (5L)

 

Module IV: Advanced Graph Theory: Planar and Dual Graphs. Kuratowski’s graphs. Homeomorphic graphs. Eulers formula ( n – e + r = 2) for connected planar graph and its generalisation for graphs with connected components. Detection of planarity. Graph colouring. Chromatic numbers of Cn, Kn , Km,n and other simple graphs. Simple applications of chromatic

numbers. Upper bounds of chromatic numbers (Statements only). Chromatic polynomial. Statement of four and five colour theorems.                                                                                  (10L)

 

Module V: Algebraic Structures: Group, Subgroup, Cyclic group, Permutation group, Symmetric group ( S3), Coset, Normal subgroup, Quotient group, Homomorphism & Isomorphism (Elementary properties only).

Definition of Ring, Field, Integral Domain and simple related problems.                             (12L)

 

 

BEYOND SYLLABI COVERAGE

Frequency and classical definitions of probability, concepts of frequency distribution, mean and standard deviation

LECTURE PLAN

M 401

LECTURE NOTE   

Lecture Notes

 

HOMEWORK/ASSIGNMENT

 Assignment 1

 Assignment 2

 Assignment 3

 Assignment 4

 

 

RECOMMENDED READINGS

Text Books:

1. Banerjee A., De S.K. and Sen S.: Mathematical Probability, U.N. Dhur & Sons.

2. Gupta S. C and Kapoor V K: Fundamentals of Mathematical Statistics, Sultan Chand & Sons.

3. Mapa S.K. :Higher Algebra (Abstract & Linear), Sarat Book Distributors.

4. Sen M.K., Ghosh S. and Mukhopadhyay P.: Topics in Abstract Algebra, University Press.

5. West D.B.: Introduction to Graph Theory, Prentice Hall.

References:

1. Babu Ram: Discrete Mathematics, Pearson Education.

2. Balakrishnan: Graph Theory (Schaum’s Outline Series), TMH.

3. Chakraborty S.K and Sarkar B.K.: Discrete Mathematics, OUP.

4. Das N.G.: Statistical Methods, TMH.

5. Deo N: Graph Theory with Applications to Engineering and Computer Science, Prentice Hall.

6. Khanna V.K and Bhambri S.K. : A Course in Abstract Algebra, Vikas Publishing House.

7. Spiegel M R., Schiller J.J. and Srinivasan R.A. : Probability and Statistics (Schaum's Outline Series), TMH.

8. Wilson: Introduction to graph theory, Pearson Edication.