Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
MTH401 DISCRETE MATHEMATICS 13674::Kuldeep Kumar 3.0 0.0 0.0 3.0
Course Category Courses with Numerical focus
TextBooks
Sr No Title Author Edition Year Publisher Name
T-1 Discrete Mathematics and its
applications
Kenneth H Rosen 7th 2012 Tata McGraw Hill, India
T-2 Diffrence equations an introduction
with applications
Walter G. Kelley Allan C.
Peterson
2nd 2001 Academic Press, USA
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 Elements of discrete Mathematics C.L.Liu 2nd 2000 Tata McGraw Hill, India
R-2 Calculus of Finite Differences and
Difference Equations
Murray Spiegel 1st 2010 Schaum Series McGraw Hill
Relevant Websites
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 http://classes.soe.ucsc.edu/cmpe177/Fall04/slides/digraphs.pdf Explains directed graph
RW-2 http://walrandpc.eecs.berkeley.edu/126notes.pdf Explains Euler circuit and Hamiltonian circuit
RW-3 http://rutherglen.science.mq.edu.au/wchen/lnentfolder/lnent.html Explains elementary techniques of number theory
RW-4 http://www.personal.kent.edu/~rmuhamma/GraphTheory/MyGraphTheory/trees.htm Explains tree graphs
RW-5 www.cl.cam.ac.uk/teaching/2003/Probability/prob07.pdf Explains difference equations
Audio Visual Aids
Sr No (AV aids) (only if relevant to the course) Salient Features
AV-1 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-
mathematics-for-computer-science-fall-2010/video-lectures/lecture-10-graph-theory-iii/
Explains graphs and basic terminology. It also covers Euler's and
Hamiltonian paths
AV-2 http://video.mit.edu/watch/6042-lecture-5number-theory-ii-10380/ Explains number theory
AV-3 http://freevideolectures.com/Course/2301/Computational-Science-and-Engineering-I/3 Explains difference equations and their solutions
AV-4 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-
mathematics-for-computer-science-fall-2010/video-lectures/lecture-8-graph-theory-ii-
minimum-spanning-trees/
Explores the various measures of connectivity of graphs and how these
can be used to categorize and analyze graphs
Week
Number
Lecture
Number
Broad Topic(Sub Topic) Chapters/Sections
of Text/reference
books
Other Readings,
Relevant
Websites, Audio
Visual Aids,
software and
Virtual Labs
Lecture Description Learning Outcomes Pedagogical Tool
Demonstration/ Case
Study / Images /
animation / ppt etc.
Planned
Week 1 Lecture 1 Difference equations with constant
coefficients(Difference equation)
T-2:Ch 2.1
R-2:Page 150
RW-5 Difference operator,
Definition of a difference
equation, order of a
difference equation
It provides the basic
knowledge of
difference equations
Discussion
Lecture 2 Difference equations with constant
coefficients(Solution of a
difference equation)
R-2:Page 150-151 General and particular
solution of a difference
equation
Show knwoledge of
solutions of difference
equations
Brainstorming
problems
Lecture 3 Difference equations with constant
coefficients(Homogeneous linear
difference equations with constant
coefficients)
T-2:Ch 3.1/3.3
R-2:Page 152-153
Linear difference
equation, Homogeneous
linear difference
equations with constant
coefficients
To solve linear
difference equations
with constant
coefficients
Brainstorming
problems
Week 2 Lecture 4 Difference equations with constant
coefficients(Homogeneous linear
difference equations with constant
coefficients)
T-2:Ch 3.1/3.3
R-2:Page 152-153
Linear difference
equation, Homogeneous
linear difference
equations with constant
coefficients
To solve linear
difference equations
with constant
coefficients
Brainstorming
problems
Lecture 5 Difference equations with constant
coefficients(Homogeneous linear
difference equations with constant
coefficients)
T-2:Ch 3.1/3.3
R-2:Page 152-153
Linear difference
equation, Homogeneous
linear difference
equations with constant
coefficients
To solve linear
difference equations
with constant
coefficients
Brainstorming
problems
Lecture 6 Difference equations with constant
coefficients(Linearly independent
solutions)
T-2:Ch 3.2
R-2:Page 157
Linearly independence of
solutions
To understand the
linearly independence
of solutions
Brainstorming
problems
Week 3 Lecture 7 Difference equations with variable
coefficients(Solution of the non-
homogeneous equation)
T-2:Ch 3.1
R-2:Page 154-157
RW-5 Solution of the non
homogeneous equation
To find solution of non
homogeneous
difference equations
Discussion
Detailed Plan For Lectures
LTP week distribution: (LTP Weeks)
Weeks before MTE 7
Weeks After MTE 7
Spill Over 3
Week 3 Lecture 8 Difference equations with variable
coefficients(Methods of finding
particular solutions)
T-2:Ch 3.2-3.3
R-2:Page 154-157
AV-3 Method of Undetermined
Coefficients, Special
Operator Methods,
Method of
Variation of Parameters,
Method of Reduction of
Order, Method of
Generating Functions
To understand special
techniques to solve
difference equations
Discussion
Lecture 9 Difference equations with variable
coefficients(Methods of finding
particular solutions)
T-2:Ch 3.2-3.3
R-2:Page 154-157
AV-3 Method of Undetermined
Coefficients, Special
Operator Methods,
Method of
Variation of Parameters,
Method of Reduction of
Order, Method of
Generating Functions
To understand special
techniques to solve
difference equations
Discussion
Week 4 Lecture 10 Difference equations with variable
coefficients(Methods of finding
particular solutions)
T-2:Ch 3.2-3.3
R-2:Page 154-157
AV-3 Method of Undetermined
Coefficients, Special
Operator Methods,
Method of
Variation of Parameters,
Method of Reduction of
Order, Method of
Generating Functions
To understand special
techniques to solve
difference equations
Discussion
Lecture 11 Difference equations with variable
coefficients(Linear difference
equations with variable
coefficients)
T-2:Ch 3.5
R-2:Page 157-158
Factorization of the
operator, Variation of
parameters, Generating
functions, Series
solutions
To solve the problems
which are naturally
formulated as linear
equations
Brainstorming
problems
Lecture 12 Difference equations with variable
coefficients(Nonlinear difference
equations)
T-2:Ch 3.6
R-2:Page 159
Transformations to
change nonlinear
difference equations to
linear difference
equations
Certain methods of
analysis of non linear
equations
Brainstorming
problems
Week 5 Lecture 13 Relations(Relations and their
properties)
T-1:Ch 9.1 Relations on a set,
properties of relations
Students will learn
about relations and their
basic properties
Brainstorming
problems
Lecture 14 Test 1
Lecture 15 Relations(Equivalence relations) T-1:Ch 9.5 Equivalence relations,
Equivalence Classes
Explore equivalence
relations
Brainstorming
problems
Week 6 Lecture 16 Relations(Partial ordering
relations)
T-1:Ch 9.6 Partial ordering relations,
Posets
It will help the students
to understang the
knowledge of poset
Discussion
Lecture 17 Relations(Partial ordering
relations)
T-1:Ch 9.6 Partial ordering relations,
Posets
It will help the students
to understang the
knowledge of poset
Discussion
Week 6 Lecture 18 Relations(Hasse diagrams) T-1:Ch 9.6 Hasse diagrams It will help the students
to draw the Hasse
diagrams
Brainstorming
problems
Week 7 Lecture 19 Relations(Maximal and minimal
elements)
T-1:Ch 9.6 Maximal and minimal
elements, Supremium
and
infimium
It will help the students
to find out the lowest
and highest value of
any set by using hasse
diagramme
Brainstorming
problems
Lecture 20 Relations(Lattice) T-1:Ch 9.6 Lattice Students will have an
appreciation of sets in
the real world
Brainstorming
problems
Relations(Sublattice) T-1:Ch 9.6 Sublattice Students will have an
appreciation of sets in
the real world
Brainstorming
problems
Lecture 21 Relations(Bounded Lattice) T-1:Ch 9.6 Bounded Lattice Students will have an
appreciation of sets in
the real world
Brainstorming
problems
MID-TERM
Week 8 Lecture 22 Graphs(Graph terminology and
special types of graphs)
T-1:Ch 10.1-10.2
R-1:Ch 5.2-5.3
RW-1 Introduction of graphs
and special types of
graphs
To develop a basic
understanding of graphs
Discussion
Lecture 23 Graphs(Graph isomorphism) T-1:Ch 10.3 Isomorphism of Graphs To solve the wide
variety of problems that
can be studied using
graphs
Brainstorming
problems
Lecture 24 Graphs(Graph isomorphism) T-1:Ch 10.3 Isomorphism of Graphs To solve the wide
variety of problems that
can be studied using
graphs
Brainstorming
problems
Week 9 Lecture 25 Graphs(Paths, cycles and
connectivity)
T-1:Ch 10.4 RW-2 Paths, cycles and
connectivity
To determine whether
two
computers are
connected by a
communications link
using graph models of
computer networks
Discussion
Lecture 26 Graphs(Euler and Hamilton paths) T-1:Ch 10.5 RW-2
AV-1
Euler paths and circuits,
Hamilton paths and
circuits
To understand the
difference between
Euler circuit and
Hamiltonain circuit
Discussion
Lecture 27 Graphs(Shortest path problems) T-1:Ch 10.6
R-1:Ch 5.5
AV-4 Shortest path problem,
Dijkstras algorithm
To determine whether it
is possible to walk
down all the streets in a
city without going
down a street twice
Discussion
Week 10 Lecture 28 Graphs(Planner graphs) T-1:Ch 10.7 Planner graphs, Eulers
formula
To understand the
relation among vertices,
regions and
edges of graph
Brainstorming
problems
Lecture 29 Test 2
Lecture 30 Graphs(Graph coloring) T-1:Ch 10.8 Graph coloring, The four
color theorem
To find the number of
colors needed to color
the regions of a map
Discussion
Week 11 Lecture 31 Trees(Tree graphs) T-1:Ch 11.1 RW-4 Introduction to trees and
their properties
It will help the students
to understand the basic
knowledge of tree
graphs
Discussion
Trees(Rooted trees) T-1:Ch 11.1 Rooted trees It will help the students
to understand the basic
knowledge of tree
graphs
Brainstorming
problems
Lecture 32 Trees(Binary search trees) T-1:Ch 11.2
R-1:Ch 6.5
Binary search trees To develop algorithms
to construct networks
Brainstorming
problems
Lecture 33 Trees(Spanning trees and cut sets) T-1:Ch 11.4
R-1:Ch 6.6
Spanning trees and cut
sets
To develop a basic
understanding of the
ideas of trees
Brainstorming
problems
Week 12 Lecture 34 Trees(Minimum spanning trees) T-1:Ch 11.5
R-1:Ch 6.7
Minimum spanning
trees, Algorithms for
minimum spanning trees
Students will
understand minimal
spanning tree
Brainstorming
problems
Lecture 35 Combinatorics(Permutations) T-1:Ch 6.3
R-1:Ch 3.3
Permutations Students will be able to
To determine the
number of permutations
of n objects, taken r at a
time
Brainstorming
problems
Combinatorics(Combinations) T-1:Ch 6.3
R-1:Ch 3.4
Combinations Students will be able to
To determine the
number of
combinations of n
objects, taken r at a
time
Brainstorming
problems
Lecture 36 Number theory and cryptography
(Divisibility)
T-1:Ch 4.1 AV-2 The division algorithm,
Modular arithmetic
Students will learn the
use of modular
arithmetic
Discussion
Week 13 Lecture 37 Test 3
Lecture 38 Number theory and cryptography
(Least common multiples)
T-1:Ch 4.3 Least common multiple Explores distribution
of primes and many
famous open questions
concerning primes
Brainstorming
problems
Number theory and cryptography
(Greatest common divisor)
T-1:Ch 4.3 Primes, Greatest
common divisor,
Euclidean algorithm
Explores distribution
of primes and many
famous open questions
concerning primes
Discussion
Week 13 Lecture 39 Number theory and cryptography
(Congruences)
T-1:Ch 4.4 Solving congurences,
The Chinese remainder
theorem
Students will learn how
to solve linear
congruences as well as
systems of linear
congruences
Brainstorming
problems
Week 14 Lecture 40 Number theory and cryptography
(Congruences)
T-1:Ch 4.4 Solving congurences,
The Chinese remainder
theorem
Students will learn how
to solve linear
congruences as well as
systems of linear
congruences
Brainstorming
problems
Lecture 41 Number theory and cryptography
(Cryptography)
T-1:Ch 4.6 Cryptography To develop a basic
understanding of the
ideas of cryptography
which has become
an essential tool in
providing computer and
Internet security
Brainstorming
problems
Lecture 42 Number theory and cryptography
(Cryptography)
T-1:Ch 4.6 Cryptography To develop a basic
understanding of the
ideas of cryptography
which has become
an essential tool in
providing computer and
Internet security
Brainstorming
problems
SPILL OVER
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over
Scheme for CA:
Component Frequency Out Of Each Marks Total Marks
Test 2 3 10 20
Total :- 10 20
Details of Academic Task(s)
AT No. Objective Topic of the Academic Task Nature of Academic Task
(group/individuals/field
work
Evaluation Mode Allottment /
submission Week
Test 1 To check the
understanding of
concepts of
difference equations.
Difference operator, Definition of a difference equation, Order of
a difference equation, General and particular solution of a
difference equation, Linear difference equation, Homogeneous
linear difference equations with constant coefficients, Linearly
independence of solutions, Solution of the non homogeneous
equation, Methods of finding particular solutions, Linear
difference equations with variable coefficients, Nonlinear
difference equations.
Individual Test should be of 30
marks containing
four questions and
weightage of each
question should be
multiple of five.
4 / 5
Test 2 To check the
understanding of
concepts of graph
theory, graph
representations and
the basic classes of
graphs.
Introduction of graphs and special types of graphs, Isomorphism
of Graphs, Paths, cycles and connectivity, Euler paths and
circuits, Hamilton paths and circuits, Shortest path problem,
Dijkstras algorithm.
Individual Test should be of 30
marks containing
four questions and
weightage of each
question should be
multiple of five.
9 / 10
Test 3 To check the
understanding of
concepts of tree
graphs
Planner graphs, Euler's formula, Graph coloring, The four color
theorem, Introduction to trees and their properties, Rooted trees,
Binary search trees, Spanning trees and cut sets, Minimum
spanning trees, Algorithms for minimum spanning trees.
Individual Test should be of 30
marks containing
four questions and
weightage of each
question should be
multiple of five.
12 / 13