Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Tutorials

Course No MTH202

Cours Title GRAPH THEORY AND PROBABILITY

Course Planner 11494 :: Rashmi Mishra

Lectures Tutorial Practical Credits 3 2 0 4

Text Book:

1 Rosen Kenneth H., Discrete Mathematics and its applications, Mcgraw-Hill, International Editions, Singapore 2000.

2 Advanced Engineering Mathematics, R.K.Jain & S.R.K.Iyengar.

Other Specific Book:

3 Lipschutz S and Lipson M, Discrete Mathematics, Tata Mcgraw-Hill publishing House, New Delhi.

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 4 http://www.math.washington.edu/~ejpecp 5 http://www3.interscience.wiley.com/journal/35334/home 6 http://www.siam.org/journals/sidma.php 7 http://mathform.org/issac/problems/bridges/.html 8 http://www3.interscience.wiley.com/journal/35334/home Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) Salient Features

9 http://www.personal.kent.edu/~rmuhamma/GraphTheory/grap Detailed description on graph theory and its applications hTheory.htm 10 http://users.senet.com.au/~dwsmith/boolean.htm 11 http://walrandpc.eecs.berkeley.edu/126notes.pdf Boolean algebra, logic gates Euler circuits ,Hamiltonian circuits

Approved for Autumn Session 2011-12

Detailed Plan For Lectures

Week Number Lecture Number Lecture Topic Chapters/Sections of Pedagogical tool Textbook/other Demonstration/case reference study/images/anmatio n ctc. planned

Part 1
Week 1 Lecture 1 Lecture 2 Lecture 3 Week 2 Lecture 4 Graphs and its basic terms Multigraphs, Labelled graphs Complete, Regular and Bipartite graphs Isomorhic ,Homeomorphic and subgraphs ->Reference :1,Section 8.2 ->Reference :1,(1) Section 8.3 & (2) Section 8.3 ->Reference :1,secion 8.4 ->Reference :1,secion 8.5 ->Reference :1,secion 8.5 Animated images of bridge ->Reference :1,secion 8.7 ->Reference :1,secion 8.8 Animated images Planar graphs Animated Images Connected graph Animated Images Euler and Hamiltonian circuit ->Reference :1,Section 8.1

Lecture 5 Lecture 6 Week 3 Lecture 7 Lecture 8 Lecture 9 Week 4 Lecture 10

Path , connectivity Traversable graph Hamiltonian & Eulerian graph Bridges of Koinsberg Planar graphs Graph coloring and chromatic number

Part 2
Week 4 Lecture 11 Lecture 12 Week 5 Lecture 13 Lecture 14 Basic defination and directed graphs Tree graphs, Binary and rooted tree Minimal spanning tree and Prims Algorithm Method of finding shortest path,Djkastra Algorithm ->Reference :1,secion 9.2 ->Reference :1,secion 9.1 ->Reference :1,secion 9.5 ->Reference :1,secion 8.6 Approved for Autumn Session 2011-12 Animated images tree graphs

Week 5 Week 6

Lecture 15 Lecture 16 Lecture 17 Lecture 18

Propositions and compound propositions Basic logical operations ,Logic gates and circuits Truth Tables, Tautoligies and contradictions Logical Equivalence Algebra of Propositions Conditional and Biconditional statements

->Reference :1,secion 1.1 ->Reference :1,secion 1.1 ->Reference :3,section 15.10 ->Reference :1,Section 1.1 ->Reference :1,Section 1.2

Week 7

Lecture 19 Lecture 20 Lecture 21

->Reference :1,Section 1.1

MID-TERM Part 3
Week 8 Lecture 22 Lecture 23 Lecture 24 Week 9 Lecture 25 Lecture 26 Partial ordering, Hasse diagrams of POSET,Consistent Enumerati Supremum and Infimum, Isomorphic Order Sets Lattices, Bounded Lattices Sample space and events, probability function. ->Reference :1,Section 7.6 ->Reference :2,(3) Section 19.1 &19.2 ->Reference :2,Section 19.1 &19.2 ->Reference :1,(1) Section7.6 ->Reference :1,Section 7.6

