00 upvotes00 downvotes

13 views7 pagesmaths ip

Apr 24, 2013

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

maths ip

Attribution Non-Commercial (BY-NC)

13 views

00 upvotes00 downvotes

maths ip

Attribution Non-Commercial (BY-NC)

You are on page 1of 7

Format For Instruction Plan [for Courses with Lectures and Tutorials

Course No MTH202

Text Book:

1 Lipchutz S and Lipson M, Discrete Mathematics, Tata Mcgraw-Hill publishing House, New Delhi, 2006

2 Rosen Kenneth H., Discrete Mathematics and its Applications, Mcgraw-Hill, International Editions, Singapore, 2000 3 RK Jain & SRK Iyengar, Advanced Engineering Mathematics, Narosa Publications 4 Grewal B. S., Higher Engineering Mathematics

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 5 Yongtaek LIM, Hyunmyung KIM, A SHORTEST PATH ALGORITHM FOR REAL ROAD NETWORK BASED ON PATH OVERLAP, Journal of the Eastern Asia Society for Transportation Studies, Vol. 6, pp. 1426 - 1438, 2005 Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) 6 http://www.personal.kent.edu/~rmuhamma /GraphTheory/graphTheory.htm 7 http://users.senet.com.au/~dwsmith/boolean.htm 8 http://walrandpc.eecs.berkeley.edu/126notes.pdf 9 http://www.dgp.toronto.edu/people/JamesStewart/270/9798s/L affra/DijkstraApplet.html 10 http://www.personal.kent.edu/~rmuhamma/GraphTheory/MyG Connectivity of Graphs raphTheory/connectivity.htm 1 Approved for Spring Session 2010-11 Salient Features Detailed description on graph theory and its applications Boolean algebra Euler circuits ,Hamiltonian circuits Construct graph

11 http://mathform.org/issac/problems/bridges/.html 12 http://www.math.washington.edu/~ejpecp

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

Part 1

Week 1 Lecture 1 Lecture 2 Lecture 3 Week 2 Lecture 4 Lecture 5 Lecture 6 Week 3 Lecture 7 Lecture 8 Lecture 9 Week 4 Lecture 10 Introduction of Graph and related terms Multigraphs, Subgraphs Isomorphic, homomorphism graphs Path, Connectivity ->Reference :1,8.2 ->Reference :1,8.2 8.3 ->Reference :1,8.3 ->Reference :13, ->Reference :1,8.4 HomeWork 1 Allocation Lecture with animated images

The bridges of Konigsberg, Traversable multigraphs ->Reference :1,8.5 Labeled and weighted graphs Complete, Regular and Bipartite Graphs Tree Graphs Planar Graphs Graph Colorings and Chromatic Number ->Reference :1,8.6 ->Reference :1,8.7 ->Reference :1,8.8 ->Reference :1,8.9 ->Reference :1,8.10 Term Paper 1 Allocation Lecture with animated images HomeWork 1 Submission Lecture with animated images

Part 2

Week 4 Lecture 11 Lecture 12 Directed Graphs, Rooted Tree, Binary tree ->Reference :1,9.2 9.3 HomeWork 2 Allocation ->Reference :1,9.4 ->Reference :1,10.2 Approved for Spring Session 2010-11

Week 5

Minimal Spanning tree, Prim's Algorithm Shortest path, Dijkstra's Algorithm Propositions and compound propositions ->Reference :1,15.2 15.3 ->Reference :2,Ch 1 section 1.1 ->Reference :1,15.4 ->Reference :2,Ch 1 section 1.2 ->Reference :1,15.11 ->Reference :2,CH 1 section 1.2 ->Reference :2,CH 1 section 1.2 ->Reference :2,Ch 1 section 1.2 ->Reference :1,4.7 ->Reference :1,4.8 HomeWork 2 Submission

Week 6

Lecture 16

Lecture 17

Truth Tables

Tautologies and Contradictions Logical Equivalence Algebra of Propositions Conditional and Biconditional statements

MID-TERM Part 3

Week 8 Lecture 22 Lecture 23 Lecture 24 Week 9 Lecture 25 Lecture 26 Lecture 27 Week 10 Lecture 28 Lecture 29 Partially Ordered Set Hasse Diagrams of POSET Consistent Enumeration Supremum and Infimum Isomorphic Order Sets Lattices, Bounded Lattices Sample Space and Events Finite Probability Spaces ->Reference :1,14.2 ->Reference :1,14.3 ->Reference :1,14.4 ->Reference :1,14.5 ->Reference :1,14.6 ->Reference :1,14.8 14.9 ->Reference :1,7.2 ->Reference :1,7.3 HomeWork 3 Allocation

Part 4

Week 10 Week 11 Lecture 30 Lecture 31 Lecture 32 3 Conditional Probability, Independent Events Independent Repeated Trials Random Variables ->Reference :1,7.4 7.5 HomeWork 3 Submission ->Reference :1,7.6 ->Reference :1,7.7 HomeWork 4 Allocation Approved for Spring Session 2010-11

