SRM INSTITUTE OF SCIENCE AND TECHNOLOGY
COLLEGE OF ENGINEERING AND TECHNOLOGY, KATTANKULATHUR CAMPUS
DEPARTEMNT OF MATHEMATICS
Course Code 21MAB302T L T P C 3 1 0 4
Course Title DISCRETE MATHEMATICS Faculty Name Dr. B. Sudha
Semester 2025-26 ODD Email:
[email protected]Pre-requisite / Slot & Class
C (BATCH 2)
Co-Requisite NIL Hours:
Office Day Order 5: 10.00 AM - 12.00
Lecture Hall # TP1 706 UB821A Office Hours
Location NOON
Organisation of the course
The course faculty plans to organize course delivery with a blend of lectures and interactive sessions. Lectures that teach important ideas will make up most of the classes, while
guest lectures will be incorporated to bring real-world insights. Practice sheets and Assignments will give the content more in-depth explanations. In-class tasks will assist
students in strengthening their knowledge and abilities by promoting active engagement and the application of topics.
Course Outcome(s)
1 Apply the concepts of set theory and its operations in data structures and mathematical modelling languages
2 Solve problems using counting techniques and understanding the basics of number theory
3 Comprehend and validate the logical arguments using concepts of inference theory
4 Inculcate the curiosity for applying the concepts of algebraic structures to coding theory
5 Apply graph theory techniques to solve wide variety of real world problems
Learning Materials
1. H. Kenneth Rosen, Discrete Mathematics and its Application, Seventh edition, Tata McGraw-Hill Publishing company PVT. Ltd., New Delhi, 2012. 2. J.P. Tremblay and R.
Manohar, Discrete Mathematical Structures with applications to Computer Science, 35th edition, Tata McGraw Hill Publishing Co., 2008. 3. Narsing Deo, Graph Theory with
applications to Engineering and Computer science, Prentice-Hall of India pvt. Ltd., New Delhi, 2004. 4. C.L. Liu, Elements of Discrete Mathematics, 4th Edition, McGraw
Higher ED, 2012. 5. R.P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, 4th Edition, Pearson Education Asia, Delhi, 2007. 6. T.
Veerarajan, Discrete Mathematics with Graph Theory and Combinatorics, Tata McGraw Hill, 2015.
Course Topics and Schedule
Method of delivery Assignment(s) / Learning materials to be
Unit / Module No. Topic Name No. of Hours CO
(Multi-Select) Activities referred
Sets and examples, Operations on sets, Laws of Set
1 theory- Proving set identities using laws of set 2 Lecture / smart classroom 1
theory - Partition
Relations – Properties, Equivalence relation and
1 3 Lecture / smart classroom 1
partial order relation - Posets - Hasse Diagrams
Closures of relations- examples, Transitive closure
1 2 Lecture / smart classroom 1
and warshall’s algorithm
Functions – Types - Important properties with
1 2 Lecture / smart classroom 1
proofs
1 Tutorial/ Ecurricula activities 3 Ecurricula/LMS platform 1
Total Hours (It may FT- I (Assignment
12 paper and pen mode 1
vary as per syllabus) I)
Permutation and Combination - Addition and
2 2 Lecture / smart classroom 2
product rules - Principle of inclusion and exclusion
Pigeon-hole principle and generalized pigeon-hole
2 1 Lecture / smart classroom 2
principle, Problems on pigeon-hole principle.
Divisibility - Fundamental theorem of arithmetic -
2 2 Lecture / smart classroom 2
prime factorization
Division algorithm- greatest common divisor and
2 properties-problems, Euclid’s algorithm for finding 2 Lecture / smart classroom 2
GCD(a,b)
Least common Multiple(LCM)- relation between
2 2 Lecture / smart classroom 2
LCM and GCD.
2 Tutorial/ Ecurricula activities 3 Ecurricula/LMS platform 2
Total Hours (It may FT-II (Written
12 paper and pen mode 2
vary as per syllabus) Test -I)
Propositions and Logical operators Truth values
3 1 Lecture / smart classroom 3
and truth tables.
Conditional and biconditional connectives- T. Veerarajan, Discrete
3 converse, inverse and contra positive of a given 1 Lecture / smart classroom Mathematics with Graph Theory 3
conditional - tautology and Combinatorics, Tata McGraw
Equivalences and Implications - truth table method Hill, 2015.
3 2 Lecture / smart classroom H. Kenneth Rosen, Discrete 3
and laws of logic
Rules of inference – Rule P, Rule T and Rule CP, Mathematics and its Application,
3 4 Lecture / smart classroom Seventh edition, Tata McGraw- 3
Direct and indirect methods, Inconsistency
Principle of mathematical induction. Problems Hill Publishing company PVT.
3 1 Lecture / smart classroom Ltd., New Delhi, 2012. 3
based on Mathematical Induction
3 Tutorial/ Ecurricula activities 3 Ecurricula/LMS platform 3
Total Hours (It may
12 paper and pen mode Assignment II 3
vary as per syllabus)
Groups - Axioms and properties - Permutation,
4 2 Lecture / smart classroom 4
cyclic groups - Equivalence classes
Subgroups and necessary and sufficiency of a
4 subset to be a subgroup, Group homomorphism 2 Lecture / smart classroom 4
and properties.
Rings- definition and examples, Zero devisors,
4 2 Lecture / smart classroom 4
Integral domain- fields
Hamming distance-Encoding and decoding group
4 3 Lecture / smart classroom 4
codes-error detection and correction
4 Tutorial/ Ecurricula activities 3 Ecurricula/LMS platform 4
Total Hours (It may FT-III (Written
12 paper and pen mode 4
vary as per syllabus) test II)
Graphs - Preliminaries - types - Hand shaking
5 2 Lecture / smart classroom 5
theorem - Isomorphism
Connectivity - Eulerian and Hamiltonian graphs.
5 Necessary and sufficient condition for a graph to 2 Lecture / smart classroom 5
be Eulerian- examples.
Matrix representation of graphs - Digraphs - Graph
5 2 Lecture / smart classroom 5
colouring – chromatic number
Trees - Characterizations - Spanning trees –
5 3 Lecture / smart classroom 5
Kruskal’s algorithm for minimum spanning trees.
5 Tutorial/ Ecurricula activities 3 Ecurricula/LMS platform 5
FT-IV (Written
5 12 Paper and pen mode 5
Test III)
Total Hours (It may ICT Tools / GCR Quiz/Surprise
12 5
vary as per syllabus) Classroom Test
Grading Criteria
Type of assessments Deadline Weightage Due Date (if applicable) Component
FT-I Week-3 5% 06-08-2025* Assignment- I 1
FT-II Week-6 15% 21-08-2025* Written Test -I 1,2
FT-III Week-12 15% 16-10-2025* Written Test - II 3,4
FT-IV Week-16 15% 07-11-2025* Written Test-III 5
16-10-2025* Assignment-II 2,3
LLT-I Week-16 10%
11-11-2025* Quiz / Surprise Test 1,2,3,4,5
Continuous
Total 60%
Assessment
End Semester
40%
Examination
Total 100%
Make-up Policy
Assignments / Term Project
Proper academic performance depends on students doing their work not only well, but on time. Accordingly, assignments for this course must be received on the due date
specified for the assignment. No Make-up will be available for assignments or term project. Late submissions will be evaluated at 25% less weight for that component for a
delay of up to 24 hours after which no submissions will be accepted.
Test
Prior permission of the course coordinator is required to get a make-up test. A make-up test shall be granted only in genuine cases, in the course faculty's judgment, the student
would be physically unable to appear for the test. It cannot be taken as a right to claim the test marks. The course coordinator's decision in this matter would be final.
Academic Integrity
Plagiarism or cheating will result in a grade of zero for the assignment or exam. Severe cases may result in course failure.
Contact Information
For any questions regarding the course material, please contact the course faculty via email. For urgent matters, you can visit the faculty room during office hours.
* The dates may be changed due to suspension of classes / declared holidays/ natural calamities / university functions / etc
Related
PO
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
1,2