Lecture 27

Example Using counting methods, sampling with or ->Reference :2,Section without replacement. 19.3 Algebra of events, conditional probability. ->Reference :2,Section 19.4

Week 10

Lecture 28

Part 4
Week 10 Lecture 29 Lecture 30 Independent events, Partitions of sample space. Baye's theorem ->Reference :2,Section 19.5 ->Reference :2,Section 19.6 Approved for Autumn Session 2011-12

Week 11

Lecture 31 Lecture 32 Lecture 33

Random variables, probability mass function ,Expectation, mean and variance. Binomial distributions Expectation, mean and variance of binomial distribution Poisson distribution. Mean and variance of poisson distribution geometric. Continuous random variable.

->Reference :2,Section 19.7 ->Reference :2,Section 19.8

Week 12

Lecture 34 Lecture 35

->Reference :2,Section 19.8.2

Lecture 36

->Reference :2,Section 19.7

Spill Over
Week 13 Lecture 37 Lecture 38 Lecture 39 Algebra of proposition Two dimensional Random variables. Continuous random variable ->Reference :3,section 4.7 ->Reference :2,(3) Section 19.7.1 ->Reference :2,section19.7

Scheme for CA:out of 100*

Component Class test Frequency 2 Total :Out Of 3 Each Marks Total Marks 10 10 20 20

* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, as explained in teacher's guide available on the UMS

Plan for Tutorial: (Please do not use these time slots for syllabus coverage)
Tutorial No. Lecture Topic Type of pedagogical tool(s) planned (case analysis,problem solving test,role play,business game etc)

Approved for Autumn Session 2011-12

Tutorial 1 Tutorial 2 Tutorial 3 Tutorial 4 Tutorial 5 Tutorial 6 Tutorial 7 Tutorial 8 Tutorial 9 Tutorial 10 Tutorial 11 Tutorial 12 Tutorial 13 Tutorial 14

Graph and its basic terms, Multigraphs, Labelled graphs. Complete, Regular and Bipartite graphs. Isomorphic, Homeomorphic graphs, Subgraph. Path, connectivity, Traversable graph Hamiltonian circuits, Eulerian graphs, Bridges of Konigsberg, Planar graphs Graph colourings and Chromatic number, Basic definitions and directed graphs,Tree graphs, Binary and rooted tree, , Minimal spanning tree, Prims algorithm. Method of finding Shotest paths, Djkastra Algorithm Propositions compound propositions .Basic logical operations.,Truth tables, tautologies and Contradiction Logical equivalence, Gates

Problem solving Problem solving Problem solving Problem solving Problem solving,Test Problem solving Problem solving Problem solving Problem solving,Test Problem solving Problem solving

Partially ordered set, Lattice, Lattice as Boolean algebra Problem solving .Boolean algebra Sample space and events , probability function Problem solving Problem solving

After Mid-Term
Tutorial 15 Tutorial 16 Tutorial 17 Tutorial 18 Tutorial 19 Tutorial 20 Tutorial 21 Tutorial 22 Tutorial 23 Example Using counting methods, sampling with or without replacement Example Using counting methods, sampling with or without replacement. Algebra of events, conditional probability Independent events, Partitions of sample space Independent events, Partitions of sample space Theorem of total probability, Bayes theorem. Random variables, probability mass function, Binomial distributions. Mean and variance of Binomial distribution, Poisson distribution. Mean and variance of poisson distribution, geometric Problem solving Problem solving Problem solving Problem solving Problem solving Problem solving Problem solving Problem solving,Test

Approved for Autumn Session 2011-12

Tutorial 24

Continuous random variable

Problem solving

Approved for Autumn Session 2011-12