Documente Academic
Documente Profesional
Documente Cultură
Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
MTH401 DISCRETE MATHEMATICS 17146::Varun Joshi 3.0 0.0 0.0 3.0
Course Orientation 1 :DISCIPLINE KNOWLEDGE, 7 :COMPETITIVE EXAMINATION(Higer Education), 8 :COMPETITIVE EXAMINATION(Civil Services)
TextBooks
Sr No Title Author Edition Year Publisher Name
T-1 DISCRETE MATHEMATICS AND KENNETH H ROSEN 7th 2011 MCGRAW HILL EDUCATION
ITS APPLICATIONS(SIE)
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 SCHAUM'S OUTLINE OF MURRAY SPIEGEL 1st 2010 MCGRAW HILL EDUCATION
CALCULUS OF FINITE
DIFFERENCES AND DIFFERENCE
EQUATIONS
R-2 Discrete Mathematics (Schaum's Seymour Lipschutz, Marc 3rd 2013 MCGRAW HILL EDUCATION
Outlines) (SIE) Lipson, Varsha H. Patil
Relevant Websites
Sr No Web address (only if relevant to the course) Salient Features
RW-1 https://classes.soe.ucsc.edu/cmpe177/Fall04/slides/digraphs.pdf Explain directed graphs
SPILL OVER
Week 7 Lecture 20 Spill Over
Lecture 21 Spill Over
MID-TERM
Week 8 Lecture 22 Graphs(Graph terminology T-1:8 RW-1 Introduction of graphs To develop a basic Discussion with Graph models
and special types of graphs) R-2:5 and special types of understanding of white board are used to
graphs and Paths, cycles graphs and road maps and
and the assignment
connectivity jobs to
employees of an
organisation.
Graphs(Paths, cycles and T-1:8 RW-1 Introduction of graphs To develop a basic Discussion with Graph models
connectivity) R-2:5 and special types of understanding of white board are used to
graphs and Paths, cycles graphs and road maps and
and the assignment
connectivity jobs to
employees of an
organisation.
Lecture 23 Graphs(Graph isomorphism) T-1:8 Isomorphism of Graphs Students will learn Brainstorming Helpful to
how to prove two problems choose most
graph are equal with convenient
different shapes representation in
working with a
graph.
Lecture 24 Graphs(Euler and Hamilton T-1:8 Euler paths and circuits, To understand the Lecture Delivery To solve puzzles
paths) Hamilton paths and difference between in day to day life
circuits Euler circuit and
Hamiltonain circuit
Week 9 Lecture 25 Graphs(Shortest path T-1:8 RW-4 Shortest path problem, To learn how to Problem solving To determine
problems) R-2:5 VL-1 Dijkstras algorithm calculate the shortest with white board whether it
path is possible to
walk
down all the
streets in
a
city without
going
down a street
twice
Lecture 26 Graphs(Planner graphs) T-1:8 RW-3 Planner graphs, Eulers To understand the Lecture Delivery To do coloring
formula, graph coloring relation among of maps of parts
and The vertices, of the world
four regions and
color theorem edges of graph
Graphs(Graph coloring) T-1:8 RW-3 Planner graphs, Eulers To understand the Lecture Delivery To do coloring
formula, graph coloring relation among of maps of parts
and The vertices, of the world
four regions and
color theorem edges of graph
Lecture 27 Trees(Tree graphs) T-1:9 Introduction to trees and It will help the Lecture delivery
students
to understand the
their properties basic
and Full m-ary tree, knowledge of tree
Binary Search tree graphs
Trees(Rooted trees) T-1:9 Introduction to trees and It will help the Lecture delivery
students
to understand the
their properties basic
and Full m-ary tree, knowledge of tree
Binary Search tree graphs
Trees(Binary search trees) T-1:9 Introduction to trees and It will help the Lecture delivery
students
to understand the
their properties basic
and Full m-ary tree, knowledge of tree
Binary Search tree graphs
Week 10 Lecture 28 Trees(Binary search trees) T-1:9 Introduction to trees and It will help the Lecture delivery
students
to understand the
their properties basic
and Full m-ary tree, knowledge of tree
Binary Search tree graphs
Trees(Rooted trees) T-1:9 Introduction to trees and It will help the Lecture delivery
students
to understand the
their properties basic
and Full m-ary tree, knowledge of tree
Binary Search tree graphs
Week 10 Lecture 28 Trees(Tree graphs) T-1:9 Introduction to trees and It will help the Lecture delivery
students
to understand the
their properties basic
and Full m-ary tree, knowledge of tree
Binary Search tree graphs
Lecture 29 Trees(Spanning trees and cut T-1:9 RW-6 Spanning trees and cut To develop a basic Problem solving Communication
sets) R-2:6 sets understanding of the networks using
ideas of spaning trees minimum cost
Lecture 30 Trees(Minimum spanning T-1:9 Minimum spanning Students will Problem solving Communication
trees) R-2:6 trees, Algorithms for learn how to calculate networks using
minimum spanning trees minimum minimum cost
spanning tree
Week 11 Lecture 31 Test3
Lecture 32 Number theory and T-1:3 AV-2 Divisibility Students will learn Discussion To generate
cryptography(Divisibility) definition,properties,The the pseudo random
division algorithm, use of modular numbers
Modular arithmetic arithmetic
Lecture 33 Number theory and T-1:3 Primes, Greatest Explores distribution Discussion In cryptographic
cryptography(Greatest common divisor, of primes and many systems
common divisor) Euclidean algorithm famous open
questions
concerning primes
Week 12 Lecture 34 Number theory and T-1:3 Solving linear Students will learn Lecture delivery
cryptography(Congruences) congruences, properties how with white board
of congruences, to solve linear
The Chinese remainder congruences as well
theorem. as
systems of linear
congruences
Lecture 35 Number theory and T-1:3 Solving linear Students will learn Lecture delivery
cryptography(Congruences) congruences, properties how with white board
of congruences, to solve linear
The Chinese remainder congruences as well
theorem. as
systems of linear
congruences
Lecture 36 Number theory and T-1:3 AV-2 Cryptography (encrypt To develop a basic Problem solving Study of secret
cryptography(Cryptography) and decrypt) understanding of the messages to
ideas of cryptography develop the
security system
which has become
an essential tool in
providing computer
and
Internet security
Week 13 Lecture 37 Number theory and T-1:3 AV-2 Cryptography (encrypt To develop a basic Problem solving Study of secret
cryptography(Cryptography) and decrypt) understanding of the messages to
ideas of cryptography develop the
security system
which has become
an essential tool in
providing computer
and
Internet security
Lecture 38 Combinatorics T-1:6 RW-7 Permutations and Students will be able Brainstorming Arrangement of
(Permutations) combination to problems numbers by
To determine the considering the
number of order
permutations
of n objects, taken r
at a time
Combinatorics T-1:6 RW-7 Permutations and Students will be able Brainstorming Arrangement of
(Combinations) combination to problems numbers by
To determine the considering the
number of order
permutations
of n objects, taken r
at a time
Lecture 39 Combinatorics T-1:6 RW-7 Permutations and Students will be able Brainstorming Arrangement of
(Combinations) combination to problems numbers by
To determine the considering the
number of order
permutations
of n objects, taken r
at a time
Combinatorics T-1:6 RW-7 Permutations and Students will be able Brainstorming Arrangement of
(Permutations) combination to problems numbers by
To determine the considering the
number of order
permutations
of n objects, taken r
at a time
Week 14 Lecture 40 Combinatorics T-1:6 RW-7 Permutations and Students will be able Brainstorming Arrangement of
(Permutations) combination to problems numbers by
To determine the considering the
number of order
permutations
of n objects, taken r
at a time
Combinatorics T-1:6 RW-7 Permutations and Students will be able Brainstorming Arrangement of
(Combinations) combination to problems numbers by
To determine the considering the
number of order
permutations
of n objects, taken r
at a time
SPILL OVER
Week 14 Lecture 41 Spill Over
Lecture 42 Spill Over
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over
Total :- 10 20