COURSE DATA SHEET DIET/7.5.

1/FT 04

DHANEKULA INSTITUTE OF ENGINEERING & TECHNOLOGY

(AUTONOMOUS)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Course Data Sheet

Name of the Program : B.Tech in CSE(AI&ML) Academic Year: 2023-24

Year & Semester: II Year I Semester Section: A, B No of Credits: 03
Name of the Course: MFCS Code : R20C202
Course: Core Regulation: R20
Area: Discrete Mathematics No of students registered: 64/60
Name of the Faculty : Mr.Ch.Sunil
Designation: Asst.Professor

Preface of the course: Knowledge with basic mathematical implications for computer science.
The formal appearance of the discrete mathematics includes set theory, algebraic systems,
Combinatory, Boolean algebra, propositional logic, and other relevant issues. Likewise, abstract
models of computations, models of computability, language theory concepts, and the application
of language theory ideas are the subject matter of the concepts of automata and formal languages.
The goal of this course is to;
1. Understand the concepts of Propositional calculus
2. Simplify Set theory and Functions
3. Understand Combinatorics and Number Theory
4. Simplify recurrence relations
5. Understand concepts of Graph Theory.

Course Syllabus Unit Wise:

UNIT-I:Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives,
Well Formed Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law,
Tautological Implications, Normal Forms, Theory of Inference for Statement Calculus,
Consistency of Premises, Indirect Method of Proof, Predicate Calculus: Predicates, Predicative
Logic, Statement Functions, Variables and Quantifiers, Free and Bound Variables, Inference
Theory for Predicate Calculus.

UNIT -II: Set Theory: Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations:
Properties, Operations, Partition and Covering, Transitive Closure, Equivalence, Compatibility
and Partial Ordering, Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation,
and Recursive Functions, Lattice and its Properties, Algebraic Structures: Algebraic Systems,
Properties, Semi Groups and Monoids, Group, Subgroup and Abelian group, Homomorphism,
Isomorphism.

UNIT- III: Combinatorics: Basis of Counting, Permutations, Permutations with Repetitions,

Circular and Restricted Permutations, Combinations, Restricted Combinations, Binomial and
Multinomial Coefficients and Theorems, Number Theory: Properties of Integers, Division
Theorem, Greatest Common Divisor, Euclidean Algorithm, Least Common Multiple, Testing for
Prime Numbers, The Fundamental Theorem of Arithmetic, Modular Arithmetic, Fermat’s and
Euler’s Theorems
COURSE DATA SHEET DIET/7.5.1/FT 04

UNIT -IV: Recurrence Relations: Generating Functions, Function of Sequences, Partial

Fractions, Calculating Coefficient of Generating Functions, Recurrence Relations, Formulation as
Recurrence Relations, Solving Recurrence Relations by Substitution and Generating Functions,
Method of Characteristic Roots, Solving Inhomogeneous Recurrence Relations

UNIT -V: Graph Theory: Basic Concepts, Graph Theory and its Applications, Sub graphs,
Graph Representations: Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and
Circuits, Eulerian and Hamiltonian Graphs, Multigraphs, Bipartite and Planar Graphs, Euler’s
Theorem, Graph Colouring and Covering, Chromatic Number, Spanning Trees, Prim’s and
Kruskal’s Algorithms, BFS and DFS Spanning Trees.

Text Books:
1) Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay and
P. Manohar, Tata McGraw Hill.
2) Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D. P.
Mohapatra, 3rd Edition, Tata McGraw Hill.

Reference Books:
1) Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel and
T. P. Baker, 2nd Edition, Prentice Hall of India.
2) Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby and Sharon Cutler Ross,
PHI.
3) Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H. Rosen,
7th Edition, Tata McGraw Hill.

Prerequisites for the Course:

• Students should have knowledge on basic concepts of mathematics.

Self study: Connectives, Truth Tables, Tautologies, Variables and Quantifiers, Mathematical
Induction, Operations on Binary Sets, Principle of Inclusion and Exclusion, Properties of Binary
Relations, Sub graphs, Representation of Graphs, Binary Trees.

COURSE OBJECTIVES

At the end of the Course/Subject, the students will:

S.No Course Objectives (CObj’s) COs*
Describe propositional and predicate calculus
R20CObj 202.1 R20C202.1
& demonstrate the same with problems.
Define Sets, Relation and functions and discuss types of
R20CObj 202.2 sets, relations and functions & solve the problems on R20C202.2
relations & Functions.
Apply permutations and combinations and solve
R20CObj 202.3 problems and use binomial and multinomial theorem to R20C202.3
generate sequences in solving problems.
Apply methods to solve homogeneous and non-
R20CObj 202.4 R20C202.4
homogeneous recurrence relations.
Analyze graph and discuss types of graphs and its
R20CObj 202.5 representation & solve the problems on graphs and R20C202.5
discuss about trees. .
 COURSE DATA SHEET DIET/7.5.1/FT 04

COURSE OUTCOMES
At the end of the Course/Subject, the students will be able to:

Bloom's
PSOs
S.No Course Outcomes(COs) POS* Taxonomy &
*
Level
Define Proposition, types of Notations,
Truth-tables, and solve Normal forms & Understanding
R20C202.1 1 1,2
solve problems in propositional & (L2)
predicate calculus.
Define Sets, Relation and functions and
discuss types of sets, relations and Understanding
R20C202.2 1 1,2
functions & solve the problems on (L2)
relations & Functions.
Apply permutations and combinations
and solve problems and use binomial and
R20C202.3 1 Applying (L3)
multinomial theorem to generate 1,2
sequences in solving problems
Apply methods to solve homogeneous
R20C202.4 and non-homogeneous recurrence 2 1,2 Applying (L3)
relations.
Define graph and discuss types of graphs
and its representation & solve the Analyzing (L4)
R20C202.5 2 1,2
problems on graphs and discuss about
trees.

