CSEG1012 Discrete Mathematics L T P C

Version 1.0 3 1 0 4
Pre-requisites/Exposure Basic Knowledge of Engineering Mathematics

Co-requisites --

Course Objectives
1. To enable students to understand the fundamentals of set, relation, function and recurrence
relation.
2. To help the students to develop the skills related to mathematical logic.
3. To enable the students to gain the knowledge of posets and lattices.
4. To enable students to understand the fundamental concepts of graph theory and its applications in
computer science.
5. To make the students to understand the basic knowledge of algebraic structure.

Course Outcomes
On completion of this course, the students will be able to

CO1: Understand and interpret the fundamental mathematical structures; Set theory, Relation and
Functions and write recursive definitions of sequences and their solution.
CO2: Examine mathematical arguments using propositional logic.
CO3: Identify the Posets and lattices.
CO4: Understand and interpret the basics concepts of graph theory and its application in computer
Science and technology.
CO5: Demonstrate the working knowledge of fundamental algebraic structures.
CO6: Understand the concepts and applications of vector space.
Catalog Description

Mathematics is a necessary subject to a clear and complete understanding of virtually all phenomena.
It helps us to develop logical thinking and also to find the right way to solve problems. This course
covers basic concepts of set theory, relation, function, recurrence relation, mathematical logic, posets
and lattices, graph theory, tree and algebraic structures. This course is designed in such a way that it
enables the students to cope confidently with the mathematics needed in their future subjects and the
curriculum aims at developing student’s ability to conceptualize, reason and to use mathematics to
formulate and solve problems in their core subjects.

Course Content

Unit I: Set Theory, Relation, Function, Recurrence Relation 8 lecture hours

Introduction to set, relation and function. Introduction to recurrence relation and recursive
algorithms, linear recurrence relations with constant coefficients, homogeneous solutions,
particular solutions, total solutions.
Unit II: Mathematical Logic 6 lecture hours
Proposition, logical connectives, truth tables, tautology, contradiction, converse, inverse,
contrapositive, normal forms (conjunctive and disjunctive), validity of an argument, universal
and existential quantifiers.

Unit III: PoSets and Lattices 5 lecture hours

Hasse diagram, posets. Well-ordered set, maximal and minimal element. Lattices and
properties of lattices, some special lattices-bounded lattice and complemented lattices,
distributive lattice, modular lattice and complete lattice.

Unit IV: Graph Theory 10 lecture hours

Graph Theory and its applications, types of graphs, properties of graph, subgraphs, digraphs
and isomorphism. Paths, circuits, walks, cut sets, cut vertices, Euler and Hamiltonian graphs.
Shortest path problem in weighted graph, Dijkstra’s algorithm. Graph vertex coloring, Welch-
Powell’s algorithm, chromatic number and polynomial, decomposition’s theorem.

Unit V: Algebraic Structures 8 lecture hours

Group, Semi group, monoid group, abelian group-definitions and properties, subgroup, cyclic
group, permutation group, Homomorphism and isomorphism of groups. Definition of Ring and
field with examples.

Unit VI: Vector space and Linear Transformation 8 lecture hours

Vector Space, Subspaces, spanning set, basis and dimensions. Linear transformations-
definition and properties, Kernel and image of a linear transformation Rank-Nullity Theorem,
Matrices of composite linear transformation. Inverse of a linear transformation and
Isomorphism.

Text Books
1. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata Mcgraw Hill Professional.
ISBN: 978-1-25-906253-7.
2. Kenneth Rosen, Discrete Mathematics and Its applications, McGraw Hill Publications.
ISBN: 81-219- 0893-0.
3. J. A. Gallian, Contemporary Abstract Algebra, Narosa Publication, ISBN:
9788173190773.
4. Howard Anton and Chris Rorres, Elementary Linear Algebra, Wiley Publication.
ISBN: 9788126562961.

Reference Books
1. Swapan Kumar Sarkar, A Textbook of Discrete Mathematics, S. Chand & Company
Pvt. Ltd. ISBN: 81-219-2232-1.
2. Nar Singh Deo, Graph Theory with its Applications, PHI. ISBN: 81-7409-195-5.
3. I. N. Herstein, Abstract Algebra, Prentice Hall, ISBN: 9780471368793.
Modes of Evaluation: Class tests/Assignment/Tutorial Assessment/Written Examination
Examination Scheme:

Components IA MSE ESE

Weightage (%) 30 20 50

Relationship between the Program Outcomes (POs), Program Specific Outcomes and
Course Outcomes (COs)

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 0 0 0 0 0 0 0
3 3 1 1 1
CO2 0 0 0 0 0 0 0
3 3 1 1 1
CO3 0 0 0 0 0 0 0
3 2 1 1 1
CO4 0 0 0 0 0 0 0
3 2 1 1 1
CO5 0 0 0 0 0 0 0
3 2 1 1 1
CO6 0 0 0 0 0 0 0
3 2 1 1 1
Average 3 2 1 1 0 0 0 0 0 0 0 1

1. Weak Mapped 2. Moderate Mapped 3. Strong Mapped