2CS305 – Discrete Mathematics

Nirma University
Institute of Technology
Computer Science and Engineering Department
2CS305 – Discrete Mathematics
Course Policy

B. Tech Semester - III Academic Year: 2022-2023 (Odd)

The Program Educational Objectives of B. Tech. Program are:

PEO I: To prepare graduates who will be successful professionals in industry, government,
academia, research, entrepreneurial pursuit and consulting firms.
PEO II: To prepare graduates who will contribute to society as broadly educated, expressive,
ethical and responsible citizens with proven expertise.
PEO III: To prepare graduates who will achieve peer-recognition; as an individual or in a team;
through demonstration of good analytical, design and implementation skills.
PEO IV: To prepare graduates who will thrive to pursue life-long learning to fulfill their goals.

Program Outcomes of B. Tech. Program are:

PO1: Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution of complex
engineering problems.

PO2: Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first principles
of mathematics, natural sciences, and engineering sciences.

PO3: Design/development of solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.

PO4: Conduct investigations of complex problems: Use research-based knowledge

and research methods including design of experiments, analysis and interpretation of
data, and synthesis of the information to provide valid conclusions.

PO5: Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.

PO6: The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.

PO7: Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.

Page 1 of 10
2CS305 – Discrete Mathematics

PO8: Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.

PO9: Individual and team work: Function effectively as an individual, and as a member
or leader in diverse teams, and in multidisciplinary settings.

PO10. Communication: Communicate effectively on complex engineering activities with

the engineering community and with society at large, such as, being able to comprehend
and write effective reports and design documentation, make effective presentations, and
give and receive clear instructions.

PO11: Project management and finance: Demonstrate knowledge and understanding

of the engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multidisciplinary environments.

PO12. Life-long learning: Recognize the need for, and have the preparation and ability
to engage in independent and life-long learning in the broadest context of technological
change.

Program Specific Outcomes:

PSO 1: To apply the theoretical concepts of computer engineering and practical

knowledge in analysis, design and development of computing systems and
interdisciplinary applications

PSO 2: To work as a socially responsible professional by applying computer engineering

principles and management practices

Mapping of Course with POs:

Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
Name
DM √ √ √ √ √ √ √ √ √

Mapping of CLO with POs:

PO PO PSO PSO
CO No. CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO11
10 12 1 2
interpret the 3
2CS3 preliminaries
3 1
05.1 of discrete
mathematics
comprehend 2
role of discrete
2CS3 mathematics in
2 1 1
05.2 theoretical
computer
science
recognize the 3 2
2CS3
importance of 3 3 1 2 2
05.3
formal

Page 2 of 10
 2CS305 – Discrete Mathematics

approach for
solving
computing
problems

Course Code & Name : 2CS305 – Discrete Mathematics

Credit Details : Lectures - 2, Tutorials – 1, Practicals - 0 Credits - 3

Course Co-ordinator : Prof. Rupal Kapdi

Contact No. & Email
Office
Course Faculties
2. Dr. Sapan Mankad
Email:
sapan.mankad@nirmauni.ac.
in
Contact No. 079-71652-554
Office: NF9
Visiting Hours:
Course Website
(Phone) 079-71652-566
:
(Email) rupal.kapdi@nirmauni.ac.in
: NF2
1. Prof. Rupal Kapdi
: Visiting Hours: Wednesdays : 11.00 am to 1.00 pm
Odd Saturdays : 11.00 am to 1.00 pm
3. Dr. Pronoya Bhattacharya 4. Prof. Deepti Saraswat
Email: Email:
pronoya.bhattacharya@nirmauni.ac.i deepti.saraswat@nirmauni.ac.i
n n
Contact No. 079-71652- Contact No.079-71652-
Office: NF6 Office:
Visiting Hours: Visiting Hours:
Monday :
: Course: Discrete Mathematics (nirmauni.ac.in)

1. Introduction to Course

1.1 Importance of the course

This course is intended to provide a refresher to students on several concepts of Discrete
Mathematics and understand their significance in various Engineering applications.

1.2 Objective of the Course

The objective of the course is to build the fundamentals from Mathematical perspective into
students and prepare them for domain-specific or interdisciplinary applications of these aspects.
Students are expected to learn the concepts of various facets of Discrete Mathematics and use
them in solving problems in relevant fields.

1.3 Pre-requisite:
Basic knowledge of school level mathematical concepts.

2. Course Learning Outcomes (CLO)

CLOs are clear statements of the expectations for student achievements in the course.

After successful completion of the course, a student will be able to

1. interpret the preliminaries of discrete mathematics

Page 3 of 10
2CS305 – Discrete Mathematics

2. comprehend role of discrete mathematics in theoretical computer science

3. recognize the importance of formal approach for solving computing problems

3. Syllabus

Syllabus: Teaching
Hours:
Unit I 3
Sets, Relation and Function: Operations and laws of sets, Cartesian products, binary
relation, partial ordering relation, equivalence relation, image of a set, sum and
product of functions, bijective functions, inverse and composite function. Basic
counting techniques: inclusion and exclusion, pigeon-hole principle.

