## Friday, November 2, 2012

### MA9331 MATHEMATICS FOR NETWORK ENGINEERING SYLLABUS | ANNA UNIVERSITY ME NETWORKING AND INTERNET ENGINEERING 1ST SEM SYLLABUS REGULATION 2009 2011 2012-2013

Latest: TNEA 2014 Engineering Application Status, Counselling Date, Rank List
MA9331 MATHEMATICS FOR NETWORK ENGINEERING SYLLABUS | ANNA UNIVERSITY ME NETWORKING AND INTERNET ENGINEERING 1ST SEM SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY FIRST SEMESTER ME NETWORKING AND INTERNET ENGINEERING DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI, TIRUNELVELI,COIMBATORE), 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009

MA9331 MATHEMATICS FOR NETWORK ENGINEERING L T P C
3 0 0 3
UNIT I 9
Graph Theory Introduction: Introduction Of Graphs, Paths, Cycles, And Trails, Vertex
Degrees And Counting - Directed Graphs - Trees and Distance: Basic Properties. Spanning
Trees and Enumeration, Optimization and Trees.
UNIT II 9
Matching Connectivity and Flow: Matching and Covers Algorithms and Applications.
Matching in General Graphs. -Connectivity and Paths: Cuts and Connectivity, k-connected
graphs – Network Flow Problems.
UNIT III 9
Planar Graphs, Edges and Cycles: Planar Graphs - Embeddings and Euler s Formula -
Characterization of Planar graphs - Parameters of Planarity, Line Graphs and Edge-Colouring,
Hamiltonian Cycles, Planarity, Colouring and Cycles, Applications in Networks.
UNIT IV 9
Introduction to Probability Theory: Probability concepts, Random variables, moments,
Moment Generating function, Binomial, Poisson, Geometric, Negative binominal, Exponential,
Gamma, Weibull distributions, Functions of random variable, Chebychev inequality, Application
in Networks.
UNIT V 9
Queueing Theory: Markovian queueing models, Little's formula, Multi-server queues, M/G/1
Queues, Pollaczek-Khintchine formula, Applications in Networks.
TOTAL: 45 PERIODS
REFERENCE BOOKS:
1. R J Wilson Introduction to Graph Theory , 4th Edition, Pearson Education 2003.
2. Reinhard Diestel Graph Theory ,, 2nd Edition, Springer- Verlog 2000.
3. Jay Yellen, Jonathan L.Gross Graph Theory and Its Applications ,CRC Press LLC 1998.
4. Trivedi K.S., " Probability and Statistics with reliability, Queuing and Computer Science
Applications ", Prentice-Hall of India, New Delhi, 1984.
5. Allen, A.O., Probability Statistics and Queueing Theory ", Academic Press, 1981
6. Gross D, and Harris C.M, Fundamentals of Queueing Theory ", John Wiley & Sons, 1985.