Lesson Plan

Subject: Discrete Mathematics Academic Year: 2013-14 Name of the Faculty: MOHAMMED SARFARAZ AHMED Theory Class: B.E. 2/4 (IT B)
No. of classes planned & Reference 3(R1)

Subject Code: BIT201 Semester: I Faculty Code: MSA

PERIOD

UNITS

TOPIC Logic, Sets and Functions: Logic, Propositional equivalences Predicates and quantifiers Nested quantifiers-Sets-Set Operations, Functions. Algorithms, Complexity of Algorithms

Proposed Class Date 2-7-2013 3-7-2013

Class Held On

Remarks

I The Integers and Division Integers and Algorithms Applications of Number Theory Matrices Total Mathematical Reasoning, Induction, and Recursion: Proof Strategy, Sequence and Summation, Mathematical Induction, Recursive Definitions and Structural Induction, Recursive Algorithms. II Counting Basics Pigeonhole principle, Permutations and combinations Binomial Coefficients, Generalized Permutations and combinations, Generating permutations and combinations III Total Discrete Probability: An Introduction to Discrete Probability theory Expected Value and Variance Advanced Counting Techniques: Recurrence relations Solving Recurrence Relations, - Divide and conquer relations and Recurrence Relations Generating function Inclusion Exclusion Applications of Inclusion Exclusion.

3(R1) 3(R1) 3(R1) 1(R1) 1(R1) 14

8-7-2013 9-7-2013 10-7-2013 15-7-2013 16-7-2013 17-7-2013 20-7-2013 22-7-2013 23-7-2013

3(R1)

1(R1) 2(R1) 2(R1) 08

24-7-2013 27-7-2013 29-7-2013 30-7-2013

31-7-2013 2(R1) 2(R1) 3(R1) 3(R1) 3-8-2013 5-8-2013 6-8-2013 7-8-2013 12-8-2013 13-8-2013

14-8-2013 Total Graphs: Introduction IV Graph terminology, representing Graphs Graph Isomorphism, Connectivity Euler and Hamiltonian paths, Shortest path problems, Planar graphs, Graph coloring Total Trees: Introduction to Trees, Application of Trees Tree Traversal, Spanning Trees 2(R1) Minimum Spanning Trees V Boolean algebra: Boolean function, representing Boolean function Logic Gates, Minimization of Circuits. 3(R1) Total Total no of Classes : 12 55 2(R1) 3(R1) 10 3(R1) 3(R1) 2(R1) 17-8-2013 19-8-2013 20-8-2013 21-8-2013 21-8-2013 31-8-2013 2-9-2013 3-9-2013 4-9-2013 10-9-2013 11-9-2013 16-9-2013 17-9-2013 18-9-2013 23-9-2013 24-9-2013 25-9-2013 30-9-2013 1-10-2013 7-10-2013 8-10-2013 15-10-2013

3(R1) 11 2(R1)

Books Suggested: Text Book: R1. Kenneth H.Rosen Discrete Mathematics and its application 5th edition, Mc Graw Hill, 2003. References: R2. J. K. Sharma, Discrete Mathematics, Second edition, Macmillan, 2005. R3. J.P.Trembly, R.Manohar, Discrete Mathematical Structure with Application to Computer Science, Mc Graw- Hill 1997. R4. Joel. Mott. Abraham Kandel, T.P.Baker, Discrete Mathematics for Computer Scientists& Mathematicians

With Effect From The Academic Year 2011-2012 BIT 201 DISCRETE MATHEMATICS Instruction 4 Periods per week Duration of University Examination 3 Hours University Examination 75 Marks

Sessional 25 Marks

UNIT I Logic Sets and Functions Logic, Propositional equivalences Predicates and quantifiers nested quantifiers-Sets-Set Operations, Functions.Algorithms- Integers Matrices : Algorithms, Complexity of Algorithms. The Integers and Division, Integers and Algorithms, Applications of Number Theory, Matrices. UNIT II Mathematical Reasoning, Induction, and Recursion: Proof Strategy, Sequence and Summation, Mathematical Induction, Recursive Definitions and Structural Induction, Recursive Algorithms.Counting Basics, Pigeonhole principle, Permutations and combinations Binomial Coefficients, Generalized Permutations and combinations, Generating permutations and combinations. UNIT III Discrete Probability: An Introduction to Discrete Probability theory, Expected Value and Variance.Advanced Counting Techniques: Recurrence relations Solving Recurrence Relations, - Divide and conquer relations and Recurrence Relations, Generating function Inclusion Exclusion Applications of Inclusion Exclusion. UNIT IV Relations Relations & their Properties, n-ray relations and applications, Representing relations Closures, equivalence relations, partial orderings.Graphs: Introduction, Graph terminology, representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamiltonian paths, Shortest path problems, Planar graphs, Graph coloring. UNIT V Trees: Introduction to Trees, Application of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees. Boolean Algebra: Boolean function, Representing Boolean functions, Logic Gates, Minimization of Circuits. Suggested Reading: 1. Kenneth H.Rosen Discrete Mathematics and its application 5thedition, Mc Graw Hill, 2003. 2. J. K. Sharma, Discrete Mathematics, Second edition, Macmillan, 2005. 3. J.P.Trembly, R.Manohar, Discrete Mathematical Structure with Application to Computer Science, Mc Graw- Hill 1997. 4. Joel. Mott. Abraham Kandel, T.P.Baker, Discrete Mathematics for Computer Scientist & Mathematicans, Prentiee Hail N.J., 2nd edition