Course Code: 23MAT305 Course Title: Discrete Mathematics
Course Category: Minor Course Level: Introductory
L:T:P (Hours/Week) Total Contact Periods: Max Marks:
Credits: 4 60
3: 0: 2 100
Course Objectives:
The objective of the course is aimed to equip engineering students with the mathematical
tools and reasoning skills needed for effective problem-solving and analytical thinking in
their respective fields.
Module I 22+8 Hours
Logic: Propositions- Logical operators – Logical equivalences and implications - Normal
forms – Rules of inference - Consistency and inconsistency - Theory of Inference – Proofs
– Predicates – Quantifiers - Universe of discourse – Validity of arguments..
Relations and Functions: Relations – Types of relations – Properties of relations
- Equivalence relations – Relational matrix - Graph of relations – Partial ordering relation
- Poset – Hasse Diagram. Functions - Type of functions: Injective, surjective and bijective
functions – Composition of functions – Inverse functions.
Combinatorics: Mathematical induction - Basics of counting – Pigeon hole principle –
Permutations with and without repetition – Circular permutation – Combinations.
Module II 23+7 Hours
Recurrence relations: Recurrence relations - Solution of linear recurrence relations.
Algebraic Structures: Algebraic Systems – properties – Semi groups and monoids –
Groups - Sub groups- Homomorphism – Abelian group – Cyclic group – Normal subgroup
and Cosets – Lagrange’s theorem – Codes and Group codes.
Divisibility and Congruence: Division Algorithm – Prime and Composite Numbers –
Fundamental theorem of Arithmetic - Euclidean algorithm - GCD and LCM –
Congruence – Linear congruence – Chinese Remainder Theorem.
Course Outcomes Cognitive
At the end of this course, students will be able to: Level
CO1: Apply propositional and predicate logic to solve engineering Apply
problems and implementing the concepts of sets, relations and
functions in discrete structures.
CO2: Solve problems using combinatorial techniques, such as counting Apply
principles, permutations and combinations in the context of algorithm
design and analysis.
CO3: Apply the concepts of groups and its properties to algebraic Apply
structures and solve system of linear congruence equations using
Chinese Remainder Theorem.
