Page 1 of 4

KAKATIYA INSTITUTE OF TECHNOLOGY & SCIENCE, WARANGAL

LECTURE SCHEDULE

U18MH304 :DISCRETE MATHEMATICS

Academic year 2018-19
Name of Subject and Code : U18 MH304 : DISCRETE MATHEMATICS
Branch : Common to CSE & IT branches
Semester : III semester
Course Learning Objectives

This course will develop students’ knowledge in/on

 necessary mathematical concepts that are prerequisite for computer related subjects namely
database management systems, knowledge based systems and artificial intelligence..

different types of logics namely first-order logic ,quantifier logic and predicator logic so as to gain
 knowledge of artificial intelligence..
 elementary combinations and permutations with/without repetitions, different methods of
solving recurrence relations
 concepts and algorithms related to various types of graphs, trees and applications to real life
problems.

Text Book Title of the Book Author Publisher

Prescribed T1 “Discrete Mathematics for J.L.Mott, A.Kandel Prentice- Hall of India

Compute Scientists” and T.P.Baker
Reference R1 “Discrete Mathematics J.P.Tremblay, Tata McGraw- Hill edn
Structures with R.Manohar
Application to Computer
Science”
R2 “Mathematical Theory of Zohar Manna McGraw-Hill
Computation”
R3 ”Elements of Discrete C.L. Liu Tata Mc. Graw Hill
mathematics”
 Page 2 of 4

UNIT-I

Week and No. of Assignment

Topics to be covered submission
Date classes
due date
Objective:
This unit will develop students’ knowledge on necessary mathematical concepts that are prerequisite for computer
related subjects namely database management systems, knowledge based systems and artificial intelligence .
Week-1 Introduction to set theory and different examples.
Introduction to relations, binary relations and examples. 4
8.07.2019 to problems based on relations
13.07.2019

Week-2 Theorems on equivalence relations.

problems on equivalence relations..
15.07.2019 4
Introduction to ordering relations.
to
20.07.2019

Week-3 Poset and Hasse diagrams

Introduction to lattices
22.07.2019 Different type of lattices and theorems 4
to
27.07.2019

Minor Examination-1 29-07-2019 to 03-08-2019

Week-4 Operations on relations, paths

Transitive closure and adjacency matrices of binary relations
29.07.2019 4
Problems based on transitive closure and adjacency matrices of
to
03.08.2019 binary relations using Warshall’s algorithm

Outcomes:
 Upon completion of this unit, students will be able to explain the basic concepts of sets and relations and their
applications to lattice problems, to determine all the possible paths available in directed paths

UNIT-II

Week and No. of

Topics to be covered
Date classes

Objective: This unit will develop students’ knowledge on different types of logics namely first-order logic
,quantifier logic and predicator logic so as to gain knowledge of artificial intelligence.
Introduction to propositions and connectives
Week-5
Introduction to logical inferences
05.08.2019 Introducing the concept of writing the logical interferences 4
to by using given arguments
10.08.20197 Problems based on verifying the given argument by using
the truth tables.
 Page 3 of 4

Problems on verifying the given argument by using the

Week-6
inferences..
12.08.2019 Problems on verifying the given argument by using the 4
to inferences..
17.08.2019 Introduction to the concept of first order logic using
quantified propositions
Introduction to predicate calculus Assignment I
Problems based on predicate calculus
Week-7 19-08-2019
Solving problems based on Mathematical induction.
4
19.08.2019 Problems based on Pigeon hole principle.
to Methods of proofs of implication
24.08.2019 Proof by contradiction method.

Outcomes:
Upon completion of this unit, students will be able to analyze the different types of logic in order to establish
knowledge based systems, to verify numerical statements using induction.

Mid Semester Examination-I (MSE-I): 26.08.2019 to 03.09.2019.

UNIT-III

Week and No. of

Topics to be covered
Date classes

Objective: This unit will develop students’ knowledge on elementary combinations and permutations with
repetitions, different methods of solving recurrence relations.

Week-8 Introduction to elementary combinations.

Problems based on combinations and permutations.
04.09.2019 4
Problems on combinations and with/without repetitions.
to
07.09.2019)

Week -9 Problems on combinations and permutations with

constrained repetitions.
09.09.2019 4
Problems based on Principle of inclusion and exclusion
to
14.09.2019

Week-10 Introduction to the Concept of Generating function of

sequences.
16.09.2019 Determining the coefficients of generating functions. 4
to Introduction to the recurrence relations.
21.09.2019) Solving the recurrence relations by method of substitution.
 Page 4 of 4

Week-11 Solving the recurrence relations by method of characteristic

roots.
23.09.2019 Solving the recurrence relations by using generating 4
to functions.
28.09.2019) Solving non-linear recurrence relations.
.
Outcomes:
Upon completion of this unit, students will be able to analyze the different type of enumeration and apply to real
life problems.

Minor Examination-1 30-09-2019 to 05-10-2019

UNIT-IV

Week and No. of

Topics to be covered
Date classes

Objective: This unit will develop students’ knowledge on concepts and algorithms related to various types of
graphs, trees and applications to real life problems.

Week-12 Introduction to basic concepts of graphs

Different types of graphs ( sub graphs) 4
30.09.2019
Problems based on isomorphism of graphs
to
05.10.2019) Introduction to the trees and their properties Assignment-2
Dusshera Vacation 07.10.2019 to 13.10.2019
19-10-2019
Theorems on trees and binary trees
Week-14 Introduction to the spanning trees and determining the
14.10.2019 minimal Spanning trees 4
to
19.10.2019)) Krushkal’s algorithm to find minimal spanning tree

Introduction to planar graphs and Euler’s formula Multi-

graphs and Euler circuits.
Week-15 Problems based on Euler’s formula
4
Problems on Hamiltonian graphs using Grin’s berg
21.10.2019
theorem
to
26.10.2019)) Introduction to the chromatic number
Determine the Chromatic number of graphs ,Four color
Problem.
Outcomes:
 Upon completion of this unit, students will be able to solve different problems like Koenig’s Berge seven
bridges, using Euler graphs and find the chromatic number of the different graphs

Last Day of instruction: 26.10.2019

Mid Semester Examination-II (MSE-II): 28.10.2019 to 04.11.2019