Home > Courses > Mathematics > MTH202

MTH202 : Discrete Mathematics

Course Overview

Course Synopsis

The course uses the patterns found in Sets, Relations and Functions. Mathematical ideas and concepts relevant to Logic, Combinatorics and Probability will be studied in this course. Matrices will be used to solve problems. The course also include: Mathematical Induction, Algorithm and Graph theory.

Course Learning Outcomes

At the end of the course, you should be able to:

  • Express statements with the precision of formal logic
  • Analyze arguments to test their validity
  • Apply the basic properties and operations related to sets
  • Apply to sets the basic properties and operations related to relations and functions
  • Define terms recursively
  • To prove a given statement using mathematical induction
  • To prove statements using direct and indirect methods
  • To compute probability of simple and conditional events
  • Identify and use formulae of Combinatorics in different problems
  • Illustrate the basic definitions of graph theory and properties of graphs


Course Calendar

TopicLectureResourcePage
Logic1Handouts1-5
Truth Tables2Handouts6-8
Laws of Logic3Handouts9-14
Bi-Conditional4Handouts15-18
Argument5Handouts19-20
Application of Logic6Handouts21-27
Set Theory7Handouts28-31
Venn Diagram8Handouts32-43
Set Identities9Handouts44-50
Applications of Venn Diagram10Handouts51-58
GDB # 1
Relations11Handouts59-65
Types of Relations12Handouts66-75
Matrix Representation of Relations13Handouts76-81
Inverse of Relations14Handouts82-86
ASSIGNMENT # 1
Functions15Handouts87-96
Types of Functions16Handouts97-107
Inverse Function17Handouts108-118
Composition of Functions18Handouts119-127
Sequence19Handouts128-133
Series20Handouts134-141
Quiz # 1
Recursion I21Handouts142-146
Recursion II22Handouts147-150
Mid term Examamination
Mathematical Induction23Handouts151-159
Mathematical Induction for Divisibility24Handouts160-166
Methods of Proof25Handouts167-172
Proof by Contradiction26Handouts173-179
Algorithm27Handouts180-183
Division Algorithm28Handouts184-187
GDB # 2
Combinatorics29Handouts188-194
Permutations30Handouts195-201
Combinations31Handouts202-206
K-Combinations32Handouts207-212
Tree Diagram33Handouts213-219
Inclusion-Exclusion Principle34Handouts220-224
Probability35Handouts225-231
ASSIGNMENT # 2
Laws of Probability36Handouts231-238
Conditional Probability37Handouts239-244
Random Variable38Handouts245-252
Introduction to Graphs39Handouts253-260
Paths and Circuits40Handouts261-266
Quiz # 2
Matrix Representation of Graphs41Handouts267-273
Isomorphism of Graphs42Handouts274-281
Planar Graphs43Handouts282-288
Trees44Handouts289-294
Spanning Trees45Handouts295-304
Final Examination
Any kind of change in the schedule during semester will be announced on VULMS
 
 
Back to Top