Week 11 Week 12

Baye's Theorem Random Variables, Probability Mass Functions Binomial Distribution Poisson Distribution Geometric Distribution Expectation, Variance of Random Variable

->Reference :4,18.5 ->Reference :3,19.6 ->Reference :4,18.7 ->Reference :3,19.7 ->Reference :4,18.8 ->Reference :3,19.8 ->Reference :4,18.8 ->Reference :3,19.8.2 ->Reference :4,18.8 ->Reference :4,18.7 18.8 ->Reference :3,19.8 ->Reference :4,18.6 ->Reference :3,19.8 HomeWork 4 Submission Term Paper 1 Submission

Week 13

Lecture 37 Lecture 38

Lecture 39

Spill Over

Week 14 Lecture 40 Lecture 41 Lecture 42 Week 15 Lecture 43 Hamiltonian circuits, Eulerian graphs Lattices as boolean algebra Discrete and continuous Random Variables Mean and Standard Deviation ->Reference :2,8.7 ->Reference :2,10.3 ->Reference :3,19.7 ->Reference :3,19.7 19.8

Homework No. Homework 1 Topic of the Homework Nature of homework (group/individuals/field work

Introduction of Graph and related terms of graph , Multi graphs, subgraph, Isomorphic, homomorphism Individual graphs, Paths, Connectivity.The Bridges of Konigsberg, Transversal Multigraphs, Labeled and Weighted graphs Complete, regular and bipartite graphs, planar graphs, Graph colourings, Chromatic number. Directed graphs, Tree graphs, rooted tree Binary trees, minimal spanning tree, Prims algorithm, shortest path, Dijkstras Algorithm Partially ordered set, Hasse diagrams of POSET. Consistent Enumeration. Supremum and Infimum, Isomorphic Order Sets. Lattices, Bounded Lattices. Sample space, events, Finite probability Spaces, Conditional probability, independent events, independent repeated trials. Random variables, Baye's theorem Individual

Homework 2

Homework 3 Homework 4

Individual Individual

Component Homework Term Paper Frequency 3 1 Total :Out Of 4 Each Marks Total Marks 25 25 50 75 25 100

* 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 List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper) Sr. No. Topic 1 Applications of graph colouring. 2 Disuss the various distributions of continuous random variable. 3 Explain graph coloring and various methods to find out chromatic number of a graph and uses of graph coloring in daily routine. 4 Discuss Chinese postman problem and explain how to solve the problem 5 Explain the various algorithms to find out shortest path in a graph. 6 What are the constraints in proving 4-coloring theorm analytically 7 Explain the problem of Bridges of Konigsberg and method adopted by Euler to solve it 8 Explain various algorithms to find out minimum spanning tree. 9 Explain how graph colouring can be used in a variety of different models. 10 Discuss various discrete random variables and distributions. 11 Explain Baye's theorem and its applications. 12 Discuss binomial distribution and poisson ditribution. Compare and differentiate. 13 Explain Random variables and probability mass function. 14 Explain theorem of Total Probability and its applications in everyday life. 15 Show that if n people attend a party and some shake hands with others (but not with themselves), then at the end, there are at least two people who have shaken hands with the same number of people. 16 Explain Eulerian and Hamiltonian circuts with examples .Discuss their applications. 5 Approved for Spring Session 2010-11

17 Discuss all kinds of graphs with examples .What are the uses of graphs in daily life.

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)

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

Introduction of Graph and related terms, Multigraphs Subgraphs, Isomorphic, homomorphism graphs Path, Connectivity, The bridges of Konigsberg

Traversable Multigraphs, Labeled and weighted graphs Problem solving Complete, Regular and Bipartite Graphs Planar Graphs, Tree graphs Graph Colorings and Chromatic Number Directed Graphs, Rooted Tree, Binary tree Problem solving Problem solving Problem solving,Test Problem solving

Minimal Spanning tree, Prim's Algorithm, Shortest path Problem solving Dijkstra's Algorithm, Propositions and compound propositions Basic Logical Operations, Truth Tables Tautologies and Contradictions Logical equivalence, Algebra of Propositions Conditional and Biconditional statements Problem solving Problem solving,Test Problem solving Problem solving Problem solving

After Mid-Term

Tutorial 15 Tutorial 16 Tutorial 17 Tutorial 18 Tutorial 19 Tutorial 20 Tutorial 21 Tutorial 22 6 Partially ordered set, Hasse Diagrams of POSET Consistent Enumeration Supremum and Infimum, Isomorphic Order Sets Lattices, Bounded Lattices Sample space and events, Finite Probability Spaces Conditional Probability, Independent Events Independent Repeated Trials Random Variables, Baye's Theorem Problem solving Problem solving Problem solving Problem solving Problem solving Problem solving Problem solving,Test Problem solving Approved for Spring Session 2010-11

Random Variables, Probability Mass Functions Binomial Distribution, Poisson Distribution Geometric Distribution Expectation, Variance of Random Variable

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.