Unit II 6
Proof Techniques: proof methods and strategies, forward proof, proof by
contradiction, principles of mathematical induction, strong induction, the well-
ordering principle, recursive definition, proof by contraposition, proof of necessity
and sufficiency.

Unit III 6
Propositional Logic: syntax, semantics, validity and satisfiability, basic connectives
and truth tables. logical equivalence: the laws of logic, logical implication, rules of
inference, the use of quantifiers.

Unit IV 5
Algebraic Structures and Morphism: algebraic structures with one binary
operation, semi groups, monoids, groups, congruence relation and quotient
structures, free and cyclic monoids and groups, permutation groups.

Unit V 6
Graphs and Trees: graphs and their properties, isomorphism, Eulerian and
Hamiltonian walks, graph coloring, perfect graph, rooted trees, trees and sorting,
weighted trees and prefix codes, shortest path, spanning trees.

Unit VI 4
Recurrence Relations and Recursive Algorithms: Recurrence relations, linear
recurrence relations with constant coefficients, use of recurrence relations for
analysis of algorithms

3.1. Self-Study

The self-study components of the syllabus will be declared at the commencement of the semester.
Around 10% of the questions will be asked from self-study content.
Following topics are identified as self-study topics. Around 10% of the questions will be asked
from self-study contents.

1. Functions, composition of functions, recursive functions, hashing

2. graph coloring, perfect graph
3. Total Solution for recurrence relation
Page 4 of 10
2CS305 – Discrete Mathematics

Students are expected to study above mentioned topics on their own. These topics will not be
taught in the classroom. Students should refer the books available in the library for the same.

3.2. Suggested Readings^:

1. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill
2. Tremblay, J.P. & Manohar, Discrete mathematical structures with application to computer
science, McGraw Hill
3. Rosen, Kenneth L., Discrete Mathematics and its applications, McGraw Hill
4. Susanna S. Epp, Discrete Mathematics with Applications, Wadsworth Publishing Co. Inc.
Note: The latest edition of books should be referred.

4. Laboratory details
Not applicable.

5. Tutorials/ Term assignments/ Innovative assignments/ Term paper (as

applicable) details

Students are advised to get their doubts cleared in tutorial sessions. Tutorial work will be based
on the syllabus where following 10 tutorials will to be conducted.
Mapped
Sr. No. Tutorial topics Schedule*
CLO

1. Set Theory 16/08/2022 – 29/08/2022 1,2

2. Relations 30/08/2022 – 12/09/2022 1,2

Functions and Pigeon-hole
3. 13/09/2022 – 19/09/2022 1,2,3
principle
4. Propositional Logic 20/09/2022 – 03/10/2022 1

5. Mathematical Induction 04/10/2022 – 10/10/2022 2

6. Proof Techniques 11/10/2022 – 24/10/2022 1,2

7. Algebric structures and morphism 01/11/2022 – 07/11/2022 1

8. Graphs 08/11/2022 – 14/11/2022 1,2,3

9. Trees 15/11/2022 – 21/11/2022 1,2,3

10. Recurrence Relation 22/11/2022 – 05/12/2022 3

* Schedule is based on academic calendar.

Page 5 of 10
2CS305 – Discrete Mathematics

6. Assessment Policy

6.1 Component wise Continuous Evaluation (CE), Laboratory and Project Work (LPW) &
Semester End Examination (SEE) weightage

Assessment CE SEE
scheme
Component 0.6 0.4
weightage
Quizzes Sessional Exam Conceptual Test
30% 40% 30%

6.2 Assessment Policy for Continuous Evaluation (CE)

Assessment of Continuous Evaluation comprises of three components.

1. Quizzes will be conducted as per academic calendar. It will be conducted online/ offline for
the duration of 1 hour (30 mins each) and will be of 35 marks.
2. Sessional Exam will be conducted as per academic calendar. It will be conducted offline for
the duration of 1 hour and 15 minutes and will be of 35 marks.
3. The Assignment will be conducted in the last teaching week where MCQ based test will be
conducted. The duration of the test will be of 40 minutes and will be of 30 marks.

6.4 Assessment Policy for Semester End Examination (SEE)

A written examination of 3 hour duration will be conducted for the course as per academic
calendar. It will carry 100 marks and marks obtained out of 100 will be converted as per
weightage assigned.

7. Lesson Plan

Session Mapped
Topics
No. CLO

Overview of the course, Discussion on Course Policy, Course Website,

1 Importance of the course, Evaluation, Linkages of the course with other -
course/’s and Professional relevance

2 Operations and laws of sets, Cartesian products, principle of 1

inclusion and exclusion
3 binary relation, property of binary relations, partial ordering 2
relation
4 equivalence relation, image of a function, sum and product of a 2,3
function
5 Pigeon-hole principle 1,2,3

6 Introduction to proof techniques, forward proof 1,2

7 proof by contradiction 1,2

Page 6 of 10
2CS305 – Discrete Mathematics

8 Proof Techniques: Mathematical Induction 1,2

