Course Name: 

Mathematical Foundations of Information Technology(MA200)


B.Tech (IT)




Programme Core (PC)

Credits (L-T-P): 

(3-1-0) 4


Graph Theory: Undirected and Directed Graphs, Bipartite Graphs, Connectivity, Traversability, Trees, Spanning Trees, Rooted and Binary Trees, Algorithms – Kruskal’s and Prim’s Minimal Spanning Tree, Dijkstra’s Algorithm, Max-flow Min-cut theorem, Algorithms for computing maximum s-t flows in graphs; Probability Theory: Non-deterministic models, Finite Probability Space and related concepts, Conditional Probability, Independent and mutually exclusive events, Bayes’ Theorem, Random Variables – 1D, 2D, Mathematical Expectation, Variance, Correlation, Distributions – Binomial, Poisson, Normal, Gamma, Chi-Square; Sampling Theory: Purpose and nature of sampling -uses and applications, Mean, Median, Mode, Variance, Standard Deviation; Hypothesis Testing: Formulation of hypotheses – null and alternate hypothesis, Parametric/Non-parametric tests and their applicability, Criteria for acceptance of hypothesis, Level of Significance, t/z/Chi-Square Tests with simple applications.


D. B. West, Introduction to Graph Theory, Pearson Education, ISBN 0-13-014400-2
R. Diestel, Graph Theory, Electronic Edition 2000, Springer Verlag, NY.
P. L. Meyer, Introductory Probability and Statistical Applications, Oxford & IBH Pub
S. M. Ross, Introduction to Probability and Statistics for Engineers and Scientists, John Wiley.
R. V. Hogg and A. T. Craig, Introduction to Mathematical Statistics, Macmillan NY, 4th Edition.


Information Technology

Contact us

G. Ram Mohana Reddy

Professor and Head,
Department of Information Technology, NITK, Surathkal,
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.
Ph.:    +91-824-2474056
Email:  infotech[AT]nitk[DOT]ac[DOT]in

Sowmya Kamath S (Web Admin)

Connect with us

We're on Social Networks. Follow us & stay in touch.