Course Title: Mathematics Foundation to L T P/S SW/FW TOTAL
Computer Science – I CREDIT
Course Code: MATH117 UNITS
Credit Units: 03 3 0 - - 3
Course Level: UG
Syllabus Version-I
Course Description:
This course provides a structured foundation in discrete mathematics and matrix algebra, essential for applications in
computer science and engineering. It covers fundamental concepts of set theory, relations, and functions, including
their properties and applications. Counting principles and recurrence relations are explored, with examples like the
Fibonacci sequence and the Tower of Hanoi problem. Graph theory introduces key terminologies, classifications, and
special graph structures, emphasizing their computational relevance. Matrix algebra includes operations, determinants,
rank, inverse calculations, and applications in solving linear systems, along with eigenvalues, eigenvectors, and the
Cayley-Hamilton theorem. By mastering these topics, students will develop analytical skills essential for advanced
mathematical modelling and computational problem-solving.
Course Objective:
1. Remember: Define and recall fundamental concepts of discrete mathematics, including set theory, relations,
functions, counting principles, recurrence relations, graph theory, and matrix algebra.
2. Understand: Explain the properties of set operations, relations, and functions, and interpret recurrence
relations, graph structures, and matrix operations.
3. Apply: Solve problems related to counting principles, recurrence relations, graph traversal, matrix operations,
and eigenvalue computation.
4. Analyze: Examine and differentiate between various types of relations, graph classifications, and matrix
transformations, identifying their computational relevance.
Pre-requisites:
Basic knowledge of Mathematics.
Course Contents/Syllabus:
Weightage (%) Lecture
Hours
Module I: Set, Relation and Function 12
Set, Set Operations, Properties of Set operations, Subset, Venn
Diagrams, Cartesian Products. Relations on a Set, Properties of 25
Relations, Representing Relations using matrices and digraphs,
Types of Relations, Equivalence Relation, Equivalence relation and
partition on set, Closures of Relations, Warshall’s algorithm.
Functions, properties of functions (domain, range), composition of
functions, surjective (onto), injective (one-to-one) and bijective
functions, inverse of functions.
Some useful functions for Computer Science: Exponential and
Logarithmic functions, Polynomial functions, Ceiling and Floor
functions.
Module II: Counting and Recurrence Relation 11
25
Basics of counting, permutation, combination, Binomial
coefficients, Binomial theorem.
Recurrence relations, modelling recurrence relations with
examples, like Fibonacci numbers, the tower of Hanoi problem.
Solving linear recurrence relation with constant coefficients
using characteristic equation roots method.
Module III: Elementary Graph Theory 11
Basic terminologies of graphs, connected and disconnected graphs,
subgraph, paths and cycles, complete graphs, digraphs, weighted 25
graphs, Euler and Hamiltonian graphs.
Trees, properties of trees, concept of spanning tree. Planar graphs.
Definitions and basic results on the topics mentioned.
Module IV: Matrix Algebra 11
Types of matrices, algebra of matrices-addition, subtraction, and
multiplication of matrices, determinant of a matrix, symmetric and 25
skew-symmetric matrices, orthogonal matrix, rank of a matrix, inverse
of a matrix.
Course Learning Outcomes (CLOs):
After completion of the course, the student will be able to:
CLO1: Understand fundamental concepts of discrete mathematics, including set theory, relations,
functions, counting principles, recurrence relations, graph theory, and matrix algebra.
CLO2: Apply knowledge to solve problems related to counting principles, recurrence relations, graph
traversal, matrix operations, and eigenvalue computation.
CLO3: Analyze various types of relations, graph classifications, and matrix transformations, identifying
their computational relevance.
CLO4: Evaluate the effectiveness of different recurrence solutions, graph models, and matrix techniques in
mathematical modelling and computer applications.
Pedagogy for Course Delivery:
The course will be taught in theory-based mode. The instructor will discuss set, relation, function, graph theory
and matrix algebra problems to the students for better understanding of the concept.
Assessment/ Examination Scheme:
Theory L/T (%) Lab/Practical/Studio (%) TOTAL
100 - 100
Theory Assessment (L&T):
Continuous End Term
Assessment/Internal Examination
Assessment
Components
Class Assignment Quiz Attendance EE
(Dropdown)
Test
Weightage (%) 20 10 5 5 60
SN Bloom’s Course Learning Outcomes Class Assignment Quiz
Level Test
1 Understand Understand fundamental concepts of discrete mathematics,
including set theory, relations, functions, counting
principles, recurrence relations, graph theory, and matrix
algebra.
2 Apply Apply knowledge to solve problems related to counting
principles, recurrence relations, graph traversal, matrix
operations, and eigenvalue computation.
3 Analyze Analyze various types of relations, graph classifications, and
matrix transformations, identifying their computational
relevance.
4 Evaluate Evaluate the effectiveness of different recurrence solutions,
graph models, and matrix techniques in mathematical
modelling and computer applications.
Text book:
Garg, Reena, Engineering Mathematics, Khanna Book Publishing Company, 2024. (AICTE Recommended
Textbook)
Garg, Reena, Advanced Engineering Mathematics, Khanna Book Publishing Company, 2023.
Kolman B., Busby R. and Ross S., Discrete Mathematical Structures, 6th Edition, Pearson Education, 2015.
Deo Narsingh, Graph Theory with Application to Engineering and Computer Science, Prentice Hall, India,
1979.
Vasishtha A. R. and Vasishtha A. K., Matrices, Krishna Prakashan, 2022.
References book:
Grimaldi Ralph P. and Ramana B. V., Discrete and Combinatorial Mathematics: An Applied Introduction,
Fifth Edition, Pearson Education, 2007.
Rosen Kenneth H. and Krithivasan Kamala, Discrete Mathematics and its Applications, McGraw Hill, India,
2019.
West Douglas B., Introduction to Graph Theory, Second Edition, Pearson Education, 2015
Web Resources
https://nptel.ac.in/courses/106103205
https://nptel.ac.in/courses/111101115
