Faculty Action Plan for Teaching Assignment(s) during : 05th Jan. 20th Apr.

, 2017

Name of
Programme B. Sc. B. Ed. Semesters IInd Sem. Year Ist
(with branch)
Discrete
Paper Titles Paper Codes BS - 204
Mathematics
Unit/Topics
Assigned for
Teaching
Unit 1 to 4
(during 5th Jan.-
20th Apr., 2017)
paper wise
Allotment of Lectures = 03 Hours per week
Allotment of Tutorials = 00
Allotment of Practical = 02 Hours per week
Name of Cellphone E-Mail ID
Faculty Kapil Pal 9660044782 palkapiljnu@gmail.com

Objective(s) of the subjects/topics being taught (paper wise):

Reason mathematically about basic (discrete) structures (such as numbers, sets, graphs, and
trees)used in computer science.
Use of mathematical and logical notation to define and formally reason about mathematical
concepts such as sets, relations, functions, and integers, and discrete structures like trees,
graphs, and partial orders.
Evaluate elementary mathematical arguments and identify fallacious reasoning.
Construct inductive hypothesis and carry out simple induction proofs.
Use graph theoretic models and data structures to model and solve some basic problems in
Informatics (e.g., network connectivity, etc.)
Prove elementary arithmetic and algebraic properties of the integers, and modular arithmetic,
explain some of their basic applications in Informatics, e.g., to cryptography.
Compare the asymptotic growth growth rates of basic functions; derive asymptotic bounds, and
limits, for simple series and recurrence relations. Use these to derive bounds on the resource
consumption (e.g., running time) of simple iterative and recursive algorithms.
Calculate the number of possible outcomes of elementary combinatorial processes such as
permutations and combinations.
Be able to construct discrete probability distributions based on simple combinatorial processes,
and to calculate the probabilities and expectations of simple events under such discrete
distributions.

Prerequisite:(should know the following, to be assessed before starting the course, otherwise take a
few lectures to acquaint them with these perquisite).
Text Books to be required:
1. Introduction to discrete Mathematics Wayne Dymacek, Henry Sharp,jr., Mc Graw-Hill
2. Discrete Mathematics Richard Johsonbaugh, Pearson Education.
3. Discrete Mathematics, Schaums Outlines.
4. Discrete Mathematics, Kolman, Busby, Ross; Pearson Education India.
5. Discrete Mathematics Structures, V.B.L.Chaurasia and Amber Srivastava, Genius
Publications.
Time Table
Total expected periods from 5th January, 2017 till end of Semester

Name of the Max.

Mon Tues Wed Thurs Fri Sat
Paper(s) Available
Discrete
Mathematic 16 15 14 45
s

Lecture Plan (Paper/course wise to be taught in separate sheet)

Ref.
Days for Teaching
Sr. Textbook/ Hours
Contents Completio Methodlogy
No. Periodical/ Scheduled
n BB/BP/SB
Websites
UNIT I
Sets and Relation- Discrete
1 1 1 BB
Cardinality Mathematics,
Principle of inclusion and Schaums Outlines
2 exclusion, Mathematical 1 1 BB
induction
Relation - Binary relation,
3 Equivalence relations and 2 2 BP
partitions,
4 partial order relations 1 1 BB
5 Functions 2 2 BP
6 Pigeon Hole principles 1 1 BB
Assignment I
UNIT II
Logic and Boolean Discrete
7 1 1 BB
Algebras-Propositions, Mathematics,
truth table and connectives, Kolman,
8 1 1 SB
tautologies, Busby,Ross;
logical equivalence, Pearson Education
9 India. 1 1 BB
argument.
Boolean algebra, Boolean
10 2 2 BB
functions and expressions,
11 min-terms and max-terms, 1 1 BB
12 normal form, C.N.F.,D.N.F. 2 2 BB
Assignment II
Mid Term I Exam.
UNIT III
Graphs- Basic terminology, Discrete
13 Multigraphs, complete Mathematics 2 2 BB
graph, Structures,
Bipartite graph, Weighted V.B.L.Chaurasia
14 1 1 BB
graphs, walk, and Amber
Paths and Circuits, Euler Srivastava, Genius
15 Publications. 2 2 BB
graphs
16 Hamiltonian graph. 1 1 BB
17 Shortest path: Dijkastras 1 1 BB
Algorithm.
 Union, Joint, Product and
composition of graphs,
18 Planar graphs. 2 2 BB

Assignment III
UNIT IV
Trees- Properties. Spanning Discrete
19 tree, Mathematics 2 2 SB
Richard
20 prims Algorithm, Johsonbaugh, 1 1 BP
minimal tree, Binary and Pearson
21 Rooted tree, m-ary tree. Education. 1 1 BB

Digraphs- simple digraph. And

22 Asymmetric digraphs, 2 2 BB
Discrete
Symmetric digraphs and Mathematics
23 complete digraphs.. 1 1 BB
Structures,
V.B.L.Chaurasia
Digraph and Binary
and Amber
24 relations 2 2 BB
Srivastava, Genius
Publications.
Assignment IV
Mid Term II Exam.
Total Lectures 34 34

Course Outcomes:
On completion of this course content the student should have acquired the following reasonable level
of knowledge/competence:
1. Understand the notion of mathematical thinking, mathematical proofs, and algorithmic
thinking, and be able to apply them in problem solving.
2. Understand the basics of discrete probability and number theory, and be able to apply the
methods from these subjects in problem solving.
3. Be able to use effectively algebraic techniques to analyse basic discrete structures and
algorithms.
4. Understand asymptotic notation, its significance, and be able to use it to analyse asymptotic
performance for some basic algorithmic examples.
5. Understand some basic properties of graphs and related discrete structures, and be able to relate
these to practical examples.
Note: The completed information should be sent to the VC Office before the commencement of
the new semester i.e. by January 2, 2017.

(Signature of the Director/(Sr.) Joint Director/Dy. Director) (Signature of the Faculty)

Academic Aims
To introduce students to language and methods of the area of Discrete Mathematics. The focus of the
module is on basic mathematical concepts in discrete mathematics and on applications of discrete
mathematics in algortihms and data structures. To show students how discrete mathematics can be
used in modern computer science (with the focus on algorithmic applications).
Learning Outcomes
On completion of the module the student should:
Understand the notion of mathematical thinking, mathematical proofs, and algorithmic
thinking, and be able to apply them in problem solving.
Understand the basics of discrete probability and number theory, and be able to apply the
methods from these subjects in problem solving.
Be able to use effectively algebraic techniques to analyse basic discrete structures and
algorithms.
Understand asymptotic notation, its significance, and be able to use it to analyse asymptotic
performance for some basic algorithmic examples.
Understand some basic properties of graphs and related discrete structures, and be able to relate
these to practical examples.
Content
Introduction to combinatorics: counting techniques, pigeonhole principle, inclusion-exclusion.
Recurrence relations, solving recurrences using generating functions.
Master Theorem for solving recurrences.
Graphs. Basic graph algorithms. Trees. Applications of graphs.
Applications of linear algebra and matrix algebra in algorithms (e.g., in web searching).
Algorithmic applications of random processes and Markov chains, for example, cover time in
graphs and card shuffling.
Partitions, enumerations with symmetries.