9 Strong mathematical induction and well-ordering principle 1

10 Recursive definition, proof by contraposition 1,2

11 Proof of necessity and sufficiency 1,2

12 Propositional Logic syntax semantics, validity and satisfiability 1

13 Basic connectives and truth tables 1,2

14 Logical equivalence 2,3

15 The laws of logic, logical implication, rules of inference 1,2

16 The use of quantifiers 2,3

17 Algebraic structures with one binary operation 1

18 Groups, semi-groups, monoids 1,2

19 Congruence relation and quotient structures 2

20 Free and cyclic monoids and groups 1,2

21 Permutation groups 2

22 Graph Theory: Basic Terminology 1

23 Graph properties, isomorphism, Eulerian and Hamiltonion walks, 1,2

perfect graph
24 Trees, Rooted Trees, weighted trees 1,2

25 Prefix Codes 3

26 Shortest paths 3

27 spanning trees 3

28 Recurrence Relations 1,2

29 Linear recurrence relations with constant coefficients 1,2

30 Homogeneous solutions 2

31 Particular solutions 2

32 Summarize topics covered in the course and express the linkages with -
other courses.

Page 7 of 10
2CS305 – Discrete Mathematics

8. Mapping of Session Learning Outcomes (SLO) with Course Learning Outcomes (CLO)

Session Session Learning Outcomes:

No. After successful completion of the session, student will be able to CLO

1 Understand importance, scope and policy of the course -

2,3,4,5 Understand set theory, relations and functions along with its real life 1,2,3
applications
6 Understand the concept of proof technique 1

7 Apply proof Technique: forward proof and proof by contradiction 2,3

8 Apply Proof Techniques: Mathematical Induction 2,3

9 Understand the concept of strong mathematical induction and well- 1,2

ordering principle
Understand the concept recursive definition and proof by 1,2
10
contraposition
11 Understand the concept of proof of necessity and sufficiency 1,2

12, 13 Propositional Logic syntax semantics, validity and satisfiability

1,2
Basic connectives and truth tables
14 Apply the concept of logical equivalence 2,3

15 Understand laws of logic, logical implication, rules of inference 1

16 Apply the use of quantifiers 3

17 Understand the algebraic structures with one binary operation 1

18, 19, 20 Understand the concepts of groups, semi-groups, monoids, Congruence 1,2
relation and quotient structures, Free and cyclic monoids and groups
21 Apply the Permutation groups 2

22, 23, 24 Understand the concept of Graph Theory, Graph properties, 1,2
isomorphism, Eulerian and Hamiltonion walks, perfect graph, Trees,
Rooted Trees, weighted trees
25 Apply the concept of tree to prefix code 3

26 Apply the concept of graph to find the shortest path 3

27 Apply the concept of tree to find spanning tree 3

28, 29 Understand the concept of Recurrence Relations and Linear recurrence 1,2
relations with constant coefficients
30, 31 Apply the concept of recurrence relation to find homogeneous, 2,3
particular and total solutions.

Page 8 of 10
2CS305 – Discrete Mathematics

Summarize topics covered in the course and express the linkages with -
32
other courses.

9. Teaching-learning methodology

1. Lectures: Primarily Chalk and Black board will be used to conduct the course.
However, where required, Power Point Presentations (PPTs), Video Lectures,
Animations etc. will be used to enhance the teaching-learning process.
2. Tutorial: Emphasis will be on one to one interaction with students for clearing their
doubts and problem solving. Further, different approaches towards problem solving
and students’ ability to map and understand applications of mathematical concepts
to real-world systems will be observed.

10. Active learning techniques

Active learning is a method of learning in which students are actively or experientially

involved in the learning process. Following active learning techniques will be adopted for
the course.

Activity 1 – Background Knowledge Probe

Activity 2 – Application Cards
Activity 3 - Teacher designed feedback forms
Activity 4 - Profiles of admirable individuals

11. Course Material

Following course material will be uploaded on the course website:

• Course Policy
• Lecture Notes
• Books / Reference Books / NPTEL video lectures
• Assignments, Tutorials, Lab Manuals
• Question bank
• Web-links, Blogs, Video Lectures, Journals
• Animations /Simulations, Softwares
• Advanced topics

12. Course Learning Outcome Attainment

Following means will be used to assess attainment of course learning outcomes.

• Use of formal evaluation components of continuous evaluation, tutorials, laboratory
work, semester end examination
• Informal feedback during course conduction

Page 9 of 10
2CS305 – Discrete Mathematics

13. Academic Integrity Statement

Students are expected to carry out assigned work under Continuous Evaluation (CE)
component and LPW component independently. Copying in any form is not acceptable
and will invite strict disciplinary action. Evaluation of corresponding component will be
affected proportionately in such cases. Turnitin software will be used to check plagiarism
wherever applicable. Academic integrity is expected from students in all components of
course assessment.

List of Tutorials for improvement in PO/PSO attainment

Topic wise tutorials will be uploaded after completion of the topic in theory session.

Page 10 of 10