Course Outcomes vs. POS*Mapping:

Courses
P01 P02 P03 P04 P05 P06 P07 P08 P09 P10 P11 P12
Out Comes
COURSE DATA SHEET DIET/7.5.1/FT 04

R20C202.1 3 - - - - - - - - - - -
R20C202.2 3 - - - - - - - - - - -
R20C202.3 3 - - - - - - - - - - -
R20C202.4 - 3 - - - - - - - - - -
R20C202.5 - 3 - - - - - - - - - -
Total 9 6 - - - - - - - - - -
Average 3 3 - - - - - - - - - -

Justification of Mapping of Course Outcomes with Program Outcomes:

R20C202.1: PO1 is strongly mapped as the student will have to learn Truth-tables, and solve
Normal forms & solve problems in propositional & predicate calculus can be used in validating
facts which could be used in implement them using high-level programming languages.

R20C202.2: PO1 is strongly mapped as the student will have to learn sets, relations, functions,
and groups, which are used in high level programming languages to solve problem.

R20C202.3: PO1 is strongly mapped as the student will have to learn combinatorics and number
theory , which are used in Communication networks, cryptography and network security,
programming languages, databases ,pattern analysis, Computational molecular biology, etc.

R20C202.4: PO2 is strongly mapped as the student will have to learn Recurrence relations, which
are used in analysis of algorithms. If an algorithm is designed so that it will break a problem into
smaller sub problems (divide and conquer), its running time is described by a recurrence relation.

R20C202.5: PO2 is strongly mapped as the student will have to learn Graph theory, which can be
used in research areas of computer science such as data mining, image segmentation, clustering,
image capturing, networking etc.

Course Outcomes vs. PSOs Mapping:

Courses Out Comes PSO1 PSO2

R20C202.1 3 3
R20C202.2 3 3
R20C202.3 3 3
R20C202.4 3 3
R20C202.5 3 3
Total 15 15
Average 3 3

Justification of Mapping of Course Outcomes with Program Specific Outcomes:

R20C202.1:

PSO1 is strongly mapped because the predicate and propositional logic can be used in validating facts
which could be used in high-level programming languages.
COURSE DATA SHEET DIET/7.5.1/FT 04

PSO2 is strongly mapped because Mathematical Foundation for Computer Science is used for
competitive examinations like GATE, UGC & other entrance exams for higher studies and
employment to build a successful career.

R20C202.2:

PSO1 is strongly mapped because the predicate and propositional logic can be used in validating facts
which could be used in high-level programming languages.

PSO2 is strongly mapped because Mathematical Foundation for Computer Science is used for
competitive examinations like GATE, UGC & other entrance exams for higher studies and
employment to build a successful career.

R20C202.3:

PSO1 is strongly mapped because the predicate and propositional logic can be used in validating facts
which could be used in high-level programming languages.

PSO2 is strongly mapped because Mathematical Foundation for Computer Science is used for
competitive examinations like GATE, UGC & other entrance exams for higher studies and
employment to build a successful career.

R20C202.4:

PSO1 is strongly mapped because the predicate and propositional logic can be used in validating facts
which could be used in high-level programming languages.

PSO2 is strongly mapped because Mathematical Foundation for Computer Science is used for
competitive examinations like GATE, UGC & other entrance exams for higher studies and
employment to build a successful career.

R20C202.5:

PSO1 is strongly mapped because the predicate and propositional logic can be used in validating facts
which could be used in high-level programming languages.

PSO2 is strongly mapped because Mathematical Foundation for Computer Science is used for
competitive examinations like GATE, UGC & other entrance exams for higher studies and
employment to build a successful career.

Mention Gaps Identified (Missing Content of syllabus / Industry/Profession Requirements or

POs) if any:
S No Description Proposed action
NIL

Mention Gaps Identified (POs) if any:

Proposed
S No Gap identified Relevant to
action
 COURSE DATA SHEET DIET/7.5.1/FT 04

NIL

Topics beyond Syllabus/Advanced Topics/Design:

1. Different types of numbers and their properties
Delivery/Instructional Methodologies:
1. Lecture
2. Questioning & Discussion
Handouts:
1. Lecture Notes
Assessment Methodologies-Direct
³ Assignments
³ Mid exams
³ University Examination
Course Outcome Learning Assessment Methodologies-Indirect
³ Assessment of Course Outcomes (By Feedback, Once)
³ Student Feedback on Faculty (Twice)
Innovative Teaching/Learning/Evaluation Processes:
 Adaptive teaching is followed to focus on the whole class
 Tutorial classes are conducted to improve problem solving skills and motivate slow
learners
 Conducting remedial classes for slow learners to improve their academic
performance
 Standard cognitive tests are conducted regularly on completion of each unit.

Course Attainment Target:

INTERNAL EXTERNAL
Set Target %
55 45
50% or less number of 50% or less number of
students scoring more than students scoring more than
Attainment Level 1
55% marks in internal 45% marks in External
examination examination
51% to 69% of students 51% to 69% of students
scoring more than 55% scoring more than 45%
Attainment Level 2
marks in internal marks in External
examination examination
70% & above number of 70% & above number of
students scoring more than students scoring more than
Attainment Level 3
55% marks in internal 45% marks in External
examination examination

Signature of Course Coordinator Signature of HOD

Date: Date:
COURSE DATA SHEET DIET/7.5.1/FT 04