MTH211: Discrete Mathematics (Fall 2020)

Discrete Mathematics is branch of Mathematics which deals with discrete structures like logic. sequences, graphs, relations in contrast to Calculus. where we enjoy the continuity of functions and the set of real numbers. This course is introduction to discrete structures which are not the part of main stream courses. Discrete Mathematics has applications in Computer Science. Economics and Decision Making etc. This course will help the student to understand the basic logical system, counting principles, relations. solution of recurrence relation. solution of the problems which can be translated in simple diagrams namely Graphs and Trees and the comparison between two algorithms in the sense of efficiency. The objective of the course is to inculcate in student the skills required for decision making in non- continuous situations.

Logical forms and equivalences, conditional statements, validity of arguments, quantifiers, multiplication rule, inclusion-exclusion formulae, permutations and combinations, pigeonhole principle, binary relations. n-ary relations, equivalence relations, partial order relations, recursive relation, solution of recurrence relation by iteration and by root method, graphs .matrix representations of graphs, graphs isomorphism, trees, connectivity, Eulerian and Hamiltonian paths, spanning trees and shortest path problem. revisiting the graphs of power function, floor function, increasing and decreasing functions, big 0, little 0 and w notations, orders of polynomial functions, orders of simple algorithms, efficiency of an algorithm, exponential and logarithmic orders, efficiency of binary search algorithm.

Here is the list of contents covered in different lecture with reference to book.

Lecture 1 to 6 are based upon “Chapter 4: Logic and Propositional Calculus” of [1]. Lecture 7 to 11 are based upon “Chapter 2: Relations” of [1]. The slides of each lecture is given below. These slides only contain mathematical notions. For examples and exercise, please see [1].

• Lecture 01 | Download PDF

• Lecture 02 | Download PDF

• Lecture 03 | Download PDF

• Lecture 04 | Download PDF

• Lecture 05 | Download PDF

• Lecture 06 | Download PDF

• Lecture 07 | Download PDF

• Lecture 08 | Download PDF

• Lecture 09 | Download PDF

• Lecture 10 | Download PDF

• Lecture 11 | Download PDF

• Assignment 01 | Download PDF | <btn type=“primary” size=“xs” modal=“a1”>View Online</btn>

<modal id=“a1” size=“lg” title=“Assignment 1 SP21 MTH211”> a1-sp21-mth211.pdf </modal>

• Assignment 02 | Download PDF | <btn type=“primary” size=“xs” modal=“a2”>View Online</btn>

<modal id=“a2” size=“lg” title=“Assignment 2 SP21 MTH211”> a2-sp21-mth211.pdf </modal>

• Assignment 03 | Download PDF | <btn type=“primary” size=“xs” modal=“a3”>View Online</btn>

<modal id=“a3” size=“lg” title=“Assignment 3 SP21 MTH211”> a3-sp21-mth211.pdf </modal>

• Quiz/Assignment 04 | Download PDF | <btn type=“primary” size=“xs” modal=“qa4”>View Online</btn>

<modal id=“qa4” size=“lg” title=“Quiz-Assignment 4 SP21 MTH211”> qa4-sp21-mth604.pdf </modal>

Please click on View Online to see inside the PDF.

1. M.L. Lipson, S. Lipschutz, Schaum’s Outline of Theory and Problems of Discrete Mathematics, 3rd Edition, McGraw-Hill, New York, 1997.
2. K.H. Rosen, Discrete Mathematics and its Application, 6th Edition, McGraw-Hill, New York, 2007.
3. K.R. Parthasarathy, Basic Graph Theory. McGraw-Hill. 1994.
4. B. Bollobas, Graph Them-y. Springer Verlag. New York, 1979.
5. B. Kolman, R.C. Busby, S.C. Ross, Discrete Mathematical Structure, Prentice-Hall of India, New Delhi, 5th Edition. 2008.
6. A. Tucker, Applied Combinatorics, John Wiley and Sons. Inc New York, 2002.
7. R. Diestel, Graph Theory, 4th edition, Springer-Verlag. New York. 2010.
8. N.L. Brigs, Discrete Mathematics, Oxford University Press. 2003
9. K.A. Ross, C.R.B. Wright, Discrete Mathematics, Prentice Hall. New Jersey, 2003.