====== MTH211: Discrete Mathematics (Fall 2020) ======
~~NOTOC~~
=====Course Objectives:=====
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.
=====Course Contents:=====
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.
===== Notes, assignments, quizzes & handout =====
Here is the list of contents covered in different lecture with reference to book.
===Lectures===
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 | {{ :atiq:sp21-mth211-lec01.pdf |Download PDF}}
* Lecture 02 | {{ :atiq:sp21-mth211-lec02.pdf |Download PDF}}
* Lecture 03 | {{ :atiq:sp21-mth211-lec03.pdf |Download PDF}}
* Lecture 04 | {{ :atiq:sp21-mth211-lec04.pdf |Download PDF}}
* Lecture 05 | {{ :atiq:sp21-mth211-lec05.pdf |Download PDF}}
* Lecture 06 | {{ :atiq:sp21-mth211-lec06.pdf |Download PDF}}
* Lecture 07 | {{ :atiq:sp21-mth211-lec07.pdf |Download PDF}}
* Lecture 08 | {{ :atiq:sp21-mth211-lec08.pdf |Download PDF}}
* Lecture 09 | {{ :atiq:sp21-mth211-lec09.pdf |Download PDF}}
* Lecture 10 | {{ :atiq:sp21-mth211-lec10.pdf |Download PDF}}
* Lecture 11 | {{ :atiq:sp21-mth211-lec11.pdf |Download PDF}}
===Quiz/Assignment===
* Assignment 01 | {{ :atiq:a1-sp21-mth211.pdf | Download PDF}} |